/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/sum04-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 17:37:18,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:37:18,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:37:18,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:37:18,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:37:18,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:37:18,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:37:18,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:37:18,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:37:18,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:37:18,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:37:18,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:37:18,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:37:18,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:37:18,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:37:18,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:37:18,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:37:18,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:37:18,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:37:18,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:37:18,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:37:18,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:37:18,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:37:18,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:37:18,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:37:18,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:37:18,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:37:18,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:37:18,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:37:18,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:37:18,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:37:18,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:37:18,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:37:18,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:37:18,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:37:18,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:37:18,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:37:18,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:37:18,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:37:18,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:37:18,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:37:18,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 17:37:18,487 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:37:18,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:37:18,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:37:18,490 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:37:18,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:37:18,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:37:18,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:37:18,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:37:18,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:37:18,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:37:18,493 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:37:18,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:37:18,493 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:37:18,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:37:18,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:37:18,494 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:37:18,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:37:18,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:37:18,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:37:18,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:37:18,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:37:18,496 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:37:18,496 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:37:18,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:37:18,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:37:18,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:37:18,804 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:37:18,805 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:37:18,806 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-1.i [2020-07-08 17:37:18,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de222963/428dd9e5d95d4100aad9e956fbe41f96/FLAG05fb8d0bc [2020-07-08 17:37:19,371 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:37:19,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i [2020-07-08 17:37:19,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de222963/428dd9e5d95d4100aad9e956fbe41f96/FLAG05fb8d0bc [2020-07-08 17:37:19,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de222963/428dd9e5d95d4100aad9e956fbe41f96 [2020-07-08 17:37:19,714 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:37:19,716 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:37:19,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:37:19,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:37:19,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:37:19,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:37:19" (1/1) ... [2020-07-08 17:37:19,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@196157c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:19, skipping insertion in model container [2020-07-08 17:37:19,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:37:19" (1/1) ... [2020-07-08 17:37:19,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:37:19,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:37:19,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:37:20,000 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:37:20,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:37:20,028 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:37:20,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:20 WrapperNode [2020-07-08 17:37:20,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:37:20,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:37:20,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:37:20,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:37:20,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:20" (1/1) ... [2020-07-08 17:37:20,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:20" (1/1) ... [2020-07-08 17:37:20,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:20" (1/1) ... [2020-07-08 17:37:20,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:20" (1/1) ... [2020-07-08 17:37:20,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:20" (1/1) ... [2020-07-08 17:37:20,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:20" (1/1) ... [2020-07-08 17:37:20,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:20" (1/1) ... [2020-07-08 17:37:20,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:37:20,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:37:20,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:37:20,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:37:20,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:37:20,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:37:20,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:37:20,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:37:20,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:37:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:37:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:37:20,213 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:37:20,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:37:20,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:37:20,445 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:37:20,446 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 17:37:20,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:37:20 BoogieIcfgContainer [2020-07-08 17:37:20,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:37:20,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:37:20,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:37:20,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:37:20,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:37:19" (1/3) ... [2020-07-08 17:37:20,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f84fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:37:20, skipping insertion in model container [2020-07-08 17:37:20,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:20" (2/3) ... [2020-07-08 17:37:20,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f84fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:37:20, skipping insertion in model container [2020-07-08 17:37:20,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:37:20" (3/3) ... [2020-07-08 17:37:20,461 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-1.i [2020-07-08 17:37:20,474 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:37:20,484 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:37:20,503 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:37:20,541 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:37:20,541 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:37:20,542 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:37:20,542 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:37:20,542 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:37:20,545 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:37:20,545 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:37:20,545 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:37:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-08 17:37:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-08 17:37:20,589 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:20,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:20,591 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash -649727231, now seen corresponding path program 1 times [2020-07-08 17:37:20,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:20,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347219809] [2020-07-08 17:37:20,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:20,756 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-08 17:37:20,757 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27#true} {27#true} #42#return; {27#true} is VALID [2020-07-08 17:37:20,760 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2020-07-08 17:37:20,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-08 17:37:20,761 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #42#return; {27#true} is VALID [2020-07-08 17:37:20,762 INFO L263 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret1 := main(); {27#true} is VALID [2020-07-08 17:37:20,762 INFO L280 TraceCheckUtils]: 4: Hoare triple {27#true} havoc ~i~0; {27#true} is VALID [2020-07-08 17:37:20,762 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#true} ~sn~0 := 0; {27#true} is VALID [2020-07-08 17:37:20,763 INFO L280 TraceCheckUtils]: 6: Hoare triple {27#true} ~i~0 := 1; {27#true} is VALID [2020-07-08 17:37:20,764 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#true} assume !true; {28#false} is VALID [2020-07-08 17:37:20,765 INFO L263 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {28#false} is VALID [2020-07-08 17:37:20,765 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2020-07-08 17:37:20,766 INFO L280 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2020-07-08 17:37:20,766 INFO L280 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-08 17:37:20,769 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-08 17:37:20,770 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:20,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347219809] [2020-07-08 17:37:20,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:20,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 17:37:20,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674582374] [2020-07-08 17:37:20,788 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-08 17:37:20,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:20,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 17:37:20,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:20,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 17:37:20,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:20,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 17:37:20,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 17:37:20,846 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-08 17:37:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:20,938 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-08 17:37:20,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 17:37:20,939 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-08 17:37:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 17:37:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2020-07-08 17:37:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 17:37:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2020-07-08 17:37:20,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 39 transitions. [2020-07-08 17:37:21,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:21,037 INFO L225 Difference]: With dead ends: 35 [2020-07-08 17:37:21,037 INFO L226 Difference]: Without dead ends: 18 [2020-07-08 17:37:21,041 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 17:37:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-08 17:37:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-08 17:37:21,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:21,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-08 17:37:21,098 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-08 17:37:21,099 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-08 17:37:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:21,103 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-08 17:37:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 17:37:21,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:21,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:21,104 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-08 17:37:21,104 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-08 17:37:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:21,109 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-08 17:37:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 17:37:21,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:21,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:21,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:21,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 17:37:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-08 17:37:21,115 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2020-07-08 17:37:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:21,115 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-08 17:37:21,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 17:37:21,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2020-07-08 17:37:21,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 17:37:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-08 17:37:21,150 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:21,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:21,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:37:21,151 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:21,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:21,152 INFO L82 PathProgramCache]: Analyzing trace with hash -662656525, now seen corresponding path program 1 times [2020-07-08 17:37:21,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:21,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2130518562] [2020-07-08 17:37:21,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:21,215 INFO L280 TraceCheckUtils]: 0: Hoare triple {175#true} assume true; {175#true} is VALID [2020-07-08 17:37:21,215 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {175#true} {175#true} #42#return; {175#true} is VALID [2020-07-08 17:37:21,216 INFO L263 TraceCheckUtils]: 0: Hoare triple {175#true} call ULTIMATE.init(); {175#true} is VALID [2020-07-08 17:37:21,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {175#true} assume true; {175#true} is VALID [2020-07-08 17:37:21,216 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {175#true} {175#true} #42#return; {175#true} is VALID [2020-07-08 17:37:21,217 INFO L263 TraceCheckUtils]: 3: Hoare triple {175#true} call #t~ret1 := main(); {175#true} is VALID [2020-07-08 17:37:21,217 INFO L280 TraceCheckUtils]: 4: Hoare triple {175#true} havoc ~i~0; {175#true} is VALID [2020-07-08 17:37:21,217 INFO L280 TraceCheckUtils]: 5: Hoare triple {175#true} ~sn~0 := 0; {175#true} is VALID [2020-07-08 17:37:21,219 INFO L280 TraceCheckUtils]: 6: Hoare triple {175#true} ~i~0 := 1; {179#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:21,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {179#(<= main_~i~0 1)} assume !(~i~0 <= 8); {176#false} is VALID [2020-07-08 17:37:21,220 INFO L263 TraceCheckUtils]: 8: Hoare triple {176#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {176#false} is VALID [2020-07-08 17:37:21,221 INFO L280 TraceCheckUtils]: 9: Hoare triple {176#false} ~cond := #in~cond; {176#false} is VALID [2020-07-08 17:37:21,221 INFO L280 TraceCheckUtils]: 10: Hoare triple {176#false} assume 0 == ~cond; {176#false} is VALID [2020-07-08 17:37:21,221 INFO L280 TraceCheckUtils]: 11: Hoare triple {176#false} assume !false; {176#false} is VALID [2020-07-08 17:37:21,222 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-08 17:37:21,222 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:21,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2130518562] [2020-07-08 17:37:21,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:21,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 17:37:21,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680365775] [2020-07-08 17:37:21,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-08 17:37:21,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:21,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 17:37:21,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:21,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 17:37:21,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:21,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 17:37:21,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 17:37:21,245 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2020-07-08 17:37:21,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:21,340 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-08 17:37:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 17:37:21,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-08 17:37:21,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:37:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-08 17:37:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:37:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-08 17:37:21,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2020-07-08 17:37:21,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:21,411 INFO L225 Difference]: With dead ends: 34 [2020-07-08 17:37:21,411 INFO L226 Difference]: Without dead ends: 23 [2020-07-08 17:37:21,413 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-08 17:37:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-08 17:37:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2020-07-08 17:37:21,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:21,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 20 states. [2020-07-08 17:37:21,431 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 20 states. [2020-07-08 17:37:21,432 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 20 states. [2020-07-08 17:37:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:21,435 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-08 17:37:21,435 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-08 17:37:21,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:21,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:21,436 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 23 states. [2020-07-08 17:37:21,436 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 23 states. [2020-07-08 17:37:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:21,439 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-08 17:37:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-08 17:37:21,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:21,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:21,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:21,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 17:37:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-08 17:37:21,444 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2020-07-08 17:37:21,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:21,445 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-08 17:37:21,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 17:37:21,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2020-07-08 17:37:21,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-08 17:37:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 17:37:21,494 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:21,494 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:21,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:37:21,495 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:21,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1659803531, now seen corresponding path program 1 times [2020-07-08 17:37:21,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:21,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1840958096] [2020-07-08 17:37:21,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 [2020-07-08 17:37:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:23,967 INFO L280 TraceCheckUtils]: 0: Hoare triple {336#true} assume true; {336#true} is VALID [2020-07-08 17:37:23,967 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {336#true} {336#true} #42#return; {336#true} is VALID [2020-07-08 17:37:23,968 INFO L263 TraceCheckUtils]: 0: Hoare triple {336#true} call ULTIMATE.init(); {336#true} is VALID [2020-07-08 17:37:23,968 INFO L280 TraceCheckUtils]: 1: Hoare triple {336#true} assume true; {336#true} is VALID [2020-07-08 17:37:23,968 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {336#true} {336#true} #42#return; {336#true} is VALID [2020-07-08 17:37:23,969 INFO L263 TraceCheckUtils]: 3: Hoare triple {336#true} call #t~ret1 := main(); {336#true} is VALID [2020-07-08 17:37:23,969 INFO L280 TraceCheckUtils]: 4: Hoare triple {336#true} havoc ~i~0; {336#true} is VALID [2020-07-08 17:37:23,969 INFO L280 TraceCheckUtils]: 5: Hoare triple {336#true} ~sn~0 := 0; {336#true} is VALID [2020-07-08 17:37:23,970 INFO L280 TraceCheckUtils]: 6: Hoare triple {336#true} ~i~0 := 1; {340#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:23,973 INFO L280 TraceCheckUtils]: 7: Hoare triple {340#(<= main_~i~0 1)} [48] L13-6-->L13-7_primed: Formula: (let ((.cse0 (div (+ (* v_oct_main_~sn~0_in_1 (- 1)) v_oct_main_~sn~0_out_1 (- 4)) 2)) (.cse3 (div (+ v_oct_main_~sn~0_in_1 (* v_oct_main_~sn~0_out_1 (- 1)) 4) (- 2)))) (let ((.cse2 (+ .cse3 v_oct_main_~i~0_in_1 2)) (.cse1 (+ v_oct_main_~i~0_in_1 .cse0 2))) (or (and (<= 0 .cse0) (<= v_oct_main_~i~0_out_1 .cse1) (<= .cse2 v_oct_main_~i~0_out_1) (<= (+ .cse3 v_oct_main_~i~0_in_1) 2)) (let ((.cse4 (+ v_oct_main_~i~0_in_1 1)) (.cse6 (+ v_oct_main_~sn~0_in_1 2)) (.cse5 (* 2 v_oct_main_~i~0_in_1))) (and (<= .cse4 v_oct_main_~i~0_out_1) (<= .cse5 6) (<= v_oct_main_~i~0_out_1 .cse4) (<= v_oct_main_~sn~0_out_1 .cse6) (or (< v_oct_main_~i~0_out_1 .cse2) (< .cse0 0) (< 4 v_oct_main_~i~0_out_1) (< .cse1 v_oct_main_~i~0_out_1)) (<= .cse6 v_oct_main_~sn~0_out_1) (<= .cse5 16)))))) InVars {main_~sn~0=v_oct_main_~sn~0_in_1, main_~i~0=v_oct_main_~i~0_in_1} OutVars{main_~i~0=v_oct_main_~i~0_out_1, main_#t~post0=|v_oct_main_#t~post0_out_1|, main_~sn~0=v_oct_main_~sn~0_out_1} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {341#(<= main_~i~0 4)} is VALID [2020-07-08 17:37:23,974 INFO L280 TraceCheckUtils]: 8: Hoare triple {341#(<= main_~i~0 4)} [47] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_3 8)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {337#false} is VALID [2020-07-08 17:37:23,975 INFO L263 TraceCheckUtils]: 9: Hoare triple {337#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {337#false} is VALID [2020-07-08 17:37:23,975 INFO L280 TraceCheckUtils]: 10: Hoare triple {337#false} ~cond := #in~cond; {337#false} is VALID [2020-07-08 17:37:23,975 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#false} assume 0 == ~cond; {337#false} is VALID [2020-07-08 17:37:23,976 INFO L280 TraceCheckUtils]: 12: Hoare triple {337#false} assume !false; {337#false} is VALID [2020-07-08 17:37:23,976 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-08 17:37:24,037 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:24,038 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1840958096] [2020-07-08 17:37:24,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:24,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 17:37:24,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895721701] [2020-07-08 17:37:24,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 17:37:24,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:24,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 17:37:24,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:24,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 17:37:24,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:24,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 17:37:24,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-07-08 17:37:24,063 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2020-07-08 17:37:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:24,219 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-08 17:37:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 17:37:24,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 17:37:24,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:37:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-08 17:37:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:37:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-08 17:37:24,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2020-07-08 17:37:24,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:24,289 INFO L225 Difference]: With dead ends: 40 [2020-07-08 17:37:24,289 INFO L226 Difference]: Without dead ends: 29 [2020-07-08 17:37:24,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-07-08 17:37:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-08 17:37:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2020-07-08 17:37:24,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:24,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 26 states. [2020-07-08 17:37:24,314 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 26 states. [2020-07-08 17:37:24,314 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 26 states. [2020-07-08 17:37:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:24,317 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-08 17:37:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-08 17:37:24,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:24,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:24,318 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 29 states. [2020-07-08 17:37:24,318 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 29 states. [2020-07-08 17:37:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:24,321 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-08 17:37:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-08 17:37:24,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:24,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:24,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:24,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-08 17:37:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-07-08 17:37:24,325 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2020-07-08 17:37:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:24,325 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-07-08 17:37:24,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 17:37:24,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2020-07-08 17:37:24,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-08 17:37:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 17:37:24,366 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:24,366 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:24,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:37:24,367 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:24,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:24,367 INFO L82 PathProgramCache]: Analyzing trace with hash 891941667, now seen corresponding path program 2 times [2020-07-08 17:37:24,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:24,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [862611849] [2020-07-08 17:37:24,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 19 to 37 [2020-07-08 17:37:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:26,752 INFO L280 TraceCheckUtils]: 0: Hoare triple {537#true} assume true; {537#true} is VALID [2020-07-08 17:37:26,752 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {537#true} {537#true} #42#return; {537#true} is VALID [2020-07-08 17:37:26,753 INFO L263 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {537#true} is VALID [2020-07-08 17:37:26,753 INFO L280 TraceCheckUtils]: 1: Hoare triple {537#true} assume true; {537#true} is VALID [2020-07-08 17:37:26,753 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {537#true} {537#true} #42#return; {537#true} is VALID [2020-07-08 17:37:26,754 INFO L263 TraceCheckUtils]: 3: Hoare triple {537#true} call #t~ret1 := main(); {537#true} is VALID [2020-07-08 17:37:26,754 INFO L280 TraceCheckUtils]: 4: Hoare triple {537#true} havoc ~i~0; {537#true} is VALID [2020-07-08 17:37:26,757 INFO L280 TraceCheckUtils]: 5: Hoare triple {537#true} ~sn~0 := 0; {537#true} is VALID [2020-07-08 17:37:26,764 INFO L280 TraceCheckUtils]: 6: Hoare triple {537#true} ~i~0 := 1; {541#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:26,768 INFO L280 TraceCheckUtils]: 7: Hoare triple {541#(<= main_~i~0 1)} [50] L13-6-->L13-7_primed: Formula: (let ((.cse6 (div (+ v_oct_main_~sn~0_in_2 (* v_oct_main_~sn~0_out_2 (- 1)) 4) (- 2))) (.cse4 (div (+ (* v_oct_main_~sn~0_in_2 (- 1)) v_oct_main_~sn~0_out_2 (- 4)) 2))) (let ((.cse3 (+ .cse4 v_oct_main_~i~0_in_2 2)) (.cse2 (+ v_oct_main_~i~0_in_2 .cse6 2))) (or (let ((.cse0 (+ v_oct_main_~sn~0_in_2 2)) (.cse1 (* 2 v_oct_main_~i~0_in_2)) (.cse5 (+ v_oct_main_~i~0_in_2 1))) (and (<= .cse0 v_oct_main_~sn~0_out_2) (<= v_oct_main_~sn~0_out_2 .cse0) (<= .cse1 6) (<= .cse1 16) (or (< v_oct_main_~i~0_out_2 .cse2) (< 4 v_oct_main_~i~0_out_2) (< .cse3 v_oct_main_~i~0_out_2) (< .cse4 0)) (<= .cse5 v_oct_main_~i~0_out_2) (<= v_oct_main_~i~0_out_2 .cse5))) (and (<= v_oct_main_~i~0_out_2 .cse3) (<= 0 .cse4) (<= (+ v_oct_main_~i~0_in_2 .cse6) 2) (<= .cse2 v_oct_main_~i~0_out_2))))) InVars {main_~sn~0=v_oct_main_~sn~0_in_2, main_~i~0=v_oct_main_~i~0_in_2} OutVars{main_~i~0=v_oct_main_~i~0_out_2, main_#t~post0=|v_oct_main_#t~post0_out_2|, main_~sn~0=v_oct_main_~sn~0_out_2} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {542#(<= main_~i~0 4)} is VALID [2020-07-08 17:37:26,771 INFO L280 TraceCheckUtils]: 8: Hoare triple {542#(<= main_~i~0 4)} [49] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_3 8)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {538#false} is VALID [2020-07-08 17:37:26,771 INFO L263 TraceCheckUtils]: 9: Hoare triple {538#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {538#false} is VALID [2020-07-08 17:37:26,771 INFO L280 TraceCheckUtils]: 10: Hoare triple {538#false} ~cond := #in~cond; {538#false} is VALID [2020-07-08 17:37:26,772 INFO L280 TraceCheckUtils]: 11: Hoare triple {538#false} assume 0 == ~cond; {538#false} is VALID [2020-07-08 17:37:26,772 INFO L280 TraceCheckUtils]: 12: Hoare triple {538#false} assume !false; {538#false} is VALID [2020-07-08 17:37:26,772 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-08 17:37:26,921 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:26,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [862611849] [2020-07-08 17:37:26,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:26,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 17:37:26,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027207736] [2020-07-08 17:37:26,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-08 17:37:26,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:26,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 17:37:26,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:26,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 17:37:26,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:26,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 17:37:26,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-07-08 17:37:26,959 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2020-07-08 17:37:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:27,153 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-08 17:37:27,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 17:37:27,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-08 17:37:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:37:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2020-07-08 17:37:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:37:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2020-07-08 17:37:27,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2020-07-08 17:37:27,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:27,257 INFO L225 Difference]: With dead ends: 45 [2020-07-08 17:37:27,257 INFO L226 Difference]: Without dead ends: 34 [2020-07-08 17:37:27,259 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-07-08 17:37:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-08 17:37:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-08 17:37:27,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:27,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-08 17:37:27,300 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-08 17:37:27,300 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-08 17:37:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:27,302 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-08 17:37:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-08 17:37:27,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:27,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:27,303 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-08 17:37:27,304 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-08 17:37:27,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:27,306 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-08 17:37:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-08 17:37:27,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:27,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:27,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:27,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 17:37:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-08 17:37:27,309 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 24 [2020-07-08 17:37:27,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:27,309 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-08 17:37:27,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 17:37:27,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-08 17:37:27,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-08 17:37:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 17:37:27,344 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:27,345 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:27,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 17:37:27,345 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:27,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:27,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1860713659, now seen corresponding path program 3 times [2020-07-08 17:37:27,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:27,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2133660847] [2020-07-08 17:37:27,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 [2020-07-08 17:37:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:29,653 INFO L280 TraceCheckUtils]: 0: Hoare triple {773#true} assume true; {773#true} is VALID [2020-07-08 17:37:29,654 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {773#true} {773#true} #42#return; {773#true} is VALID [2020-07-08 17:37:29,654 INFO L263 TraceCheckUtils]: 0: Hoare triple {773#true} call ULTIMATE.init(); {773#true} is VALID [2020-07-08 17:37:29,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {773#true} assume true; {773#true} is VALID [2020-07-08 17:37:29,655 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {773#true} {773#true} #42#return; {773#true} is VALID [2020-07-08 17:37:29,655 INFO L263 TraceCheckUtils]: 3: Hoare triple {773#true} call #t~ret1 := main(); {773#true} is VALID [2020-07-08 17:37:29,655 INFO L280 TraceCheckUtils]: 4: Hoare triple {773#true} havoc ~i~0; {773#true} is VALID [2020-07-08 17:37:29,656 INFO L280 TraceCheckUtils]: 5: Hoare triple {773#true} ~sn~0 := 0; {773#true} is VALID [2020-07-08 17:37:29,658 INFO L280 TraceCheckUtils]: 6: Hoare triple {773#true} ~i~0 := 1; {777#(<= main_~i~0 1)} is VALID [2020-07-08 17:37:29,660 INFO L280 TraceCheckUtils]: 7: Hoare triple {777#(<= main_~i~0 1)} [52] L13-6-->L13-7_primed: Formula: (let ((.cse0 (+ (div (+ (* v_oct_main_~sn~0_out_3 (- 1)) v_oct_main_~sn~0_in_3 4) (- 2)) v_oct_main_~i~0_in_3 2)) (.cse1 (div (+ (* v_oct_main_~sn~0_in_3 (- 1)) v_oct_main_~sn~0_out_3 (- 4)) 2))) (or (and (<= .cse0 v_oct_main_~i~0_out_3) (<= 0 .cse1) (<= v_oct_main_~i~0_out_3 4) (<= v_oct_main_~i~0_out_3 (+ v_oct_main_~i~0_in_3 .cse1 2))) (let ((.cse3 (* 2 v_oct_main_~i~0_in_3)) (.cse2 (+ v_oct_main_~sn~0_in_3 2)) (.cse4 (+ v_oct_main_~i~0_in_3 1))) (and (<= .cse2 v_oct_main_~sn~0_out_3) (<= .cse3 16) (or (< .cse1 0) (< 4 v_oct_main_~i~0_out_3) (< v_oct_main_~i~0_out_3 .cse0) (< (+ .cse1 v_oct_main_~i~0_in_3 2) v_oct_main_~i~0_out_3)) (<= .cse3 6) (<= .cse4 v_oct_main_~i~0_out_3) (<= v_oct_main_~sn~0_out_3 .cse2) (<= v_oct_main_~i~0_out_3 .cse4))))) InVars {main_~sn~0=v_oct_main_~sn~0_in_3, main_~i~0=v_oct_main_~i~0_in_3} OutVars{main_~i~0=v_oct_main_~i~0_out_3, main_#t~post0=|v_oct_main_#t~post0_out_3|, main_~sn~0=v_oct_main_~sn~0_out_3} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {778#(<= main_~i~0 4)} is VALID [2020-07-08 17:37:29,661 INFO L280 TraceCheckUtils]: 8: Hoare triple {778#(<= main_~i~0 4)} [51] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_3 8)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {774#false} is VALID [2020-07-08 17:37:29,661 INFO L263 TraceCheckUtils]: 9: Hoare triple {774#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {774#false} is VALID [2020-07-08 17:37:29,662 INFO L280 TraceCheckUtils]: 10: Hoare triple {774#false} ~cond := #in~cond; {774#false} is VALID [2020-07-08 17:37:29,662 INFO L280 TraceCheckUtils]: 11: Hoare triple {774#false} assume 0 == ~cond; {774#false} is VALID [2020-07-08 17:37:29,662 INFO L280 TraceCheckUtils]: 12: Hoare triple {774#false} assume !false; {774#false} is VALID [2020-07-08 17:37:29,663 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-08 17:37:29,849 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:29,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2133660847] [2020-07-08 17:37:29,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:29,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-08 17:37:29,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187374214] [2020-07-08 17:37:29,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-07-08 17:37:29,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:29,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 17:37:29,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:29,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 17:37:29,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:29,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 17:37:29,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-07-08 17:37:29,893 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 12 states. [2020-07-08 17:37:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:30,080 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-08 17:37:30,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 17:37:30,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-07-08 17:37:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 17:37:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2020-07-08 17:37:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 17:37:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2020-07-08 17:37:30,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2020-07-08 17:37:30,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:30,139 INFO L225 Difference]: With dead ends: 44 [2020-07-08 17:37:30,139 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 17:37:30,140 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-07-08 17:37:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 17:37:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-07-08 17:37:30,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:30,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2020-07-08 17:37:30,173 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2020-07-08 17:37:30,173 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2020-07-08 17:37:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:30,175 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-08 17:37:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-08 17:37:30,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:30,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:30,176 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2020-07-08 17:37:30,176 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2020-07-08 17:37:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:30,178 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-08 17:37:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-08 17:37:30,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:30,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:30,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:30,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 17:37:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-07-08 17:37:30,181 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2020-07-08 17:37:30,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:30,182 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-07-08 17:37:30,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 17:37:30,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2020-07-08 17:37:30,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:30,229 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-08 17:37:30,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 17:37:30,230 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:30,230 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:30,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 17:37:30,231 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:30,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:30,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1338804338, now seen corresponding path program 1 times [2020-07-08 17:37:30,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:30,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1504881798] [2020-07-08 17:37:30,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #3: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 [2020-07-08 17:37:32,537 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 17:37:32,538 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: must have same length at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.pairwiseEquality(SmtUtils.java:418) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.constructEpsilon(AcceleratedInterpolation.java:510) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:449) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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-08 17:37:32,544 INFO L168 Benchmark]: Toolchain (without parser) took 12827.47 ms. Allocated memory was 137.4 MB in the beginning and 249.0 MB in the end (delta: 111.7 MB). Free memory was 102.2 MB in the beginning and 97.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 116.4 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:32,545 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.4 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-08 17:37:32,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.73 ms. Allocated memory is still 137.4 MB. Free memory was 101.9 MB in the beginning and 92.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:32,547 INFO L168 Benchmark]: Boogie Preprocessor took 109.65 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 92.5 MB in the beginning and 181.5 MB in the end (delta: -89.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:32,548 INFO L168 Benchmark]: RCFGBuilder took 312.45 ms. Allocated memory is still 201.3 MB. Free memory was 181.5 MB in the beginning and 165.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:32,549 INFO L168 Benchmark]: TraceAbstraction took 12087.51 ms. Allocated memory was 201.3 MB in the beginning and 249.0 MB in the end (delta: 47.7 MB). Free memory was 165.3 MB in the beginning and 97.5 MB in the end (delta: 67.8 MB). Peak memory consumption was 115.5 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:32,553 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 137.4 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 311.73 ms. Allocated memory is still 137.4 MB. Free memory was 101.9 MB in the beginning and 92.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.65 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 92.5 MB in the beginning and 181.5 MB in the end (delta: -89.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 312.45 ms. Allocated memory is still 201.3 MB. Free memory was 181.5 MB in the beginning and 165.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12087.51 ms. Allocated memory was 201.3 MB in the beginning and 249.0 MB in the end (delta: 47.7 MB). Free memory was 165.3 MB in the beginning and 97.5 MB in the end (delta: 67.8 MB). Peak memory consumption was 115.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: must have same length de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: must have same length: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.pairwiseEquality(SmtUtils.java:418) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...