/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:41:37,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:41:37,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:41:37,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:41:37,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:41:37,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:41:37,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:41:37,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:41:37,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:41:37,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:41:37,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:41:37,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:41:37,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:41:37,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:41:37,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:41:37,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:41:37,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:41:37,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:41:37,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:41:37,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:41:37,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:41:37,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:41:37,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:41:37,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:41:37,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:41:37,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:41:37,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:41:37,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:41:37,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:41:37,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:41:37,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:41:37,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:41:37,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:41:37,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:41:37,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:41:37,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:41:37,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:41:37,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:41:37,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:41:37,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:41:37,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:41:37,517 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:41:37,530 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:41:37,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:41:37,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:41:37,532 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:41:37,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:41:37,532 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:41:37,532 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:41:37,532 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:41:37,533 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:41:37,533 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:41:37,533 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:41:37,533 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:41:37,533 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:41:37,533 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:41:37,534 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:41:37,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:41:37,534 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:41:37,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:41:37,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:41:37,535 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:41:37,535 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:41:37,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:41:37,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:41:37,535 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:41:37,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:41:37,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:41:37,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:41:37,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:41:37,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:41:37,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:41:37,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:41:37,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:41:37,721 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:41:37,721 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:41:37,722 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:41:37,812 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_CkfIF4/tmp/99b7060db366462fac5009d752885836/FLAG077f3fa3a [2020-07-01 12:41:38,176 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:41:38,177 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:41:38,178 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:41:38,184 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_CkfIF4/tmp/99b7060db366462fac5009d752885836/FLAG077f3fa3a [2020-07-01 12:41:38,588 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_CkfIF4/tmp/99b7060db366462fac5009d752885836 [2020-07-01 12:41:38,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:41:38,601 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:41:38,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:41:38,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:41:38,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:41:38,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56117edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38, skipping insertion in model container [2020-07-01 12:41:38,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:41:38,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:41:38,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:41:38,866 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:41:38,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:41:38,896 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:41:38,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38 WrapperNode [2020-07-01 12:41:38,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:41:38,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:41:38,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:41:38,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:41:38,907 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:41:38" (1/1) ... [2020-07-01 12:41:38,915 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:41:38" (1/1) ... [2020-07-01 12:41:38,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:41:38,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:41:38,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:41:38,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:41:38,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:41:38,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:41:38,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:41:38,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:41:38,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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:41:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:41:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:41:39,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:41:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:41:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:41:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:41:39,281 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:41:39,282 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:41:39,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:41:39 BoogieIcfgContainer [2020-07-01 12:41:39,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:41:39,286 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:41:39,287 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:41:39,289 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:41:39,289 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:41:39" (1/1) ... [2020-07-01 12:41:39,303 INFO L313 BlockEncoder]: Initial Icfg 40 locations, 42 edges [2020-07-01 12:41:39,305 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:41:39,306 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:41:39,306 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:41:39,306 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:41:39,308 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:41:39,309 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:41:39,309 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:41:39,332 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:41:39,366 INFO L200 BlockEncoder]: SBE split 19 edges [2020-07-01 12:41:39,371 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:41:39,373 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:41:39,406 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:41:39,409 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:41:39,411 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:41:39,411 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:41:39,412 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:41:39,412 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:41:39,413 INFO L313 BlockEncoder]: Encoded RCFG 32 locations, 54 edges [2020-07-01 12:41:39,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:41:39 BasicIcfg [2020-07-01 12:41:39,413 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:41:39,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:41:39,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:41:39,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:41:39,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:41:38" (1/4) ... [2020-07-01 12:41:39,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522bced1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:41:39, skipping insertion in model container [2020-07-01 12:41:39,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (2/4) ... [2020-07-01 12:41:39,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522bced1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:41:39, skipping insertion in model container [2020-07-01 12:41:39,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:41:39" (3/4) ... [2020-07-01 12:41:39,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522bced1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:41:39, skipping insertion in model container [2020-07-01 12:41:39,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:41:39" (4/4) ... [2020-07-01 12:41:39,423 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:41:39,434 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:41:39,441 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-07-01 12:41:39,455 INFO L251 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-07-01 12:41:39,479 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:41:39,479 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:41:39,479 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:41:39,479 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:41:39,480 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:41:39,480 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:41:39,480 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:41:39,480 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:41:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-01 12:41:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:41:39,502 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:39,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:41:39,503 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:39,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:39,509 INFO L82 PathProgramCache]: Analyzing trace with hash 122944, now seen corresponding path program 1 times [2020-07-01 12:41:39,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:39,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91493433] [2020-07-01 12:41:39,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:39,670 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:41:39,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91493433] [2020-07-01 12:41:39,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:39,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:41:39,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655118445] [2020-07-01 12:41:39,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:41:39,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:39,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:39,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:39,695 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-07-01 12:41:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:39,808 INFO L93 Difference]: Finished difference Result 62 states and 103 transitions. [2020-07-01 12:41:39,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:39,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:41:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:39,822 INFO L225 Difference]: With dead ends: 62 [2020-07-01 12:41:39,822 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:41:39,825 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:41:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:41:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:41:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:41:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 51 transitions. [2020-07-01 12:41:39,863 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 51 transitions. Word has length 3 [2020-07-01 12:41:39,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:39,863 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 51 transitions. [2020-07-01 12:41:39,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:41:39,863 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 51 transitions. [2020-07-01 12:41:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:41:39,864 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:39,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:41:39,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:41:39,866 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:39,866 INFO L82 PathProgramCache]: Analyzing trace with hash 123006, now seen corresponding path program 1 times [2020-07-01 12:41:39,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:39,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376515754] [2020-07-01 12:41:39,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:39,915 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:41:39,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376515754] [2020-07-01 12:41:39,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:39,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:41:39,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745210886] [2020-07-01 12:41:39,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:41:39,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:39,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:39,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:39,919 INFO L87 Difference]: Start difference. First operand 32 states and 51 transitions. Second operand 3 states. [2020-07-01 12:41:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:40,015 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2020-07-01 12:41:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:40,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:41:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:40,017 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:41:40,017 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:41:40,018 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:41:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:41:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:41:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:41:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2020-07-01 12:41:40,023 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 41 transitions. Word has length 3 [2020-07-01 12:41:40,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:40,024 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-07-01 12:41:40,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:41:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2020-07-01 12:41:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:41:40,024 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:40,024 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:41:40,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:41:40,025 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:40,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:40,025 INFO L82 PathProgramCache]: Analyzing trace with hash 123008, now seen corresponding path program 1 times [2020-07-01 12:41:40,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:40,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982899693] [2020-07-01 12:41:40,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:40,059 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:41:40,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982899693] [2020-07-01 12:41:40,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:40,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:41:40,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182662187] [2020-07-01 12:41:40,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:41:40,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:40,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:40,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:40,061 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 3 states. [2020-07-01 12:41:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:40,123 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2020-07-01 12:41:40,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:40,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:41:40,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:40,125 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:41:40,125 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:41:40,125 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:41:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:41:40,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:41:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:41:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2020-07-01 12:41:40,130 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 3 [2020-07-01 12:41:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:40,130 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-07-01 12:41:40,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:41:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2020-07-01 12:41:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:41:40,131 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:40,131 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:41:40,131 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:41:40,131 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:40,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:40,131 INFO L82 PathProgramCache]: Analyzing trace with hash 3811423, now seen corresponding path program 1 times [2020-07-01 12:41:40,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:40,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836662407] [2020-07-01 12:41:40,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:40,166 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:41:40,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836662407] [2020-07-01 12:41:40,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:40,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:41:40,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658342439] [2020-07-01 12:41:40,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:41:40,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:40,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:40,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:40,169 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 3 states. [2020-07-01 12:41:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:40,213 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2020-07-01 12:41:40,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:40,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:41:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:40,215 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:41:40,215 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:41:40,215 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:41:40,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:41:40,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:41:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:41:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-07-01 12:41:40,219 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 4 [2020-07-01 12:41:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:40,221 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-01 12:41:40,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:41:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-07-01 12:41:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:41:40,221 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:40,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:41:40,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:41:40,222 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:40,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:40,222 INFO L82 PathProgramCache]: Analyzing trace with hash 3811424, now seen corresponding path program 1 times [2020-07-01 12:41:40,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:40,223 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219930428] [2020-07-01 12:41:40,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:40,258 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:41:40,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219930428] [2020-07-01 12:41:40,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:40,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:41:40,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696369460] [2020-07-01 12:41:40,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:41:40,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:40,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:40,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:40,261 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2020-07-01 12:41:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:40,302 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2020-07-01 12:41:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:40,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:41:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:40,303 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:41:40,304 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:41:40,304 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:41:40,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:41:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:41:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:41:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-07-01 12:41:40,307 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 4 [2020-07-01 12:41:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:40,308 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-07-01 12:41:40,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:41:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2020-07-01 12:41:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:41:40,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:40,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:41:40,309 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:41:40,309 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash 3811421, now seen corresponding path program 1 times [2020-07-01 12:41:40,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:40,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679301146] [2020-07-01 12:41:40,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:40,333 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:41:40,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679301146] [2020-07-01 12:41:40,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:40,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:41:40,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258844799] [2020-07-01 12:41:40,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:41:40,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:40,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:40,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:40,335 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 3 states. [2020-07-01 12:41:40,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:40,363 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-01 12:41:40,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:40,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:41:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:40,364 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:41:40,364 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:41:40,365 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:41:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:41:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:41:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:41:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:41:40,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-07-01 12:41:40,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:40,366 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:41:40,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:41:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:41:40,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:41:40,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:41:40,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:41:40,418 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:41:40,418 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 12:41:40,419 INFO L264 CegarLoopResult]: At program point L11-2(lines 9 13) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~c~0.base)) (<= 1 |#StackHeapBarrier|) (= 0 ULTIMATE.start_main_~c~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~c~0.base))) [2020-07-01 12:41:40,419 INFO L268 CegarLoopResult]: For program point L9(lines 9 13) no Hoare annotation was computed. [2020-07-01 12:41:40,419 INFO L268 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2020-07-01 12:41:40,419 INFO L264 CegarLoopResult]: At program point L9-2(lines 8 13) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~c~0.base)) (<= 1 |#StackHeapBarrier|) (= 0 ULTIMATE.start_main_~c~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~c~0.base))) [2020-07-01 12:41:40,420 INFO L268 CegarLoopResult]: For program point L7-1(line 7) no Hoare annotation was computed. [2020-07-01 12:41:40,420 INFO L268 CegarLoopResult]: For program point L9-3(lines 9 13) no Hoare annotation was computed. [2020-07-01 12:41:40,420 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:41:40,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:41:40,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:41:40,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:41:40,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:41:40,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:41:40,421 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:41:40,421 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:41:40,421 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:41:40,421 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:41:40,421 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:41:40,421 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:41:40,421 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:41:40,421 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:41:40,421 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:41:40,422 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:41:40,422 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:41:40,422 INFO L268 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-07-01 12:41:40,422 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:41:40,422 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:41:40,423 INFO L268 CegarLoopResult]: For program point L10-2(line 10) no Hoare annotation was computed. [2020-07-01 12:41:40,423 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:41:40,423 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:41:40,423 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:41:40,426 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:41:40,436 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,437 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,437 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:40,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:40,445 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,445 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,445 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:40,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:40,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:41:40 BasicIcfg [2020-07-01 12:41:40,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:41:40,450 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:41:40,450 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:41:40,453 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:41:40,454 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:40,454 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:41:38" (1/5) ... [2020-07-01 12:41:40,455 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ccd7648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:41:40, skipping insertion in model container [2020-07-01 12:41:40,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:40,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (2/5) ... [2020-07-01 12:41:40,456 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ccd7648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:41:40, skipping insertion in model container [2020-07-01 12:41:40,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:40,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:41:39" (3/5) ... [2020-07-01 12:41:40,456 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ccd7648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:41:40, skipping insertion in model container [2020-07-01 12:41:40,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:40,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:41:39" (4/5) ... [2020-07-01 12:41:40,457 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ccd7648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:41:40, skipping insertion in model container [2020-07-01 12:41:40,457 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:40,457 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:41:40" (5/5) ... [2020-07-01 12:41:40,458 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:41:40,482 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:41:40,482 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:41:40,482 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:41:40,482 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:41:40,482 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:41:40,482 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:41:40,483 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:41:40,483 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:41:40,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-07-01 12:41:40,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 12:41:40,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:41:40,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:41:40,499 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:41:40,499 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:40,500 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:41:40,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-07-01 12:41:40,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 12:41:40,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:41:40,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:41:40,503 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:41:40,503 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:40,508 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue [93] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 14#L-1true [121] L-1-->L7: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= v_ULTIMATE.start_main_~c~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~c~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_#length_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_1, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~c~0.base, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~c~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 7#L7true [61] L7-->L7-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~i~0.base_4)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~i~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 4#L7-1true [55] L7-1-->L9-2: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~c~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~c~0.base_4) v_ULTIMATE.start_main_~c~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~c~0.offset_4) (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~c~0.base_4)) (<= (+ v_ULTIMATE.start_main_~c~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~c~0.base_4))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 8#L9-2true [2020-07-01 12:41:40,510 INFO L796 eck$LassoCheckResult]: Loop: 8#L9-2true [64] L9-2-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11#L11-2true [66] L11-2-->L9: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 12#L9true [70] L9-->L10: Formula: (< |v_ULTIMATE.start_main_#t~mem2_6| 20) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 16#L10true [158] L10-->L10-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem3_5| (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~i~0.base_19) v_ULTIMATE.start_main_~i~0.offset_14)) (= 1 (select |v_#valid_27| v_ULTIMATE.start_main_~i~0.base_19)) (= |v_ULTIMATE.start_main_#t~post4_5| |v_ULTIMATE.start_main_#t~mem3_5|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_14 4) (select |v_#length_22| v_ULTIMATE.start_main_~i~0.base_19)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_14)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_14, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_19, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_14, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_19, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~mem3] 27#L10-2true [161] L10-2-->L11: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_15 4) (select |v_#length_25| v_ULTIMATE.start_main_~i~0.base_20)) (= 1 (select |v_#valid_32| v_ULTIMATE.start_main_~i~0.base_20)) (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_20 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_20) v_ULTIMATE.start_main_~i~0.offset_15 (+ |v_ULTIMATE.start_main_#t~post4_7| 1))) |v_#memory_int_17|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_15)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_15, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_20, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_15, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_20, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~mem3] 33#L11true [94] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_14| v_ULTIMATE.start_main_~i~0.base_16)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #length=|v_#length_14|, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 30#L11-1true [113] L11-1-->L12: Formula: (> |v_ULTIMATE.start_main_#t~mem5_6| 10) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 20#L12true [163] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_5| (select (select |v_#memory_int_20| v_ULTIMATE.start_main_~c~0.base_19) v_ULTIMATE.start_main_~c~0.offset_15)) (= |v_ULTIMATE.start_main_#t~post7_5| |v_ULTIMATE.start_main_#t~mem6_5|) (<= 0 v_ULTIMATE.start_main_~c~0.offset_15) (<= (+ v_ULTIMATE.start_main_~c~0.offset_15 4) (select |v_#length_27| v_ULTIMATE.start_main_~c~0.base_19)) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~c~0.base_19))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_19, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_15, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_20|, #length=|v_#length_27|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_19, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_15, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_20|, #length=|v_#length_27|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 17#L12-2true [164] L12-2-->L9-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_16 4) (select |v_#length_28| v_ULTIMATE.start_main_~c~0.base_20)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~c~0.base_20 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~c~0.base_20) v_ULTIMATE.start_main_~c~0.offset_16 (+ |v_ULTIMATE.start_main_#t~post7_7| 1))) |v_#memory_int_21|) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~c~0.base_20)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_16)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_20, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_22|, #length=|v_#length_28|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_7|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_20, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_21|, #length=|v_#length_28|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_6|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 8#L9-2true [2020-07-01 12:41:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:40,511 INFO L82 PathProgramCache]: Analyzing trace with hash 3812311, now seen corresponding path program 1 times [2020-07-01 12:41:40,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:40,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577554693] [2020-07-01 12:41:40,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:40,530 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:41:40,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577554693] [2020-07-01 12:41:40,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:40,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:41:40,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768979497] [2020-07-01 12:41:40,532 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:41:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:40,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1527638106, now seen corresponding path program 1 times [2020-07-01 12:41:40,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:40,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781895633] [2020-07-01 12:41:40,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:41:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:41:40,575 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:41:40,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:40,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:40,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:40,690 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-07-01 12:41:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:40,754 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2020-07-01 12:41:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:40,757 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:41:40,762 INFO L168 Benchmark]: Toolchain (without parser) took 2159.50 ms. Allocated memory was 649.6 MB in the beginning and 697.3 MB in the end (delta: 47.7 MB). Free memory was 561.7 MB in the beginning and 483.4 MB in the end (delta: 78.3 MB). Peak memory consumption was 126.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:40,762 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:41:40,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.88 ms. Allocated memory was 649.6 MB in the beginning and 697.3 MB in the end (delta: 47.7 MB). Free memory was 561.7 MB in the beginning and 660.3 MB in the end (delta: -98.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:40,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.85 ms. Allocated memory is still 697.3 MB. Free memory was 660.3 MB in the beginning and 659.0 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:41:40,764 INFO L168 Benchmark]: Boogie Preprocessor took 22.92 ms. Allocated memory is still 697.3 MB. Free memory was 659.0 MB in the beginning and 657.6 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:41:40,765 INFO L168 Benchmark]: RCFGBuilder took 326.84 ms. Allocated memory is still 697.3 MB. Free memory was 657.6 MB in the beginning and 633.9 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:40,765 INFO L168 Benchmark]: BlockEncodingV2 took 127.13 ms. Allocated memory is still 697.3 MB. Free memory was 633.9 MB in the beginning and 624.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:40,766 INFO L168 Benchmark]: TraceAbstraction took 1034.50 ms. Allocated memory is still 697.3 MB. Free memory was 624.5 MB in the beginning and 517.2 MB in the end (delta: 107.2 MB). Peak memory consumption was 107.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:40,767 INFO L168 Benchmark]: BuchiAutomizer took 309.56 ms. Allocated memory is still 697.3 MB. Free memory was 517.2 MB in the beginning and 483.4 MB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:40,770 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 40 locations, 42 edges - StatisticsResult: Encoded RCFG 32 locations, 54 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 294.88 ms. Allocated memory was 649.6 MB in the beginning and 697.3 MB in the end (delta: 47.7 MB). Free memory was 561.7 MB in the beginning and 660.3 MB in the end (delta: -98.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 37.85 ms. Allocated memory is still 697.3 MB. Free memory was 660.3 MB in the beginning and 659.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.92 ms. Allocated memory is still 697.3 MB. Free memory was 659.0 MB in the beginning and 657.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 326.84 ms. Allocated memory is still 697.3 MB. Free memory was 657.6 MB in the beginning and 633.9 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 127.13 ms. Allocated memory is still 697.3 MB. Free memory was 633.9 MB in the beginning and 624.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1034.50 ms. Allocated memory is still 697.3 MB. Free memory was 624.5 MB in the beginning and 517.2 MB in the end (delta: 107.2 MB). Peak memory consumption was 107.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 309.56 ms. Allocated memory is still 697.3 MB. Free memory was 517.2 MB in the beginning and 483.4 MB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 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 #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 #StackHeapBarrier - 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 #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: 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: 14]: 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: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: 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 18 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-07-01 12:41:40,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:40,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((1 == \valid[i] && 4 == unknown-#length-unknown[i]) && 0 == i) && 4 == unknown-#length-unknown[c]) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == c) && 1 == \valid[c] - InvariantResult [Line: 9]: Loop Invariant [2020-07-01 12:41:40,783 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,783 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,783 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:40,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:40,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((1 == \valid[i] && 4 == unknown-#length-unknown[i]) && 0 == i) && 4 == unknown-#length-unknown[c]) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == c) && 1 == \valid[c] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.8s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 37 SDtfs, 174 SDslu, 3 SDs, 0 SdLazy, 153 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 60 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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:41:35.283 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp/BenchExec_run_CkfIF4/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:41:41.011 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check