/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-267fbe0 [2020-07-18 00:47:57,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:57,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:57,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:57,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:57,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:57,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:57,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:57,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:57,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:57,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:57,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:57,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:57,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:57,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:57,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:57,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:57,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:57,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:57,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:57,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:57,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:57,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:57,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:57,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:57,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:57,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:57,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:57,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:57,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:57,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:57,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:57,828 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:57,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:57,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:57,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:57,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:57,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:57,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:57,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:57,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:57,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:57,842 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:57,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:57,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:57,844 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:57,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:57,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:57,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:57,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:57,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:57,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:57,845 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:57,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:57,846 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:57,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:57,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:57,846 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:57,846 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:57,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:57,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:57,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:57,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:57,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:57,847 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:58,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:58,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:58,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:58,139 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:58,139 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:58,140 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-18 00:47:58,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1cc1b79/883d9fd9feed469bbc96f5fb5d226599/FLAGc2ac9dc61 [2020-07-18 00:47:58,690 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:58,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i [2020-07-18 00:47:58,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1cc1b79/883d9fd9feed469bbc96f5fb5d226599/FLAGc2ac9dc61 [2020-07-18 00:47:59,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1cc1b79/883d9fd9feed469bbc96f5fb5d226599 [2020-07-18 00:47:59,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:59,125 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:59,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:59,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:59,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:59,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:59" (1/1) ... [2020-07-18 00:47:59,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713668be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:59, skipping insertion in model container [2020-07-18 00:47:59,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:59" (1/1) ... [2020-07-18 00:47:59,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:59,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:59,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:59,343 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:59,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:59,376 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:59,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:59 WrapperNode [2020-07-18 00:47:59,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:59,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:59,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:59,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:59,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:59" (1/1) ... [2020-07-18 00:47:59,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:59" (1/1) ... [2020-07-18 00:47:59,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:59" (1/1) ... [2020-07-18 00:47:59,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:59" (1/1) ... [2020-07-18 00:47:59,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:59" (1/1) ... [2020-07-18 00:47:59,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:59" (1/1) ... [2020-07-18 00:47:59,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:59" (1/1) ... [2020-07-18 00:47:59,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:59,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:59,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:59,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:59,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:59" (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-18 00:47:59,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:59,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:59,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:59,571 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:59,572 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:59,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:59,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:59,823 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:59,823 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:47:59,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:59 BoogieIcfgContainer [2020-07-18 00:47:59,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:59,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:59,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:59,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:59,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:59" (1/3) ... [2020-07-18 00:47:59,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17824546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:59, skipping insertion in model container [2020-07-18 00:47:59,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:59" (2/3) ... [2020-07-18 00:47:59,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17824546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:59, skipping insertion in model container [2020-07-18 00:47:59,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:59" (3/3) ... [2020-07-18 00:47:59,854 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-1.i [2020-07-18 00:47:59,864 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:59,875 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:59,893 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:59,914 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:59,915 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:59,915 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:59,915 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:59,915 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:59,916 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:59,916 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:59,916 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:59,930 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-18 00:47:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-18 00:47:59,941 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:59,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:59,942 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:59,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:59,949 INFO L82 PathProgramCache]: Analyzing trace with hash -649727231, now seen corresponding path program 1 times [2020-07-18 00:47:59,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:59,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1413270615] [2020-07-18 00:47:59,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:00,106 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-18 00:48:00,109 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27#true} {27#true} #42#return; {27#true} is VALID [2020-07-18 00:48:00,111 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2020-07-18 00:48:00,115 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-18 00:48:00,115 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #42#return; {27#true} is VALID [2020-07-18 00:48:00,116 INFO L263 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret1 := main(); {27#true} is VALID [2020-07-18 00:48:00,116 INFO L280 TraceCheckUtils]: 4: Hoare triple {27#true} havoc ~i~0; {27#true} is VALID [2020-07-18 00:48:00,116 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#true} ~sn~0 := 0; {27#true} is VALID [2020-07-18 00:48:00,117 INFO L280 TraceCheckUtils]: 6: Hoare triple {27#true} ~i~0 := 1; {27#true} is VALID [2020-07-18 00:48:00,122 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#true} assume !true; {28#false} is VALID [2020-07-18 00:48:00,122 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-18 00:48:00,123 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2020-07-18 00:48:00,123 INFO L280 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2020-07-18 00:48:00,123 INFO L280 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-18 00:48:00,125 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-18 00:48:00,131 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:00,135 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1413270615] [2020-07-18 00:48:00,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:00,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 00:48:00,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153652857] [2020-07-18 00:48:00,147 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-18 00:48:00,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:00,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 00:48:00,194 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-18 00:48:00,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 00:48:00,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:00,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 00:48:00,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:48:00,207 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-18 00:48:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:00,295 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-18 00:48:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 00:48:00,295 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-18 00:48:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:48:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2020-07-18 00:48:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:48:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2020-07-18 00:48:00,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 39 transitions. [2020-07-18 00:48:00,393 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-18 00:48:00,404 INFO L225 Difference]: With dead ends: 35 [2020-07-18 00:48:00,404 INFO L226 Difference]: Without dead ends: 18 [2020-07-18 00:48:00,408 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-18 00:48:00,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-18 00:48:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-18 00:48:00,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:00,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-18 00:48:00,454 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-18 00:48:00,455 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-18 00:48:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:00,458 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-18 00:48:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-18 00:48:00,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:00,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:00,460 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-18 00:48:00,460 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-18 00:48:00,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:00,464 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-18 00:48:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-18 00:48:00,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:00,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:00,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:00,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-18 00:48:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-18 00:48:00,470 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2020-07-18 00:48:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:00,471 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-18 00:48:00,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 00:48:00,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2020-07-18 00:48:00,501 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-18 00:48:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-18 00:48:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-18 00:48:00,503 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:00,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:00,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:48:00,504 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:00,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:00,504 INFO L82 PathProgramCache]: Analyzing trace with hash -662656525, now seen corresponding path program 1 times [2020-07-18 00:48:00,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:00,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [496327446] [2020-07-18 00:48:00,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:00,561 INFO L280 TraceCheckUtils]: 0: Hoare triple {175#true} assume true; {175#true} is VALID [2020-07-18 00:48:00,561 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {175#true} {175#true} #42#return; {175#true} is VALID [2020-07-18 00:48:00,562 INFO L263 TraceCheckUtils]: 0: Hoare triple {175#true} call ULTIMATE.init(); {175#true} is VALID [2020-07-18 00:48:00,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {175#true} assume true; {175#true} is VALID [2020-07-18 00:48:00,562 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {175#true} {175#true} #42#return; {175#true} is VALID [2020-07-18 00:48:00,563 INFO L263 TraceCheckUtils]: 3: Hoare triple {175#true} call #t~ret1 := main(); {175#true} is VALID [2020-07-18 00:48:00,563 INFO L280 TraceCheckUtils]: 4: Hoare triple {175#true} havoc ~i~0; {175#true} is VALID [2020-07-18 00:48:00,563 INFO L280 TraceCheckUtils]: 5: Hoare triple {175#true} ~sn~0 := 0; {175#true} is VALID [2020-07-18 00:48:00,564 INFO L280 TraceCheckUtils]: 6: Hoare triple {175#true} ~i~0 := 1; {179#(<= main_~i~0 1)} is VALID [2020-07-18 00:48:00,566 INFO L280 TraceCheckUtils]: 7: Hoare triple {179#(<= main_~i~0 1)} assume !(~i~0 <= 8); {176#false} is VALID [2020-07-18 00:48:00,566 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-18 00:48:00,566 INFO L280 TraceCheckUtils]: 9: Hoare triple {176#false} ~cond := #in~cond; {176#false} is VALID [2020-07-18 00:48:00,567 INFO L280 TraceCheckUtils]: 10: Hoare triple {176#false} assume 0 == ~cond; {176#false} is VALID [2020-07-18 00:48:00,567 INFO L280 TraceCheckUtils]: 11: Hoare triple {176#false} assume !false; {176#false} is VALID [2020-07-18 00:48:00,568 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-18 00:48:00,573 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:00,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [496327446] [2020-07-18 00:48:00,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:00,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:48:00,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430909721] [2020-07-18 00:48:00,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-18 00:48:00,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:00,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:48:00,591 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-18 00:48:00,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:48:00,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:00,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:48:00,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:48:00,593 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2020-07-18 00:48:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:00,675 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-18 00:48:00,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:48:00,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-18 00:48:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:48:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-18 00:48:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:48:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-18 00:48:00,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2020-07-18 00:48:00,735 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-18 00:48:00,737 INFO L225 Difference]: With dead ends: 34 [2020-07-18 00:48:00,737 INFO L226 Difference]: Without dead ends: 23 [2020-07-18 00:48:00,739 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:48:00,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-18 00:48:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2020-07-18 00:48:00,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:00,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 20 states. [2020-07-18 00:48:00,757 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 20 states. [2020-07-18 00:48:00,757 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 20 states. [2020-07-18 00:48:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:00,760 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-18 00:48:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-18 00:48:00,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:00,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:00,761 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 23 states. [2020-07-18 00:48:00,761 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 23 states. [2020-07-18 00:48:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:00,764 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-18 00:48:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-18 00:48:00,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:00,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:00,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:00,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:48:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-18 00:48:00,768 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2020-07-18 00:48:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:00,768 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-18 00:48:00,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:48:00,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2020-07-18 00:48:00,806 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-18 00:48:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-18 00:48:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 00:48:00,807 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:00,807 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-18 00:48:00,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:48:00,808 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1659803531, now seen corresponding path program 1 times [2020-07-18 00:48:00,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:00,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [564370780] [2020-07-18 00:48:00,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:03,184 INFO L280 TraceCheckUtils]: 0: Hoare triple {336#true} assume true; {336#true} is VALID [2020-07-18 00:48:03,184 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {336#true} {336#true} #42#return; {336#true} is VALID [2020-07-18 00:48:03,184 INFO L263 TraceCheckUtils]: 0: Hoare triple {336#true} call ULTIMATE.init(); {336#true} is VALID [2020-07-18 00:48:03,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {336#true} assume true; {336#true} is VALID [2020-07-18 00:48:03,185 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {336#true} {336#true} #42#return; {336#true} is VALID [2020-07-18 00:48:03,185 INFO L263 TraceCheckUtils]: 3: Hoare triple {336#true} call #t~ret1 := main(); {336#true} is VALID [2020-07-18 00:48:03,186 INFO L280 TraceCheckUtils]: 4: Hoare triple {336#true} havoc ~i~0; {336#true} is VALID [2020-07-18 00:48:03,186 INFO L280 TraceCheckUtils]: 5: Hoare triple {336#true} ~sn~0 := 0; {336#true} is VALID [2020-07-18 00:48:03,187 INFO L280 TraceCheckUtils]: 6: Hoare triple {336#true} ~i~0 := 1; {340#(<= main_~i~0 1)} is VALID [2020-07-18 00:48:03,189 INFO L280 TraceCheckUtils]: 7: Hoare triple {340#(<= main_~i~0 1)} [48] L13-6-->L13-7_primed: Formula: (or (let ((.cse0 (+ v_oct_main_~i~0_in_1 1)) (.cse1 (+ v_oct_main_~sn~0_in_1 2))) (and (<= .cse0 v_oct_main_~i~0_out_1) (<= (* 2 v_oct_main_~i~0_in_1) 6) (<= v_oct_main_~i~0_out_1 .cse0) (<= v_oct_main_~sn~0_out_1 .cse1) (<= .cse1 v_oct_main_~sn~0_out_1))) (let ((.cse2 (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)))) (and (<= 0 .cse2) (<= v_oct_main_~i~0_out_1 (+ v_oct_main_~i~0_in_1 .cse2 2)) (<= (+ .cse3 v_oct_main_~i~0_in_1 2) v_oct_main_~i~0_out_1) (<= (+ .cse3 v_oct_main_~i~0_in_1) 2)))) 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-18 00:48:03,190 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-18 00:48:03,191 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-18 00:48:03,191 INFO L280 TraceCheckUtils]: 10: Hoare triple {337#false} ~cond := #in~cond; {337#false} is VALID [2020-07-18 00:48:03,192 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#false} assume 0 == ~cond; {337#false} is VALID [2020-07-18 00:48:03,192 INFO L280 TraceCheckUtils]: 12: Hoare triple {337#false} assume !false; {337#false} is VALID [2020-07-18 00:48:03,193 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-18 00:48:03,252 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:03,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [564370780] [2020-07-18 00:48:03,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:03,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:48:03,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202837273] [2020-07-18 00:48:03,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-18 00:48:03,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:03,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:48:03,275 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-18 00:48:03,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:48:03,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:03,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:48:03,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:48:03,277 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2020-07-18 00:48:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:03,420 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-18 00:48:03,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:48:03,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-18 00:48:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-18 00:48:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:03,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-18 00:48:03,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2020-07-18 00:48:03,474 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-18 00:48:03,475 INFO L225 Difference]: With dead ends: 40 [2020-07-18 00:48:03,476 INFO L226 Difference]: Without dead ends: 29 [2020-07-18 00:48:03,476 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-18 00:48:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-18 00:48:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2020-07-18 00:48:03,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:03,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 26 states. [2020-07-18 00:48:03,497 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 26 states. [2020-07-18 00:48:03,498 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 26 states. [2020-07-18 00:48:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:03,500 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-18 00:48:03,500 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-18 00:48:03,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:03,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:03,501 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 29 states. [2020-07-18 00:48:03,502 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 29 states. [2020-07-18 00:48:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:03,504 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-18 00:48:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-18 00:48:03,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:03,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:03,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:03,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-18 00:48:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-07-18 00:48:03,507 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2020-07-18 00:48:03,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:03,508 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-07-18 00:48:03,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:48:03,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2020-07-18 00:48:03,537 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-18 00:48:03,538 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-18 00:48:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-18 00:48:03,538 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:03,539 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-18 00:48:03,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:48:03,539 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:03,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:03,540 INFO L82 PathProgramCache]: Analyzing trace with hash 891941667, now seen corresponding path program 2 times [2020-07-18 00:48:03,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:03,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1121503800] [2020-07-18 00:48:03,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:05,885 INFO L280 TraceCheckUtils]: 0: Hoare triple {537#true} assume true; {537#true} is VALID [2020-07-18 00:48:05,886 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {537#true} {537#true} #42#return; {537#true} is VALID [2020-07-18 00:48:05,886 INFO L263 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {537#true} is VALID [2020-07-18 00:48:05,886 INFO L280 TraceCheckUtils]: 1: Hoare triple {537#true} assume true; {537#true} is VALID [2020-07-18 00:48:05,887 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {537#true} {537#true} #42#return; {537#true} is VALID [2020-07-18 00:48:05,887 INFO L263 TraceCheckUtils]: 3: Hoare triple {537#true} call #t~ret1 := main(); {537#true} is VALID [2020-07-18 00:48:05,887 INFO L280 TraceCheckUtils]: 4: Hoare triple {537#true} havoc ~i~0; {537#true} is VALID [2020-07-18 00:48:05,888 INFO L280 TraceCheckUtils]: 5: Hoare triple {537#true} ~sn~0 := 0; {537#true} is VALID [2020-07-18 00:48:05,889 INFO L280 TraceCheckUtils]: 6: Hoare triple {537#true} ~i~0 := 1; {541#(<= main_~i~0 1)} is VALID [2020-07-18 00:48:05,891 INFO L280 TraceCheckUtils]: 7: Hoare triple {541#(<= main_~i~0 1)} [50] L13-6-->L13-7_primed: Formula: (or (let ((.cse0 (+ v_oct_main_~sn~0_in_2 2)) (.cse1 (+ 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) (<= (* 2 v_oct_main_~i~0_in_2) 6) (<= .cse1 v_oct_main_~i~0_out_2) (<= v_oct_main_~i~0_out_2 .cse1))) (let ((.cse2 (div (+ (* v_oct_main_~sn~0_in_2 (- 1)) v_oct_main_~sn~0_out_2 (- 4)) 2)) (.cse3 (div (+ v_oct_main_~sn~0_in_2 (* v_oct_main_~sn~0_out_2 (- 1)) 4) (- 2)))) (and (<= v_oct_main_~i~0_out_2 (+ .cse2 v_oct_main_~i~0_in_2 2)) (<= 0 .cse2) (<= (+ v_oct_main_~i~0_in_2 .cse3) 2) (<= (+ v_oct_main_~i~0_in_2 .cse3 2) 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-18 00:48:05,893 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-18 00:48:05,893 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-18 00:48:05,894 INFO L280 TraceCheckUtils]: 10: Hoare triple {538#false} ~cond := #in~cond; {538#false} is VALID [2020-07-18 00:48:05,894 INFO L280 TraceCheckUtils]: 11: Hoare triple {538#false} assume 0 == ~cond; {538#false} is VALID [2020-07-18 00:48:05,894 INFO L280 TraceCheckUtils]: 12: Hoare triple {538#false} assume !false; {538#false} is VALID [2020-07-18 00:48:05,895 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-18 00:48:06,018 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:06,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1121503800] [2020-07-18 00:48:06,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:06,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-18 00:48:06,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400886017] [2020-07-18 00:48:06,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-18 00:48:06,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:06,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 00:48:06,056 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-18 00:48:06,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 00:48:06,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:06,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 00:48:06,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:48:06,058 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2020-07-18 00:48:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:06,291 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-18 00:48:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 00:48:06,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-18 00:48:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:48:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2020-07-18 00:48:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:48:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2020-07-18 00:48:06,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2020-07-18 00:48:06,351 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-18 00:48:06,353 INFO L225 Difference]: With dead ends: 45 [2020-07-18 00:48:06,353 INFO L226 Difference]: Without dead ends: 34 [2020-07-18 00:48:06,354 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-18 00:48:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-18 00:48:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-18 00:48:06,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:06,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-18 00:48:06,384 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-18 00:48:06,385 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-18 00:48:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:06,387 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-18 00:48:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-18 00:48:06,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:06,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:06,388 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-18 00:48:06,388 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-18 00:48:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:06,391 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-18 00:48:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-18 00:48:06,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:06,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:06,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:06,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-18 00:48:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-18 00:48:06,395 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 24 [2020-07-18 00:48:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:06,396 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-18 00:48:06,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 00:48:06,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-18 00:48:06,427 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-18 00:48:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-18 00:48:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 00:48:06,429 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:06,429 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-18 00:48:06,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:48:06,429 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1860713659, now seen corresponding path program 3 times [2020-07-18 00:48:06,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:06,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2132947118] [2020-07-18 00:48:06,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:08,717 INFO L280 TraceCheckUtils]: 0: Hoare triple {773#true} assume true; {773#true} is VALID [2020-07-18 00:48:08,718 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {773#true} {773#true} #42#return; {773#true} is VALID [2020-07-18 00:48:08,718 INFO L263 TraceCheckUtils]: 0: Hoare triple {773#true} call ULTIMATE.init(); {773#true} is VALID [2020-07-18 00:48:08,718 INFO L280 TraceCheckUtils]: 1: Hoare triple {773#true} assume true; {773#true} is VALID [2020-07-18 00:48:08,719 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {773#true} {773#true} #42#return; {773#true} is VALID [2020-07-18 00:48:08,719 INFO L263 TraceCheckUtils]: 3: Hoare triple {773#true} call #t~ret1 := main(); {773#true} is VALID [2020-07-18 00:48:08,719 INFO L280 TraceCheckUtils]: 4: Hoare triple {773#true} havoc ~i~0; {773#true} is VALID [2020-07-18 00:48:08,719 INFO L280 TraceCheckUtils]: 5: Hoare triple {773#true} ~sn~0 := 0; {773#true} is VALID [2020-07-18 00:48:08,722 INFO L280 TraceCheckUtils]: 6: Hoare triple {773#true} ~i~0 := 1; {777#(<= main_~i~0 1)} is VALID [2020-07-18 00:48:08,724 INFO L280 TraceCheckUtils]: 7: Hoare triple {777#(<= main_~i~0 1)} [52] L13-6-->L13-7_primed: Formula: (or (let ((.cse0 (div (+ (* v_oct_main_~sn~0_in_3 (- 1)) v_oct_main_~sn~0_out_3 (- 4)) 2))) (and (<= (+ (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) v_oct_main_~i~0_out_3) (<= 0 .cse0) (<= v_oct_main_~i~0_out_3 4) (<= v_oct_main_~i~0_out_3 (+ v_oct_main_~i~0_in_3 .cse0 2)))) (let ((.cse1 (+ v_oct_main_~sn~0_in_3 2)) (.cse2 (+ v_oct_main_~i~0_in_3 1))) (and (<= .cse1 v_oct_main_~sn~0_out_3) (<= (* 2 v_oct_main_~i~0_in_3) 6) (<= v_oct_main_~sn~0_out_3 .cse1) (<= .cse2 v_oct_main_~i~0_out_3) (<= v_oct_main_~i~0_out_3 .cse2)))) 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-18 00:48:08,725 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-18 00:48:08,725 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-18 00:48:08,725 INFO L280 TraceCheckUtils]: 10: Hoare triple {774#false} ~cond := #in~cond; {774#false} is VALID [2020-07-18 00:48:08,725 INFO L280 TraceCheckUtils]: 11: Hoare triple {774#false} assume 0 == ~cond; {774#false} is VALID [2020-07-18 00:48:08,726 INFO L280 TraceCheckUtils]: 12: Hoare triple {774#false} assume !false; {774#false} is VALID [2020-07-18 00:48:08,726 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-18 00:48:08,931 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:08,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2132947118] [2020-07-18 00:48:08,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:08,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-18 00:48:08,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238243054] [2020-07-18 00:48:08,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-07-18 00:48:08,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:08,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 00:48:08,977 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-18 00:48:08,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 00:48:08,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:08,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 00:48:08,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:48:08,978 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 12 states. [2020-07-18 00:48:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:09,167 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-18 00:48:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 00:48:09,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-07-18 00:48:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:48:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2020-07-18 00:48:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:48:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2020-07-18 00:48:09,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2020-07-18 00:48:09,237 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-18 00:48:09,239 INFO L225 Difference]: With dead ends: 44 [2020-07-18 00:48:09,239 INFO L226 Difference]: Without dead ends: 39 [2020-07-18 00:48:09,239 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-18 00:48:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-18 00:48:09,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-07-18 00:48:09,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:09,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2020-07-18 00:48:09,268 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2020-07-18 00:48:09,268 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2020-07-18 00:48:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:09,270 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-18 00:48:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-18 00:48:09,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:09,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:09,271 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2020-07-18 00:48:09,271 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2020-07-18 00:48:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:09,273 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-18 00:48:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-18 00:48:09,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:09,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:09,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:09,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-18 00:48:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-07-18 00:48:09,276 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2020-07-18 00:48:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:09,276 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-07-18 00:48:09,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 00:48:09,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2020-07-18 00:48:09,323 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-18 00:48:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-18 00:48:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:48:09,324 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:09,325 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-18 00:48:09,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:48:09,325 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:09,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:09,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1338804338, now seen corresponding path program 1 times [2020-07-18 00:48:09,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:09,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [829314789] [2020-07-18 00:48:09,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:11,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:48:11,586 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:526) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:465) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) 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-18 00:48:11,592 INFO L168 Benchmark]: Toolchain (without parser) took 12468.58 ms. Allocated memory was 138.4 MB in the beginning and 246.9 MB in the end (delta: 108.5 MB). Free memory was 103.5 MB in the beginning and 112.7 MB in the end (delta: -9.2 MB). Peak memory consumption was 99.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:11,593 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:48:11,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.51 ms. Allocated memory is still 138.4 MB. Free memory was 103.1 MB in the beginning and 93.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:11,595 INFO L168 Benchmark]: Boogie Preprocessor took 125.77 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 93.6 MB in the beginning and 182.2 MB in the end (delta: -88.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:11,595 INFO L168 Benchmark]: RCFGBuilder took 323.82 ms. Allocated memory is still 202.9 MB. Free memory was 182.2 MB in the beginning and 167.4 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:11,596 INFO L168 Benchmark]: TraceAbstraction took 11745.74 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 166.7 MB in the beginning and 112.7 MB in the end (delta: 54.0 MB). Peak memory consumption was 98.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:11,601 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 251.51 ms. Allocated memory is still 138.4 MB. Free memory was 103.1 MB in the beginning and 93.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.77 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 93.6 MB in the beginning and 182.2 MB in the end (delta: -88.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 323.82 ms. Allocated memory is still 202.9 MB. Free memory was 182.2 MB in the beginning and 167.4 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11745.74 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 166.7 MB in the beginning and 112.7 MB in the end (delta: 54.0 MB). Peak memory consumption was 98.0 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...