/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:31:52,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:31:52,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:31:52,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:31:52,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:31:52,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:31:52,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:31:52,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:31:52,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:31:52,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:31:52,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:31:52,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:31:52,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:31:52,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:31:52,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:31:52,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:31:52,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:31:52,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:31:52,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:31:52,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:31:52,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:31:52,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:31:52,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:31:52,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:31:52,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:31:52,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:31:52,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:31:52,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:31:52,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:31:52,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:31:52,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:31:52,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:31:52,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:31:52,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:31:52,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:31:52,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:31:52,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:31:52,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:31:52,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:31:52,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:31:52,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:31:52,262 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:31:52,277 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:31:52,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:31:52,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:31:52,278 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:31:52,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:31:52,279 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:31:52,279 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:31:52,279 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:31:52,279 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:31:52,280 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:31:52,280 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:31:52,280 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:31:52,280 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:31:52,280 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:31:52,280 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:31:52,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:31:52,281 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:31:52,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:31:52,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:31:52,281 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:31:52,282 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:31:52,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:31:52,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:31:52,282 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:31:52,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:31:52,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:31:52,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:31:52,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:31:52,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:31:52,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:31:52,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:31:52,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:31:52,470 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:31:52,470 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:31:52,471 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:31:52,538 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_c7_mI6/tmp/9b76e8d40428478a9fe15a6b90448214/FLAG2eb4c2b44 [2020-07-01 12:31:52,883 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:31:52,884 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:31:52,884 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:31:52,891 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_c7_mI6/tmp/9b76e8d40428478a9fe15a6b90448214/FLAG2eb4c2b44 [2020-07-01 12:31:53,287 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_c7_mI6/tmp/9b76e8d40428478a9fe15a6b90448214 [2020-07-01 12:31:53,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:31:53,300 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:31:53,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:31:53,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:31:53,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:31:53,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b8414c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53, skipping insertion in model container [2020-07-01 12:31:53,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:31:53,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:31:53,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:31:53,588 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:31:53,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:31:53,623 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:31:53,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53 WrapperNode [2020-07-01 12:31:53,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:31:53,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:31:53,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:31:53,625 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:31:53,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,644 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:31:53,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:31:53,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:31:53,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:31:53,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... [2020-07-01 12:31:53,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:31:53,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:31:53,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:31:53,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:31:53,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:31:53,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:31:53,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:31:53,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:31:53,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:31:53,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:31:53,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:31:54,003 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:31:54,003 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:31:54,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:31:54 BoogieIcfgContainer [2020-07-01 12:31:54,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:31:54,007 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:31:54,007 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:31:54,009 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:31:54,010 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:31:54" (1/1) ... [2020-07-01 12:31:54,024 INFO L313 BlockEncoder]: Initial Icfg 22 locations, 26 edges [2020-07-01 12:31:54,025 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:31:54,026 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:31:54,027 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:31:54,027 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:31:54,029 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:31:54,030 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:31:54,030 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:31:54,049 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:31:54,075 INFO L200 BlockEncoder]: SBE split 8 edges [2020-07-01 12:31:54,080 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:31:54,084 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:31:54,111 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 12:31:54,114 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 12:31:54,115 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:31:54,115 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:31:54,116 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:31:54,116 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:31:54,117 INFO L313 BlockEncoder]: Encoded RCFG 15 locations, 27 edges [2020-07-01 12:31:54,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:31:54 BasicIcfg [2020-07-01 12:31:54,117 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:31:54,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:31:54,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:31:54,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:31:54,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:31:53" (1/4) ... [2020-07-01 12:31:54,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232c2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:31:54, skipping insertion in model container [2020-07-01 12:31:54,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (2/4) ... [2020-07-01 12:31:54,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232c2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:31:54, skipping insertion in model container [2020-07-01 12:31:54,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:31:54" (3/4) ... [2020-07-01 12:31:54,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232c2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:31:54, skipping insertion in model container [2020-07-01 12:31:54,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:31:54" (4/4) ... [2020-07-01 12:31:54,126 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:31:54,136 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:31:54,144 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-01 12:31:54,158 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-01 12:31:54,182 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:31:54,182 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:31:54,182 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:31:54,182 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:31:54,182 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:31:54,183 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:31:54,183 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:31:54,183 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:31:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-07-01 12:31:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:31:54,204 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:54,204 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:31:54,205 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:54,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:54,211 INFO L82 PathProgramCache]: Analyzing trace with hash 126038835, now seen corresponding path program 1 times [2020-07-01 12:31:54,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:54,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394764489] [2020-07-01 12:31:54,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:54,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394764489] [2020-07-01 12:31:54,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:54,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:31:54,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454521301] [2020-07-01 12:31:54,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:54,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:54,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:54,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:54,405 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-07-01 12:31:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:54,484 INFO L93 Difference]: Finished difference Result 26 states and 45 transitions. [2020-07-01 12:31:54,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:54,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:31:54,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:54,497 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:31:54,498 INFO L226 Difference]: Without dead ends: 15 [2020-07-01 12:31:54,501 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-01 12:31:54,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-01 12:31:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 12:31:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2020-07-01 12:31:54,537 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 5 [2020-07-01 12:31:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:54,538 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. [2020-07-01 12:31:54,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2020-07-01 12:31:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:31:54,538 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:54,539 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:31:54,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:31:54,541 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:54,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:54,582 INFO L82 PathProgramCache]: Analyzing trace with hash 126038866, now seen corresponding path program 1 times [2020-07-01 12:31:54,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:54,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355134158] [2020-07-01 12:31:54,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:54,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355134158] [2020-07-01 12:31:54,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:54,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:31:54,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780079655] [2020-07-01 12:31:54,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:54,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:54,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:54,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:54,627 INFO L87 Difference]: Start difference. First operand 15 states and 24 transitions. Second operand 3 states. [2020-07-01 12:31:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:54,687 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. [2020-07-01 12:31:54,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:54,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:31:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:54,689 INFO L225 Difference]: With dead ends: 15 [2020-07-01 12:31:54,689 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 12:31:54,690 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 12:31:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 12:31:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:31:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2020-07-01 12:31:54,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 22 transitions. Word has length 5 [2020-07-01 12:31:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:54,694 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 22 transitions. [2020-07-01 12:31:54,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 22 transitions. [2020-07-01 12:31:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:31:54,695 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:54,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:31:54,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:31:54,695 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:54,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:54,696 INFO L82 PathProgramCache]: Analyzing trace with hash 126038868, now seen corresponding path program 1 times [2020-07-01 12:31:54,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:54,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977192478] [2020-07-01 12:31:54,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:54,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977192478] [2020-07-01 12:31:54,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:54,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:31:54,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762246783] [2020-07-01 12:31:54,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:31:54,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:54,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:31:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:31:54,740 INFO L87 Difference]: Start difference. First operand 14 states and 22 transitions. Second operand 4 states. [2020-07-01 12:31:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:54,784 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2020-07-01 12:31:54,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:31:54,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:31:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:54,786 INFO L225 Difference]: With dead ends: 15 [2020-07-01 12:31:54,786 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 12:31:54,786 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:31:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 12:31:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 12:31:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:31:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2020-07-01 12:31:54,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 5 [2020-07-01 12:31:54,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:54,790 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 21 transitions. [2020-07-01 12:31:54,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:31:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 21 transitions. [2020-07-01 12:31:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:31:54,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:54,791 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:31:54,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:31:54,791 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:54,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:54,792 INFO L82 PathProgramCache]: Analyzing trace with hash 126038869, now seen corresponding path program 1 times [2020-07-01 12:31:54,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:54,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719871120] [2020-07-01 12:31:54,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:54,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719871120] [2020-07-01 12:31:54,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:54,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:31:54,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768949980] [2020-07-01 12:31:54,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:54,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:54,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:54,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:54,828 INFO L87 Difference]: Start difference. First operand 14 states and 21 transitions. Second operand 3 states. [2020-07-01 12:31:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:54,864 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2020-07-01 12:31:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:54,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:31:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:54,866 INFO L225 Difference]: With dead ends: 14 [2020-07-01 12:31:54,866 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 12:31:54,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 12:31:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-01 12:31:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 12:31:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2020-07-01 12:31:54,869 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 5 [2020-07-01 12:31:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:54,870 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-07-01 12:31:54,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 20 transitions. [2020-07-01 12:31:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:31:54,870 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:54,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:54,871 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:31:54,871 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:54,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:54,871 INFO L82 PathProgramCache]: Analyzing trace with hash 864282960, now seen corresponding path program 1 times [2020-07-01 12:31:54,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:54,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110844480] [2020-07-01 12:31:54,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:54,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110844480] [2020-07-01 12:31:54,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:54,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:31:54,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594545058] [2020-07-01 12:31:54,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:31:54,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:54,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:31:54,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:31:54,954 INFO L87 Difference]: Start difference. First operand 13 states and 20 transitions. Second operand 6 states. [2020-07-01 12:31:55,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:55,087 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. [2020-07-01 12:31:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:31:55,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-01 12:31:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:55,090 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:31:55,090 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:31:55,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:31:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:31:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2020-07-01 12:31:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 12:31:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2020-07-01 12:31:55,096 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 7 [2020-07-01 12:31:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:55,096 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. [2020-07-01 12:31:55,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:31:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2020-07-01 12:31:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:31:55,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:55,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:55,098 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:31:55,098 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:55,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:55,098 INFO L82 PathProgramCache]: Analyzing trace with hash 864282957, now seen corresponding path program 1 times [2020-07-01 12:31:55,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:55,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352903712] [2020-07-01 12:31:55,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:55,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352903712] [2020-07-01 12:31:55,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:55,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:31:55,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111941783] [2020-07-01 12:31:55,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:31:55,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:55,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:31:55,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:31:55,141 INFO L87 Difference]: Start difference. First operand 15 states and 24 transitions. Second operand 4 states. [2020-07-01 12:31:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:55,183 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. [2020-07-01 12:31:55,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:31:55,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 12:31:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:55,185 INFO L225 Difference]: With dead ends: 15 [2020-07-01 12:31:55,185 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 12:31:55,185 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:31:55,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 12:31:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 12:31:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:31:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2020-07-01 12:31:55,200 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 7 [2020-07-01 12:31:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:55,200 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-07-01 12:31:55,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:31:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2020-07-01 12:31:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:31:55,201 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:55,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:55,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:31:55,202 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:55,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:55,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1022967120, now seen corresponding path program 1 times [2020-07-01 12:31:55,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:55,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076088464] [2020-07-01 12:31:55,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:55,271 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076088464] [2020-07-01 12:31:55,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:55,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:31:55,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285671973] [2020-07-01 12:31:55,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:31:55,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:55,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:31:55,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:31:55,273 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 5 states. [2020-07-01 12:31:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:55,345 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2020-07-01 12:31:55,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:31:55,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-01 12:31:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:55,346 INFO L225 Difference]: With dead ends: 14 [2020-07-01 12:31:55,346 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 12:31:55,347 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:31:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 12:31:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-01 12:31:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 12:31:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-07-01 12:31:55,350 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 8 [2020-07-01 12:31:55,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:55,351 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-01 12:31:55,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:31:55,351 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2020-07-01 12:31:55,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:31:55,351 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:55,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:55,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:31:55,352 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:55,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:55,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1022967122, now seen corresponding path program 1 times [2020-07-01 12:31:55,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:55,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223823753] [2020-07-01 12:31:55,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:55,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223823753] [2020-07-01 12:31:55,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:55,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:31:55,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931015083] [2020-07-01 12:31:55,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:31:55,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:55,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:31:55,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:31:55,402 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 5 states. [2020-07-01 12:31:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:55,470 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-07-01 12:31:55,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:31:55,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-01 12:31:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:55,471 INFO L225 Difference]: With dead ends: 17 [2020-07-01 12:31:55,472 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 12:31:55,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:31:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 12:31:55,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2020-07-01 12:31:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:31:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2020-07-01 12:31:55,476 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 8 [2020-07-01 12:31:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:55,476 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-07-01 12:31:55,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:31:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2020-07-01 12:31:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:31:55,477 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:55,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:55,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:31:55,477 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:55,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:55,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1022967123, now seen corresponding path program 1 times [2020-07-01 12:31:55,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:55,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149359094] [2020-07-01 12:31:55,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:55,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149359094] [2020-07-01 12:31:55,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:55,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:31:55,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446839715] [2020-07-01 12:31:55,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:31:55,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:55,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:31:55,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:31:55,557 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 6 states. [2020-07-01 12:31:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:55,644 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-01 12:31:55,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:31:55,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-07-01 12:31:55,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:55,645 INFO L225 Difference]: With dead ends: 16 [2020-07-01 12:31:55,646 INFO L226 Difference]: Without dead ends: 15 [2020-07-01 12:31:55,646 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:31:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-01 12:31:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-07-01 12:31:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:31:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-07-01 12:31:55,650 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 8 [2020-07-01 12:31:55,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:55,650 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-01 12:31:55,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:31:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-01 12:31:55,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:31:55,651 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:55,651 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:55,651 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:31:55,652 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:55,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:55,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1875493847, now seen corresponding path program 1 times [2020-07-01 12:31:55,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:55,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723546514] [2020-07-01 12:31:55,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:55,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723546514] [2020-07-01 12:31:55,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:55,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 12:31:55,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058465771] [2020-07-01 12:31:55,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:31:55,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:55,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:31:55,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:31:55,742 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 7 states. [2020-07-01 12:31:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:55,856 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2020-07-01 12:31:55,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:31:55,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-01 12:31:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:55,858 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:31:55,858 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 12:31:55,858 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:31:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 12:31:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 12:31:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:31:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-07-01 12:31:55,862 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 11 [2020-07-01 12:31:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:55,862 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-01 12:31:55,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:31:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2020-07-01 12:31:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:31:55,863 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:55,863 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:55,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:31:55,863 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:55,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:55,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1990239297, now seen corresponding path program 1 times [2020-07-01 12:31:55,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:55,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904097027] [2020-07-01 12:31:55,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:56,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904097027] [2020-07-01 12:31:56,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676676052] [2020-07-01 12:31:56,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:56,084 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-01 12:31:56,090 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:31:56,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:31:56,164 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:31:56,177 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:56,180 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:31:56,180 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-07-01 12:31:56,279 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:56,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-07-01 12:31:56,281 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:31:56,284 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:31:56,302 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:56,305 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:31:56,309 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:31:56,311 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:31:56,313 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:31:56,313 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2020-07-01 12:31:56,346 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:31:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:56,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:31:56,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-01 12:31:56,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217739843] [2020-07-01 12:31:56,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-01 12:31:56,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:56,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-01 12:31:56,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:31:56,352 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 12 states. [2020-07-01 12:31:56,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:56,739 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-07-01 12:31:56,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 12:31:56,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2020-07-01 12:31:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:56,740 INFO L225 Difference]: With dead ends: 19 [2020-07-01 12:31:56,740 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:31:56,741 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2020-07-01 12:31:56,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:31:56,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-01 12:31:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 12:31:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-07-01 12:31:56,745 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 11 [2020-07-01 12:31:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:56,745 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-01 12:31:56,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-01 12:31:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2020-07-01 12:31:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:31:56,746 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:56,746 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:56,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-01 12:31:56,947 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:56,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:56,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1990239296, now seen corresponding path program 1 times [2020-07-01 12:31:56,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:56,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171787855] [2020-07-01 12:31:56,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:57,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171787855] [2020-07-01 12:31:57,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230151012] [2020-07-01 12:31:57,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:57,040 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:31:57,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:31:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:57,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:31:57,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:31:57,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981265506] [2020-07-01 12:31:57,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:31:57,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:57,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:31:57,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:31:57,054 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 8 states. [2020-07-01 12:31:57,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:57,149 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-01 12:31:57,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:31:57,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-07-01 12:31:57,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:57,150 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:31:57,150 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 12:31:57,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:31:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 12:31:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 12:31:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 12:31:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-07-01 12:31:57,154 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2020-07-01 12:31:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:57,155 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-07-01 12:31:57,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:31:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-07-01 12:31:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:31:57,155 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:57,156 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:57,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-01 12:31:57,356 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:57,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:57,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1567875201, now seen corresponding path program 1 times [2020-07-01 12:31:57,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:57,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645547756] [2020-07-01 12:31:57,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:57,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645547756] [2020-07-01 12:31:57,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895878466] [2020-07-01 12:31:57,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:57,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:31:57,470 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:31:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:57,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:31:57,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:31:57,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932856937] [2020-07-01 12:31:57,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:31:57,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:57,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:31:57,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:31:57,483 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2020-07-01 12:31:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:57,578 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-01 12:31:57,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:31:57,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-01 12:31:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:57,579 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:31:57,579 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 12:31:57,579 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:31:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 12:31:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 12:31:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 12:31:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-07-01 12:31:57,583 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2020-07-01 12:31:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:57,583 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-01 12:31:57,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:31:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-07-01 12:31:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:31:57,584 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:57,584 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:57,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-01 12:31:57,785 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:57,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:57,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1567875202, now seen corresponding path program 1 times [2020-07-01 12:31:57,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:57,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417497040] [2020-07-01 12:31:57,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:57,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417497040] [2020-07-01 12:31:57,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675731048] [2020-07-01 12:31:57,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:57,948 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 44 conjunts are in the unsatisfiable core [2020-07-01 12:31:57,949 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:31:57,955 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_11|], 1=[|v_#valid_20|]} [2020-07-01 12:31:57,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:31:57,962 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:31:57,963 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:31:57,973 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:57,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:31:57,982 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:31:57,992 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:57,993 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:31:57,993 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:15 [2020-07-01 12:31:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:58,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:31:58,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2020-07-01 12:31:58,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813956461] [2020-07-01 12:31:58,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:31:58,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:58,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:31:58,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:31:58,171 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 15 states. [2020-07-01 12:32:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:03,805 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-07-01 12:32:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:32:03,805 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-07-01 12:32:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:03,805 INFO L225 Difference]: With dead ends: 19 [2020-07-01 12:32:03,806 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:32:03,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2020-07-01 12:32:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:32:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-07-01 12:32:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 12:32:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-07-01 12:32:03,810 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2020-07-01 12:32:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:03,810 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-07-01 12:32:03,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:32:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-07-01 12:32:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:32:03,811 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:03,811 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:04,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:04,012 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:04,012 INFO L82 PathProgramCache]: Analyzing trace with hash 799676058, now seen corresponding path program 2 times [2020-07-01 12:32:04,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:04,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425603444] [2020-07-01 12:32:04,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:04,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425603444] [2020-07-01 12:32:04,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000540118] [2020-07-01 12:32:04,248 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:04,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:32:04,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:32:04,296 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 42 conjunts are in the unsatisfiable core [2020-07-01 12:32:04,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:04,302 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_12|], 1=[|v_#valid_21|]} [2020-07-01 12:32:04,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:32:04,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:32:04,307 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:04,314 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:04,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:04,319 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:04,326 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:04,326 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:04,327 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-07-01 12:32:04,357 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:32:04,358 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:04,362 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:04,362 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:04,363 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-07-01 12:32:04,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-01 12:32:04,407 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:04,413 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:04,414 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:04,414 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-07-01 12:32:04,471 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:04,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 12:32:04,473 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:04,473 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:04,482 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:04,482 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:32:04,484 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:32:04,484 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-07-01 12:32:04,519 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:04,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:04,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-01 12:32:04,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913404040] [2020-07-01 12:32:04,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 12:32:04,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:04,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 12:32:04,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:32:04,523 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 17 states. [2020-07-01 12:32:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:05,203 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2020-07-01 12:32:05,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:32:05,203 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2020-07-01 12:32:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:05,203 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:32:05,204 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:32:05,204 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2020-07-01 12:32:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:32:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:32:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:32:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:32:05,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-07-01 12:32:05,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:05,205 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:32:05,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 12:32:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:32:05,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:32:05,406 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-01 12:32:05,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:32:05,812 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2020-07-01 12:32:05,817 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:32:05,817 INFO L268 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2020-07-01 12:32:05,817 INFO L268 CegarLoopResult]: For program point L22-1(lines 16 31) no Hoare annotation was computed. [2020-07-01 12:32:05,817 INFO L268 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-07-01 12:32:05,817 INFO L268 CegarLoopResult]: For program point L19-2(lines 16 31) no Hoare annotation was computed. [2020-07-01 12:32:05,817 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:32:05,817 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 12:32:05,818 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:32:05,818 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 12:32:05,818 INFO L268 CegarLoopResult]: For program point L10-2(line 10) no Hoare annotation was computed. [2020-07-01 12:32:05,818 INFO L268 CegarLoopResult]: For program point L10-3(lines 10 11) no Hoare annotation was computed. [2020-07-01 12:32:05,818 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:32:05,818 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:32:05,819 INFO L264 CegarLoopResult]: At program point L10-5(lines 10 11) the Hoare annotation is: (let ((.cse9 (select |#length| ULTIMATE.start_main_~nondetArea~0.base)) (.cse1 (select |#memory_int| ULTIMATE.start_cstrcpy_~src~0.base)) (.cse0 (select |#length| ULTIMATE.start_cstrcpy_~src~0.base)) (.cse21 (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (let ((.cse2 (= 0 ULTIMATE.start_cstrcpy_~dst~0.offset)) (.cse4 (= ULTIMATE.start_cstrcpy_~src~0.offset 0)) (.cse15 (not .cse21)) (.cse16 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse3 (<= 1 |#StackHeapBarrier|)) (.cse10 (select |#length| ULTIMATE.start_cstrcpy_~dst~0.base)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_cstrcpy_~src~0.base))) (.cse17 (not (= ULTIMATE.start_cstrcpy_~src~0.base ULTIMATE.start_cstrcpy_~dst~0.base))) (.cse18 (= 0 (select .cse1 (+ .cse0 (- 1))))) (.cse6 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse7 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString~0.base))) (.cse8 (or .cse21 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1))) (.cse19 (<= (+ ULTIMATE.start_cstrcpy_~src~0.offset 1) .cse0)) (.cse11 (= 1 (select |#valid| ULTIMATE.start_cstrcpy_~dst~0.base))) (.cse20 (<= ULTIMATE.start_main_~length2~0 .cse9)) (.cse12 (= 0 ULTIMATE.start_main_~nondetArea~0.offset)) (.cse13 (= 0 ULTIMATE.start_main_~nondetString~0.offset)) (.cse14 (= ULTIMATE.start_main_~length2~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base)))) (or (and (<= 1 .cse0) (= 0 (select .cse1 ULTIMATE.start_cstrcpy_~src~0.offset)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 .cse9) (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset)) (<= 1 .cse10) .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse18 .cse6 .cse7 .cse8 .cse19 .cse11 .cse20 .cse12 (<= .cse0 .cse10) .cse13 .cse14) (and .cse15 .cse16 .cse3 (<= (+ .cse0 ULTIMATE.start_cstrcpy_~dst~0.offset) (+ ULTIMATE.start_cstrcpy_~src~0.offset .cse10)) .cse5 .cse17 .cse18 .cse6 .cse7 (<= 1 ULTIMATE.start_cstrcpy_~src~0.offset) .cse8 (<= 1 ULTIMATE.start_cstrcpy_~dst~0.offset) .cse19 .cse11 .cse20 .cse12 .cse13 .cse14)))) [2020-07-01 12:32:05,819 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 12:32:05,821 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:32:05,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:05,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:05,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:05,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:05,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,839 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,839 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,839 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,839 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:05,839 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,840 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,840 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:05,840 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,840 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,841 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,841 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:05,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:05,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:05,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:05,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:05,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:05,857 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,857 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,857 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,857 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:05,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:32:05 BasicIcfg [2020-07-01 12:32:05,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:32:05,862 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:32:05,862 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:32:05,866 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:32:05,867 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:05,867 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:31:53" (1/5) ... [2020-07-01 12:32:05,868 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bd8b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:32:05, skipping insertion in model container [2020-07-01 12:32:05,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:05,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:53" (2/5) ... [2020-07-01 12:32:05,868 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bd8b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:32:05, skipping insertion in model container [2020-07-01 12:32:05,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:05,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:31:54" (3/5) ... [2020-07-01 12:32:05,869 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bd8b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:32:05, skipping insertion in model container [2020-07-01 12:32:05,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:05,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:31:54" (4/5) ... [2020-07-01 12:32:05,869 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bd8b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:32:05, skipping insertion in model container [2020-07-01 12:32:05,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:05,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:32:05" (5/5) ... [2020-07-01 12:32:05,871 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:32:05,893 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:32:05,893 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:32:05,893 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:32:05,893 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:32:05,894 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:32:05,894 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:32:05,894 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:32:05,894 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:32:05,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-01 12:32:05,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:32:05,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:32:05,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:32:05,907 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:32:05,907 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:32:05,907 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:32:05,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-01 12:32:05,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:32:05,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:32:05,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:32:05,909 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:32:05,909 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:32:05,914 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue [103] ULTIMATE.startENTRY-->L19: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_15| (store |v_#valid_16| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_9, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_15|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc5.offset] 11#L19true [62] L19-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 6#L19-2true [76] L19-2-->L22-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 15#L22-1true [88] L22-1-->L28: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2|)) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2| 1)) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_8) |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length2~0_8)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (>= v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~length2~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~malloc5.offset] 7#L28true [105] L28-->L10-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12))) (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.offset_7 |v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.base_5 v_ULTIMATE.start_cstrcpy_~s2.base_3) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|) (= (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12 (- 1)) 0)) |v_#memory_int_6|) (<= 1 .cse0) (= v_ULTIMATE.start_cstrcpy_~s2.base_3 |v_ULTIMATE.start_cstrcpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.offset_5 v_ULTIMATE.start_cstrcpy_~s2.offset_3) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrcpy_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrcpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_10| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrcpy_~s1.base_4 |v_ULTIMATE.start_cstrcpy_#in~s1.base_2|) (= v_ULTIMATE.start_cstrcpy_~s1.offset_4 |v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcpy_~dst~0.offset_5 v_ULTIMATE.start_cstrcpy_~s1.offset_4) (= v_ULTIMATE.start_cstrcpy_~s1.base_4 v_ULTIMATE.start_cstrcpy_~dst~0.base_5) (= v_ULTIMATE.start_cstrcpy_~s2.offset_3 |v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_5, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_7|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_7|, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_cstrcpy_~s1.offset=v_ULTIMATE.start_cstrcpy_~s1.offset_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12, ULTIMATE.start_cstrcpy_#in~s2.base=|v_ULTIMATE.start_cstrcpy_#in~s2.base_2|, ULTIMATE.start_cstrcpy_~s2.base=v_ULTIMATE.start_cstrcpy_~s2.base_3, ULTIMATE.start_cstrcpy_~s1.base=v_ULTIMATE.start_cstrcpy_~s1.base_4, ULTIMATE.start_cstrcpy_#in~s1.offset=|v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|, ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_5, ULTIMATE.start_cstrcpy_#res.base=|v_ULTIMATE.start_cstrcpy_#res.base_4|, ULTIMATE.start_cstrcpy_~s2.offset=v_ULTIMATE.start_cstrcpy_~s2.offset_3, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_5, ULTIMATE.start_cstrcpy_#in~s1.base=|v_ULTIMATE.start_cstrcpy_#in~s1.base_2|, ULTIMATE.start_cstrcpy_#res.offset=|v_ULTIMATE.start_cstrcpy_#res.offset_4|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_8|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrcpy_#in~s2.offset=|v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2, ULTIMATE.start_cstrcpy_#in~s2.base, ULTIMATE.start_cstrcpy_~s2.base, ULTIMATE.start_cstrcpy_~s1.base, ULTIMATE.start_cstrcpy_#in~s1.offset, ULTIMATE.start_cstrcpy_~src~0.offset, ULTIMATE.start_cstrcpy_#res.base, ULTIMATE.start_cstrcpy_~src~0.base, ULTIMATE.start_cstrcpy_~s2.offset, ULTIMATE.start_cstrcpy_#t~post1.offset, ULTIMATE.start_cstrcpy_~dst~0.base, ULTIMATE.start_cstrcpy_#in~s1.base, ULTIMATE.start_cstrcpy_#res.offset, ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, #memory_int, ULTIMATE.start_cstrcpy_~dst~0.offset, ULTIMATE.start_cstrcpy_~s1.offset, ULTIMATE.start_cstrcpy_#in~s2.offset] 4#L10-5true [2020-07-01 12:32:05,915 INFO L796 eck$LassoCheckResult]: Loop: 4#L10-5true [50] L10-5-->L10-1: Formula: (and (= v_ULTIMATE.start_cstrcpy_~dst~0.base_3 |v_ULTIMATE.start_cstrcpy_#t~post0.base_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.base_3 |v_ULTIMATE.start_cstrcpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrcpy_#t~post0.offset_2| v_ULTIMATE.start_cstrcpy_~dst~0.offset_4) (= v_ULTIMATE.start_cstrcpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrcpy_#t~post0.offset_2| 1)) (= |v_ULTIMATE.start_cstrcpy_#t~post1.base_2| v_ULTIMATE.start_cstrcpy_~src~0.base_4) (= |v_ULTIMATE.start_cstrcpy_#t~post0.base_2| v_ULTIMATE.start_cstrcpy_~dst~0.base_4) (= |v_ULTIMATE.start_cstrcpy_#t~post1.offset_2| v_ULTIMATE.start_cstrcpy_~src~0.offset_4) (= v_ULTIMATE.start_cstrcpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrcpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_4, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_4, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_4, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_2|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_2|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_2|, ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_3, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_3, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_3, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_2|, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, ULTIMATE.start_cstrcpy_~src~0.offset, ULTIMATE.start_cstrcpy_~dst~0.offset, ULTIMATE.start_cstrcpy_~src~0.base, ULTIMATE.start_cstrcpy_#t~post1.offset, ULTIMATE.start_cstrcpy_~dst~0.base] 13#L10-1true [65] L10-1-->L10-2: Formula: (and (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|)) (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|) (= 1 (select |v_#valid_8| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrcpy_#t~mem2_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_3|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_2|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2] 10#L10-2true [59] L10-2-->L10-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|)) (= 1 (select |v_#valid_10| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|) |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3| |v_ULTIMATE.start_cstrcpy_#t~mem2_3|)) |v_#memory_int_4|)) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 8#L10-3true [101] L10-3-->L10-5: Formula: (< 0 |v_ULTIMATE.start_cstrcpy_#t~mem2_7|) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_7|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_6|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_6|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_7|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_6|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2, ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, ULTIMATE.start_cstrcpy_#t~post1.offset] 4#L10-5true [2020-07-01 12:32:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:05,916 INFO L82 PathProgramCache]: Analyzing trace with hash 125674725, now seen corresponding path program 1 times [2020-07-01 12:32:05,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:05,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277687615] [2020-07-01 12:32:05,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:05,932 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277687615] [2020-07-01 12:32:05,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:05,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:32:05,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211533716] [2020-07-01 12:32:05,934 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:32:05,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:05,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2477466, now seen corresponding path program 1 times [2020-07-01 12:32:05,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:05,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219722268] [2020-07-01 12:32:05,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:32:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:32:05,961 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:32:06,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:06,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:32:06,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:06,050 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-07-01 12:32:06,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:06,079 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. [2020-07-01 12:32:06,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:32:06,081 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:32:06,085 INFO L168 Benchmark]: Toolchain (without parser) took 12785.95 ms. Allocated memory was 514.9 MB in the beginning and 667.4 MB in the end (delta: 152.6 MB). Free memory was 438.6 MB in the beginning and 560.7 MB in the end (delta: -122.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:06,086 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:32:06,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.42 ms. Allocated memory was 514.9 MB in the beginning and 557.3 MB in the end (delta: 42.5 MB). Free memory was 437.9 MB in the beginning and 523.8 MB in the end (delta: -85.9 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:06,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.13 ms. Allocated memory is still 557.3 MB. Free memory was 523.8 MB in the beginning and 521.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:06,087 INFO L168 Benchmark]: Boogie Preprocessor took 26.87 ms. Allocated memory is still 557.3 MB. Free memory was 521.8 MB in the beginning and 520.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:06,088 INFO L168 Benchmark]: RCFGBuilder took 312.35 ms. Allocated memory is still 557.3 MB. Free memory was 519.8 MB in the beginning and 500.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:06,088 INFO L168 Benchmark]: BlockEncodingV2 took 110.06 ms. Allocated memory is still 557.3 MB. Free memory was 500.8 MB in the beginning and 493.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:06,088 INFO L168 Benchmark]: TraceAbstraction took 11742.73 ms. Allocated memory was 557.3 MB in the beginning and 667.4 MB in the end (delta: 110.1 MB). Free memory was 492.7 MB in the beginning and 587.6 MB in the end (delta: -94.9 MB). Peak memory consumption was 174.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:06,089 INFO L168 Benchmark]: BuchiAutomizer took 221.95 ms. Allocated memory is still 667.4 MB. Free memory was 587.6 MB in the beginning and 560.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:06,092 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 22 locations, 26 edges - StatisticsResult: Encoded RCFG 15 locations, 27 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 323.42 ms. Allocated memory was 514.9 MB in the beginning and 557.3 MB in the end (delta: 42.5 MB). Free memory was 437.9 MB in the beginning and 523.8 MB in the end (delta: -85.9 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.13 ms. Allocated memory is still 557.3 MB. Free memory was 523.8 MB in the beginning and 521.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.87 ms. Allocated memory is still 557.3 MB. Free memory was 521.8 MB in the beginning and 520.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 312.35 ms. Allocated memory is still 557.3 MB. Free memory was 519.8 MB in the beginning and 500.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 110.06 ms. Allocated memory is still 557.3 MB. Free memory was 500.8 MB in the beginning and 493.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 11742.73 ms. Allocated memory was 557.3 MB in the beginning and 667.4 MB in the end (delta: 110.1 MB). Free memory was 492.7 MB in the beginning and 587.6 MB in the end (delta: -94.9 MB). Peak memory consumption was 174.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 221.95 ms. Allocated memory is still 667.4 MB. Free memory was 587.6 MB in the beginning and 560.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant [2020-07-01 12:32:06,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:06,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:06,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:06,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:06,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:06,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:06,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:06,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:06,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:06,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:06,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:06,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:06,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:06,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((1 <= unknown-#length-unknown[src] && 0 == unknown-#memory_int-unknown[src][src]) && 0 == dst) && 1 <= unknown-#StackHeapBarrier-unknown) && src == 0) && 1 == \valid[src]) && 1 <= length1) && 1 == \valid[nondetString]) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && 1 <= unknown-#length-unknown[nondetArea]) && 1 == length2 + nondetString) && 1 <= unknown-#length-unknown[dst]) && 1 == \valid[dst]) && 0 == nondetArea) && 0 == nondetString) && length2 == unknown-#length-unknown[nondetString]) || (((((((((((((((((!(nondetString == nondetArea) && 1 <= length2) && 0 == dst) && 1 <= unknown-#StackHeapBarrier-unknown) && src == 0) && 1 == \valid[src]) && !(src == dst)) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && 1 <= length1) && 1 == \valid[nondetString]) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && length2 <= unknown-#length-unknown[nondetArea]) && 0 == nondetArea) && unknown-#length-unknown[src] <= unknown-#length-unknown[dst]) && 0 == nondetString) && length2 == unknown-#length-unknown[nondetString])) || (((((((((((((((((!(nondetString == nondetArea) && 1 <= length2) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[src] + dst <= src + unknown-#length-unknown[dst]) && 1 == \valid[src]) && !(src == dst)) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && 1 <= length1) && 1 == \valid[nondetString]) && 1 <= src) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && 1 <= dst) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && length2 <= unknown-#length-unknown[nondetArea]) && 0 == nondetArea) && 0 == nondetString) && length2 == unknown-#length-unknown[nondetString]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.2s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 55 SDtfs, 392 SDslu, 323 SDs, 0 SdLazy, 758 SolverSat, 129 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 11 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 258 HoareAnnotationTreeSize, 1 FomulaSimplifications, 69 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 156 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 171 ConstructedInterpolants, 3 QuantifiedInterpolants, 13354 SizeOfPredicates, 52 NumberOfNonLiveVariables, 575 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 4/38 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:31:49.539 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_c7_mI6/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:32:06.342 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check