/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/recursive/MultCommutative-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:14:04,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:14:04,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:14:04,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:14:04,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:14:04,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:14:04,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:14:04,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:14:04,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:14:04,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:14:04,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:14:04,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:14:04,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:14:04,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:14:04,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:14:04,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:14:04,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:14:04,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:14:04,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:14:04,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:14:04,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:14:04,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:14:04,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:14:04,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:14:04,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:14:04,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:14:04,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:14:04,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:14:04,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:14:04,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:14:04,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:14:04,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:14:04,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:14:04,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:14:04,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:14:04,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:14:04,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:14:04,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:14:04,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:14:04,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:14:04,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:14:04,571 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:14:04,586 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:14:04,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:14:04,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:14:04,589 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:14:04,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:14:04,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:14:04,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:14:04,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:14:04,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:14:04,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:14:04,592 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:14:04,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:14:04,592 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:14:04,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:14:04,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:14:04,593 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:14:04,593 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:14:04,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:14:04,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:14:04,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:14:04,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:14:04,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:14:04,594 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:14:04,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:14:04,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:14:04,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:14:04,869 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:14:04,870 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:14:04,871 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/MultCommutative-2.c [2020-07-18 00:14:04,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21cf1cf72/b5072c4834cd4e5db49d1bdbc26042b2/FLAG94d9935bd [2020-07-18 00:14:05,452 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:14:05,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/MultCommutative-2.c [2020-07-18 00:14:05,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21cf1cf72/b5072c4834cd4e5db49d1bdbc26042b2/FLAG94d9935bd [2020-07-18 00:14:05,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21cf1cf72/b5072c4834cd4e5db49d1bdbc26042b2 [2020-07-18 00:14:05,871 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:14:05,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:14:05,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:05,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:14:05,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:14:05,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:05" (1/1) ... [2020-07-18 00:14:05,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@782b79c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:05, skipping insertion in model container [2020-07-18 00:14:05,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:05" (1/1) ... [2020-07-18 00:14:05,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:14:05,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:14:06,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:06,124 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:14:06,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:06,162 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:14:06,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:06 WrapperNode [2020-07-18 00:14:06,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:06,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:14:06,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:14:06,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:14:06,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:06" (1/1) ... [2020-07-18 00:14:06,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:06" (1/1) ... [2020-07-18 00:14:06,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:06" (1/1) ... [2020-07-18 00:14:06,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:06" (1/1) ... [2020-07-18 00:14:06,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:06" (1/1) ... [2020-07-18 00:14:06,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:06" (1/1) ... [2020-07-18 00:14:06,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:06" (1/1) ... [2020-07-18 00:14:06,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:14:06,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:14:06,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:14:06,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:14:06,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:06" (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:14:06,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:14:06,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:14:06,355 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2020-07-18 00:14:06,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:14:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:14:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:14:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2020-07-18 00:14:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:14:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:14:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:14:06,742 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:14:06,742 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 00:14:06,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:06 BoogieIcfgContainer [2020-07-18 00:14:06,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:14:06,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:14:06,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:14:06,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:14:06,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:14:05" (1/3) ... [2020-07-18 00:14:06,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebf1c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:06, skipping insertion in model container [2020-07-18 00:14:06,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:06" (2/3) ... [2020-07-18 00:14:06,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebf1c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:06, skipping insertion in model container [2020-07-18 00:14:06,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:06" (3/3) ... [2020-07-18 00:14:06,755 INFO L109 eAbstractionObserver]: Analyzing ICFG MultCommutative-2.c [2020-07-18 00:14:06,771 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:14:06,781 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:14:06,794 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:14:06,814 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:14:06,815 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:14:06,815 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:14:06,815 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:14:06,815 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:14:06,815 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:14:06,815 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:14:06,815 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:14:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-18 00:14:06,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-18 00:14:06,843 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:06,844 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:06,844 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:06,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:06,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2060884630, now seen corresponding path program 1 times [2020-07-18 00:14:06,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:06,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [93462484] [2020-07-18 00:14:06,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:07,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-18 00:14:07,080 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {48#true} {48#true} #63#return; {48#true} is VALID [2020-07-18 00:14:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:07,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} ~n := #in~n; {48#true} is VALID [2020-07-18 00:14:07,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} ~m := #in~m; {67#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:07,155 INFO L280 TraceCheckUtils]: 2: Hoare triple {67#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {67#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:07,156 INFO L280 TraceCheckUtils]: 3: Hoare triple {67#(= |mult_#in~m| mult_~m)} assume 0 == ~m; {68#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:07,157 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#(<= |mult_#in~m| 0)} #res := 0; {68#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:07,159 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#(<= |mult_#in~m| 0)} assume true; {68#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:07,161 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {68#(<= |mult_#in~m| 0)} {48#true} #67#return; {59#(<= main_~n~0 0)} is VALID [2020-07-18 00:14:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:07,175 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} ~n := #in~n; {48#true} is VALID [2020-07-18 00:14:07,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} ~m := #in~m; {48#true} is VALID [2020-07-18 00:14:07,176 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} assume !(~m < 0); {48#true} is VALID [2020-07-18 00:14:07,177 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} assume 0 == ~m; {48#true} is VALID [2020-07-18 00:14:07,177 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} #res := 0; {48#true} is VALID [2020-07-18 00:14:07,177 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-18 00:14:07,180 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {48#true} {59#(<= main_~n~0 0)} #69#return; {59#(<= main_~n~0 0)} is VALID [2020-07-18 00:14:07,180 INFO L263 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2020-07-18 00:14:07,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-18 00:14:07,181 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #63#return; {48#true} is VALID [2020-07-18 00:14:07,182 INFO L263 TraceCheckUtils]: 3: Hoare triple {48#true} call #t~ret6 := main(); {48#true} is VALID [2020-07-18 00:14:07,182 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {48#true} is VALID [2020-07-18 00:14:07,183 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#true} ~m~0 := #t~nondet2; {48#true} is VALID [2020-07-18 00:14:07,183 INFO L280 TraceCheckUtils]: 6: Hoare triple {48#true} havoc #t~nondet2; {48#true} is VALID [2020-07-18 00:14:07,183 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#true} assume !(~m~0 < 0 || ~m~0 > 46340); {48#true} is VALID [2020-07-18 00:14:07,184 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {48#true} is VALID [2020-07-18 00:14:07,184 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#true} ~n~0 := #t~nondet3; {48#true} is VALID [2020-07-18 00:14:07,185 INFO L280 TraceCheckUtils]: 10: Hoare triple {48#true} havoc #t~nondet3; {48#true} is VALID [2020-07-18 00:14:07,185 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#true} assume !(~n~0 < 0 || ~n~0 > 46340); {48#true} is VALID [2020-07-18 00:14:07,186 INFO L263 TraceCheckUtils]: 12: Hoare triple {48#true} call #t~ret4 := mult(~m~0, ~n~0); {48#true} is VALID [2020-07-18 00:14:07,186 INFO L280 TraceCheckUtils]: 13: Hoare triple {48#true} ~n := #in~n; {48#true} is VALID [2020-07-18 00:14:07,187 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#true} ~m := #in~m; {67#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:07,188 INFO L280 TraceCheckUtils]: 15: Hoare triple {67#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {67#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:07,189 INFO L280 TraceCheckUtils]: 16: Hoare triple {67#(= |mult_#in~m| mult_~m)} assume 0 == ~m; {68#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:07,190 INFO L280 TraceCheckUtils]: 17: Hoare triple {68#(<= |mult_#in~m| 0)} #res := 0; {68#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:07,191 INFO L280 TraceCheckUtils]: 18: Hoare triple {68#(<= |mult_#in~m| 0)} assume true; {68#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:07,193 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {68#(<= |mult_#in~m| 0)} {48#true} #67#return; {59#(<= main_~n~0 0)} is VALID [2020-07-18 00:14:07,194 INFO L280 TraceCheckUtils]: 20: Hoare triple {59#(<= main_~n~0 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {59#(<= main_~n~0 0)} is VALID [2020-07-18 00:14:07,196 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#(<= main_~n~0 0)} ~res1~0 := #t~ret4; {59#(<= main_~n~0 0)} is VALID [2020-07-18 00:14:07,197 INFO L280 TraceCheckUtils]: 22: Hoare triple {59#(<= main_~n~0 0)} havoc #t~ret4; {59#(<= main_~n~0 0)} is VALID [2020-07-18 00:14:07,197 INFO L263 TraceCheckUtils]: 23: Hoare triple {59#(<= main_~n~0 0)} call #t~ret5 := mult(~n~0, ~m~0); {48#true} is VALID [2020-07-18 00:14:07,197 INFO L280 TraceCheckUtils]: 24: Hoare triple {48#true} ~n := #in~n; {48#true} is VALID [2020-07-18 00:14:07,198 INFO L280 TraceCheckUtils]: 25: Hoare triple {48#true} ~m := #in~m; {48#true} is VALID [2020-07-18 00:14:07,198 INFO L280 TraceCheckUtils]: 26: Hoare triple {48#true} assume !(~m < 0); {48#true} is VALID [2020-07-18 00:14:07,199 INFO L280 TraceCheckUtils]: 27: Hoare triple {48#true} assume 0 == ~m; {48#true} is VALID [2020-07-18 00:14:07,199 INFO L280 TraceCheckUtils]: 28: Hoare triple {48#true} #res := 0; {48#true} is VALID [2020-07-18 00:14:07,199 INFO L280 TraceCheckUtils]: 29: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-18 00:14:07,201 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {48#true} {59#(<= main_~n~0 0)} #69#return; {59#(<= main_~n~0 0)} is VALID [2020-07-18 00:14:07,202 INFO L280 TraceCheckUtils]: 31: Hoare triple {59#(<= main_~n~0 0)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {59#(<= main_~n~0 0)} is VALID [2020-07-18 00:14:07,203 INFO L280 TraceCheckUtils]: 32: Hoare triple {59#(<= main_~n~0 0)} ~res2~0 := #t~ret5; {59#(<= main_~n~0 0)} is VALID [2020-07-18 00:14:07,204 INFO L280 TraceCheckUtils]: 33: Hoare triple {59#(<= main_~n~0 0)} havoc #t~ret5; {59#(<= main_~n~0 0)} is VALID [2020-07-18 00:14:07,205 INFO L280 TraceCheckUtils]: 34: Hoare triple {59#(<= main_~n~0 0)} assume (~res1~0 != ~res2~0 && ~m~0 > 0) && ~n~0 > 0; {49#false} is VALID [2020-07-18 00:14:07,206 INFO L280 TraceCheckUtils]: 35: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-18 00:14:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 00:14:07,221 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:07,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [93462484] [2020-07-18 00:14:07,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:07,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:14:07,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994672273] [2020-07-18 00:14:07,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-07-18 00:14:07,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:07,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:14:07,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:07,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:14:07,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:07,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:14:07,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:14:07,311 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-07-18 00:14:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:07,739 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2020-07-18 00:14:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:14:07,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-07-18 00:14:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2020-07-18 00:14:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2020-07-18 00:14:07,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 76 transitions. [2020-07-18 00:14:07,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:07,894 INFO L225 Difference]: With dead ends: 64 [2020-07-18 00:14:07,895 INFO L226 Difference]: Without dead ends: 40 [2020-07-18 00:14:07,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:14:07,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-18 00:14:07,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-18 00:14:07,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:07,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:07,972 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:07,972 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:07,980 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-18 00:14:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2020-07-18 00:14:07,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:07,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:07,982 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:07,982 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:07,989 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-18 00:14:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2020-07-18 00:14:07,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:07,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:07,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:07,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-18 00:14:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2020-07-18 00:14:07,997 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 36 [2020-07-18 00:14:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:07,998 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2020-07-18 00:14:07,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:14:07,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 46 transitions. [2020-07-18 00:14:08,063 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:14:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2020-07-18 00:14:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-18 00:14:08,066 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:08,067 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:08,069 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:14:08,069 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:08,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:08,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1309951713, now seen corresponding path program 1 times [2020-07-18 00:14:08,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:08,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [448660478] [2020-07-18 00:14:08,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:08,200 INFO L280 TraceCheckUtils]: 0: Hoare triple {362#true} assume true; {362#true} is VALID [2020-07-18 00:14:08,200 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {362#true} {362#true} #63#return; {362#true} is VALID [2020-07-18 00:14:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:08,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {362#true} ~n := #in~n; {362#true} is VALID [2020-07-18 00:14:08,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {362#true} ~m := #in~m; {362#true} is VALID [2020-07-18 00:14:08,219 INFO L280 TraceCheckUtils]: 2: Hoare triple {362#true} assume !(~m < 0); {362#true} is VALID [2020-07-18 00:14:08,220 INFO L280 TraceCheckUtils]: 3: Hoare triple {362#true} assume 0 == ~m; {362#true} is VALID [2020-07-18 00:14:08,220 INFO L280 TraceCheckUtils]: 4: Hoare triple {362#true} #res := 0; {362#true} is VALID [2020-07-18 00:14:08,220 INFO L280 TraceCheckUtils]: 5: Hoare triple {362#true} assume true; {362#true} is VALID [2020-07-18 00:14:08,221 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {362#true} {362#true} #61#return; {362#true} is VALID [2020-07-18 00:14:08,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {362#true} ~n := #in~n; {362#true} is VALID [2020-07-18 00:14:08,222 INFO L280 TraceCheckUtils]: 1: Hoare triple {362#true} ~m := #in~m; {362#true} is VALID [2020-07-18 00:14:08,223 INFO L280 TraceCheckUtils]: 2: Hoare triple {362#true} assume !(~m < 0); {362#true} is VALID [2020-07-18 00:14:08,223 INFO L280 TraceCheckUtils]: 3: Hoare triple {362#true} assume !(0 == ~m); {362#true} is VALID [2020-07-18 00:14:08,223 INFO L263 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret1 := mult(~n, ~m - 1); {362#true} is VALID [2020-07-18 00:14:08,223 INFO L280 TraceCheckUtils]: 5: Hoare triple {362#true} ~n := #in~n; {362#true} is VALID [2020-07-18 00:14:08,224 INFO L280 TraceCheckUtils]: 6: Hoare triple {362#true} ~m := #in~m; {362#true} is VALID [2020-07-18 00:14:08,224 INFO L280 TraceCheckUtils]: 7: Hoare triple {362#true} assume !(~m < 0); {362#true} is VALID [2020-07-18 00:14:08,224 INFO L280 TraceCheckUtils]: 8: Hoare triple {362#true} assume 0 == ~m; {362#true} is VALID [2020-07-18 00:14:08,225 INFO L280 TraceCheckUtils]: 9: Hoare triple {362#true} #res := 0; {362#true} is VALID [2020-07-18 00:14:08,225 INFO L280 TraceCheckUtils]: 10: Hoare triple {362#true} assume true; {362#true} is VALID [2020-07-18 00:14:08,225 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {362#true} {362#true} #61#return; {362#true} is VALID [2020-07-18 00:14:08,226 INFO L280 TraceCheckUtils]: 12: Hoare triple {362#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {362#true} is VALID [2020-07-18 00:14:08,226 INFO L280 TraceCheckUtils]: 13: Hoare triple {362#true} #res := ~n + #t~ret1; {362#true} is VALID [2020-07-18 00:14:08,226 INFO L280 TraceCheckUtils]: 14: Hoare triple {362#true} havoc #t~ret1; {362#true} is VALID [2020-07-18 00:14:08,226 INFO L280 TraceCheckUtils]: 15: Hoare triple {362#true} assume true; {362#true} is VALID [2020-07-18 00:14:08,227 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {362#true} {362#true} #67#return; {362#true} is VALID [2020-07-18 00:14:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:08,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {362#true} ~n := #in~n; {362#true} is VALID [2020-07-18 00:14:08,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {362#true} ~m := #in~m; {398#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:08,259 INFO L280 TraceCheckUtils]: 2: Hoare triple {398#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {398#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:08,260 INFO L280 TraceCheckUtils]: 3: Hoare triple {398#(= |mult_#in~m| mult_~m)} assume 0 == ~m; {399#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:08,261 INFO L280 TraceCheckUtils]: 4: Hoare triple {399#(<= |mult_#in~m| 0)} #res := 0; {399#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:08,261 INFO L280 TraceCheckUtils]: 5: Hoare triple {399#(<= |mult_#in~m| 0)} assume true; {399#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:08,263 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {399#(<= |mult_#in~m| 0)} {362#true} #69#return; {390#(<= main_~m~0 0)} is VALID [2020-07-18 00:14:08,263 INFO L263 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2020-07-18 00:14:08,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {362#true} assume true; {362#true} is VALID [2020-07-18 00:14:08,264 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {362#true} {362#true} #63#return; {362#true} is VALID [2020-07-18 00:14:08,264 INFO L263 TraceCheckUtils]: 3: Hoare triple {362#true} call #t~ret6 := main(); {362#true} is VALID [2020-07-18 00:14:08,265 INFO L280 TraceCheckUtils]: 4: Hoare triple {362#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {362#true} is VALID [2020-07-18 00:14:08,265 INFO L280 TraceCheckUtils]: 5: Hoare triple {362#true} ~m~0 := #t~nondet2; {362#true} is VALID [2020-07-18 00:14:08,265 INFO L280 TraceCheckUtils]: 6: Hoare triple {362#true} havoc #t~nondet2; {362#true} is VALID [2020-07-18 00:14:08,265 INFO L280 TraceCheckUtils]: 7: Hoare triple {362#true} assume !(~m~0 < 0 || ~m~0 > 46340); {362#true} is VALID [2020-07-18 00:14:08,266 INFO L280 TraceCheckUtils]: 8: Hoare triple {362#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {362#true} is VALID [2020-07-18 00:14:08,266 INFO L280 TraceCheckUtils]: 9: Hoare triple {362#true} ~n~0 := #t~nondet3; {362#true} is VALID [2020-07-18 00:14:08,266 INFO L280 TraceCheckUtils]: 10: Hoare triple {362#true} havoc #t~nondet3; {362#true} is VALID [2020-07-18 00:14:08,267 INFO L280 TraceCheckUtils]: 11: Hoare triple {362#true} assume !(~n~0 < 0 || ~n~0 > 46340); {362#true} is VALID [2020-07-18 00:14:08,267 INFO L263 TraceCheckUtils]: 12: Hoare triple {362#true} call #t~ret4 := mult(~m~0, ~n~0); {362#true} is VALID [2020-07-18 00:14:08,267 INFO L280 TraceCheckUtils]: 13: Hoare triple {362#true} ~n := #in~n; {362#true} is VALID [2020-07-18 00:14:08,267 INFO L280 TraceCheckUtils]: 14: Hoare triple {362#true} ~m := #in~m; {362#true} is VALID [2020-07-18 00:14:08,268 INFO L280 TraceCheckUtils]: 15: Hoare triple {362#true} assume !(~m < 0); {362#true} is VALID [2020-07-18 00:14:08,268 INFO L280 TraceCheckUtils]: 16: Hoare triple {362#true} assume !(0 == ~m); {362#true} is VALID [2020-07-18 00:14:08,268 INFO L263 TraceCheckUtils]: 17: Hoare triple {362#true} call #t~ret1 := mult(~n, ~m - 1); {362#true} is VALID [2020-07-18 00:14:08,269 INFO L280 TraceCheckUtils]: 18: Hoare triple {362#true} ~n := #in~n; {362#true} is VALID [2020-07-18 00:14:08,269 INFO L280 TraceCheckUtils]: 19: Hoare triple {362#true} ~m := #in~m; {362#true} is VALID [2020-07-18 00:14:08,269 INFO L280 TraceCheckUtils]: 20: Hoare triple {362#true} assume !(~m < 0); {362#true} is VALID [2020-07-18 00:14:08,270 INFO L280 TraceCheckUtils]: 21: Hoare triple {362#true} assume 0 == ~m; {362#true} is VALID [2020-07-18 00:14:08,270 INFO L280 TraceCheckUtils]: 22: Hoare triple {362#true} #res := 0; {362#true} is VALID [2020-07-18 00:14:08,270 INFO L280 TraceCheckUtils]: 23: Hoare triple {362#true} assume true; {362#true} is VALID [2020-07-18 00:14:08,270 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {362#true} {362#true} #61#return; {362#true} is VALID [2020-07-18 00:14:08,271 INFO L280 TraceCheckUtils]: 25: Hoare triple {362#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {362#true} is VALID [2020-07-18 00:14:08,271 INFO L280 TraceCheckUtils]: 26: Hoare triple {362#true} #res := ~n + #t~ret1; {362#true} is VALID [2020-07-18 00:14:08,271 INFO L280 TraceCheckUtils]: 27: Hoare triple {362#true} havoc #t~ret1; {362#true} is VALID [2020-07-18 00:14:08,272 INFO L280 TraceCheckUtils]: 28: Hoare triple {362#true} assume true; {362#true} is VALID [2020-07-18 00:14:08,272 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {362#true} {362#true} #67#return; {362#true} is VALID [2020-07-18 00:14:08,272 INFO L280 TraceCheckUtils]: 30: Hoare triple {362#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {362#true} is VALID [2020-07-18 00:14:08,273 INFO L280 TraceCheckUtils]: 31: Hoare triple {362#true} ~res1~0 := #t~ret4; {362#true} is VALID [2020-07-18 00:14:08,273 INFO L280 TraceCheckUtils]: 32: Hoare triple {362#true} havoc #t~ret4; {362#true} is VALID [2020-07-18 00:14:08,273 INFO L263 TraceCheckUtils]: 33: Hoare triple {362#true} call #t~ret5 := mult(~n~0, ~m~0); {362#true} is VALID [2020-07-18 00:14:08,273 INFO L280 TraceCheckUtils]: 34: Hoare triple {362#true} ~n := #in~n; {362#true} is VALID [2020-07-18 00:14:08,274 INFO L280 TraceCheckUtils]: 35: Hoare triple {362#true} ~m := #in~m; {398#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:08,275 INFO L280 TraceCheckUtils]: 36: Hoare triple {398#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {398#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:08,276 INFO L280 TraceCheckUtils]: 37: Hoare triple {398#(= |mult_#in~m| mult_~m)} assume 0 == ~m; {399#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:08,277 INFO L280 TraceCheckUtils]: 38: Hoare triple {399#(<= |mult_#in~m| 0)} #res := 0; {399#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:08,278 INFO L280 TraceCheckUtils]: 39: Hoare triple {399#(<= |mult_#in~m| 0)} assume true; {399#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:08,279 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {399#(<= |mult_#in~m| 0)} {362#true} #69#return; {390#(<= main_~m~0 0)} is VALID [2020-07-18 00:14:08,280 INFO L280 TraceCheckUtils]: 41: Hoare triple {390#(<= main_~m~0 0)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {390#(<= main_~m~0 0)} is VALID [2020-07-18 00:14:08,281 INFO L280 TraceCheckUtils]: 42: Hoare triple {390#(<= main_~m~0 0)} ~res2~0 := #t~ret5; {390#(<= main_~m~0 0)} is VALID [2020-07-18 00:14:08,282 INFO L280 TraceCheckUtils]: 43: Hoare triple {390#(<= main_~m~0 0)} havoc #t~ret5; {390#(<= main_~m~0 0)} is VALID [2020-07-18 00:14:08,283 INFO L280 TraceCheckUtils]: 44: Hoare triple {390#(<= main_~m~0 0)} assume (~res1~0 != ~res2~0 && ~m~0 > 0) && ~n~0 > 0; {363#false} is VALID [2020-07-18 00:14:08,283 INFO L280 TraceCheckUtils]: 45: Hoare triple {363#false} assume !false; {363#false} is VALID [2020-07-18 00:14:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-18 00:14:08,291 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:08,291 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [448660478] [2020-07-18 00:14:08,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:08,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:14:08,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758112530] [2020-07-18 00:14:08,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-07-18 00:14:08,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:08,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:14:08,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:08,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:14:08,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:08,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:14:08,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:14:08,346 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 5 states. [2020-07-18 00:14:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:08,641 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-07-18 00:14:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:14:08,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-07-18 00:14:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2020-07-18 00:14:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2020-07-18 00:14:08,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2020-07-18 00:14:08,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:08,714 INFO L225 Difference]: With dead ends: 46 [2020-07-18 00:14:08,715 INFO L226 Difference]: Without dead ends: 40 [2020-07-18 00:14:08,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:14:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-18 00:14:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-18 00:14:08,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:08,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:08,756 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:08,756 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:08,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:08,760 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2020-07-18 00:14:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-07-18 00:14:08,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:08,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:08,762 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:08,762 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:08,767 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2020-07-18 00:14:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-07-18 00:14:08,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:08,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:08,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:08,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-18 00:14:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2020-07-18 00:14:08,772 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 46 [2020-07-18 00:14:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:08,773 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2020-07-18 00:14:08,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:14:08,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 45 transitions. [2020-07-18 00:14:08,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-07-18 00:14:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-18 00:14:08,847 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:08,847 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:08,848 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:14:08,848 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:08,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:08,848 INFO L82 PathProgramCache]: Analyzing trace with hash 942191350, now seen corresponding path program 2 times [2020-07-18 00:14:08,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:08,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1947175853] [2020-07-18 00:14:08,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:09,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {657#true} assume true; {657#true} is VALID [2020-07-18 00:14:09,034 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {657#true} {657#true} #63#return; {657#true} is VALID [2020-07-18 00:14:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:09,257 INFO L280 TraceCheckUtils]: 0: Hoare triple {657#true} ~n := #in~n; {657#true} is VALID [2020-07-18 00:14:09,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {657#true} ~m := #in~m; {710#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:09,258 INFO L280 TraceCheckUtils]: 2: Hoare triple {710#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {711#(and (= |mult_#in~m| mult_~m) (<= 0 mult_~m))} is VALID [2020-07-18 00:14:09,259 INFO L280 TraceCheckUtils]: 3: Hoare triple {711#(and (= |mult_#in~m| mult_~m) (<= 0 mult_~m))} assume 0 == ~m; {712#(and (<= |mult_#in~m| 0) (<= 0 |mult_#in~m|))} is VALID [2020-07-18 00:14:09,260 INFO L280 TraceCheckUtils]: 4: Hoare triple {712#(and (<= |mult_#in~m| 0) (<= 0 |mult_#in~m|))} #res := 0; {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} is VALID [2020-07-18 00:14:09,261 INFO L280 TraceCheckUtils]: 5: Hoare triple {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} assume true; {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} is VALID [2020-07-18 00:14:09,264 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} #61#return; {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} is VALID [2020-07-18 00:14:09,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {657#true} ~n := #in~n; {699#(= |mult_#in~n| mult_~n)} is VALID [2020-07-18 00:14:09,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {699#(= |mult_#in~n| mult_~n)} ~m := #in~m; {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} is VALID [2020-07-18 00:14:09,269 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} assume !(~m < 0); {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} is VALID [2020-07-18 00:14:09,271 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} assume !(0 == ~m); {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} is VALID [2020-07-18 00:14:09,271 INFO L263 TraceCheckUtils]: 4: Hoare triple {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} call #t~ret1 := mult(~n, ~m - 1); {657#true} is VALID [2020-07-18 00:14:09,271 INFO L280 TraceCheckUtils]: 5: Hoare triple {657#true} ~n := #in~n; {657#true} is VALID [2020-07-18 00:14:09,273 INFO L280 TraceCheckUtils]: 6: Hoare triple {657#true} ~m := #in~m; {710#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:09,275 INFO L280 TraceCheckUtils]: 7: Hoare triple {710#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {711#(and (= |mult_#in~m| mult_~m) (<= 0 mult_~m))} is VALID [2020-07-18 00:14:09,277 INFO L280 TraceCheckUtils]: 8: Hoare triple {711#(and (= |mult_#in~m| mult_~m) (<= 0 mult_~m))} assume 0 == ~m; {712#(and (<= |mult_#in~m| 0) (<= 0 |mult_#in~m|))} is VALID [2020-07-18 00:14:09,280 INFO L280 TraceCheckUtils]: 9: Hoare triple {712#(and (<= |mult_#in~m| 0) (<= 0 |mult_#in~m|))} #res := 0; {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} is VALID [2020-07-18 00:14:09,280 INFO L280 TraceCheckUtils]: 10: Hoare triple {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} assume true; {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} is VALID [2020-07-18 00:14:09,282 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} #61#return; {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} is VALID [2020-07-18 00:14:09,283 INFO L280 TraceCheckUtils]: 12: Hoare triple {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} is VALID [2020-07-18 00:14:09,285 INFO L280 TraceCheckUtils]: 13: Hoare triple {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} #res := ~n + #t~ret1; {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} is VALID [2020-07-18 00:14:09,286 INFO L280 TraceCheckUtils]: 14: Hoare triple {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} havoc #t~ret1; {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} is VALID [2020-07-18 00:14:09,288 INFO L280 TraceCheckUtils]: 15: Hoare triple {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} assume true; {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} is VALID [2020-07-18 00:14:09,289 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} {657#true} #67#return; {678#(and (<= (+ main_~m~0 main_~n~0) (+ |main_#t~ret4| 1)) (<= (+ |main_#t~ret4| 1) (+ main_~m~0 main_~n~0)))} is VALID [2020-07-18 00:14:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:09,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {657#true} ~n := #in~n; {657#true} is VALID [2020-07-18 00:14:09,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {657#true} ~m := #in~m; {710#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:09,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {710#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {711#(and (= |mult_#in~m| mult_~m) (<= 0 mult_~m))} is VALID [2020-07-18 00:14:09,375 INFO L280 TraceCheckUtils]: 3: Hoare triple {711#(and (= |mult_#in~m| mult_~m) (<= 0 mult_~m))} assume 0 == ~m; {712#(and (<= |mult_#in~m| 0) (<= 0 |mult_#in~m|))} is VALID [2020-07-18 00:14:09,376 INFO L280 TraceCheckUtils]: 4: Hoare triple {712#(and (<= |mult_#in~m| 0) (<= 0 |mult_#in~m|))} #res := 0; {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} is VALID [2020-07-18 00:14:09,377 INFO L280 TraceCheckUtils]: 5: Hoare triple {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} assume true; {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} is VALID [2020-07-18 00:14:09,378 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} #61#return; {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} is VALID [2020-07-18 00:14:09,380 INFO L280 TraceCheckUtils]: 0: Hoare triple {657#true} ~n := #in~n; {699#(= |mult_#in~n| mult_~n)} is VALID [2020-07-18 00:14:09,381 INFO L280 TraceCheckUtils]: 1: Hoare triple {699#(= |mult_#in~n| mult_~n)} ~m := #in~m; {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} is VALID [2020-07-18 00:14:09,382 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} assume !(~m < 0); {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} is VALID [2020-07-18 00:14:09,382 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} assume !(0 == ~m); {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} is VALID [2020-07-18 00:14:09,383 INFO L263 TraceCheckUtils]: 4: Hoare triple {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} call #t~ret1 := mult(~n, ~m - 1); {657#true} is VALID [2020-07-18 00:14:09,383 INFO L280 TraceCheckUtils]: 5: Hoare triple {657#true} ~n := #in~n; {657#true} is VALID [2020-07-18 00:14:09,384 INFO L280 TraceCheckUtils]: 6: Hoare triple {657#true} ~m := #in~m; {710#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:09,384 INFO L280 TraceCheckUtils]: 7: Hoare triple {710#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {711#(and (= |mult_#in~m| mult_~m) (<= 0 mult_~m))} is VALID [2020-07-18 00:14:09,385 INFO L280 TraceCheckUtils]: 8: Hoare triple {711#(and (= |mult_#in~m| mult_~m) (<= 0 mult_~m))} assume 0 == ~m; {712#(and (<= |mult_#in~m| 0) (<= 0 |mult_#in~m|))} is VALID [2020-07-18 00:14:09,386 INFO L280 TraceCheckUtils]: 9: Hoare triple {712#(and (<= |mult_#in~m| 0) (<= 0 |mult_#in~m|))} #res := 0; {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} is VALID [2020-07-18 00:14:09,386 INFO L280 TraceCheckUtils]: 10: Hoare triple {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} assume true; {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} is VALID [2020-07-18 00:14:09,388 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} #61#return; {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} is VALID [2020-07-18 00:14:09,389 INFO L280 TraceCheckUtils]: 12: Hoare triple {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} is VALID [2020-07-18 00:14:09,391 INFO L280 TraceCheckUtils]: 13: Hoare triple {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} #res := ~n + #t~ret1; {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} is VALID [2020-07-18 00:14:09,391 INFO L280 TraceCheckUtils]: 14: Hoare triple {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} havoc #t~ret1; {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} is VALID [2020-07-18 00:14:09,392 INFO L280 TraceCheckUtils]: 15: Hoare triple {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} assume true; {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} is VALID [2020-07-18 00:14:09,394 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} {679#(and (<= (+ main_~m~0 main_~n~0) (+ main_~res1~0 1)) (<= (+ main_~res1~0 1) (+ main_~m~0 main_~n~0)))} #69#return; {697#(and (<= main_~res1~0 |main_#t~ret5|) (<= |main_#t~ret5| main_~res1~0))} is VALID [2020-07-18 00:14:09,395 INFO L263 TraceCheckUtils]: 0: Hoare triple {657#true} call ULTIMATE.init(); {657#true} is VALID [2020-07-18 00:14:09,396 INFO L280 TraceCheckUtils]: 1: Hoare triple {657#true} assume true; {657#true} is VALID [2020-07-18 00:14:09,396 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {657#true} {657#true} #63#return; {657#true} is VALID [2020-07-18 00:14:09,396 INFO L263 TraceCheckUtils]: 3: Hoare triple {657#true} call #t~ret6 := main(); {657#true} is VALID [2020-07-18 00:14:09,397 INFO L280 TraceCheckUtils]: 4: Hoare triple {657#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {657#true} is VALID [2020-07-18 00:14:09,397 INFO L280 TraceCheckUtils]: 5: Hoare triple {657#true} ~m~0 := #t~nondet2; {657#true} is VALID [2020-07-18 00:14:09,397 INFO L280 TraceCheckUtils]: 6: Hoare triple {657#true} havoc #t~nondet2; {657#true} is VALID [2020-07-18 00:14:09,397 INFO L280 TraceCheckUtils]: 7: Hoare triple {657#true} assume !(~m~0 < 0 || ~m~0 > 46340); {657#true} is VALID [2020-07-18 00:14:09,397 INFO L280 TraceCheckUtils]: 8: Hoare triple {657#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {657#true} is VALID [2020-07-18 00:14:09,398 INFO L280 TraceCheckUtils]: 9: Hoare triple {657#true} ~n~0 := #t~nondet3; {657#true} is VALID [2020-07-18 00:14:09,398 INFO L280 TraceCheckUtils]: 10: Hoare triple {657#true} havoc #t~nondet3; {657#true} is VALID [2020-07-18 00:14:09,398 INFO L280 TraceCheckUtils]: 11: Hoare triple {657#true} assume !(~n~0 < 0 || ~n~0 > 46340); {657#true} is VALID [2020-07-18 00:14:09,399 INFO L263 TraceCheckUtils]: 12: Hoare triple {657#true} call #t~ret4 := mult(~m~0, ~n~0); {657#true} is VALID [2020-07-18 00:14:09,400 INFO L280 TraceCheckUtils]: 13: Hoare triple {657#true} ~n := #in~n; {699#(= |mult_#in~n| mult_~n)} is VALID [2020-07-18 00:14:09,400 INFO L280 TraceCheckUtils]: 14: Hoare triple {699#(= |mult_#in~n| mult_~n)} ~m := #in~m; {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} is VALID [2020-07-18 00:14:09,402 INFO L280 TraceCheckUtils]: 15: Hoare triple {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} assume !(~m < 0); {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} is VALID [2020-07-18 00:14:09,404 INFO L280 TraceCheckUtils]: 16: Hoare triple {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} assume !(0 == ~m); {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} is VALID [2020-07-18 00:14:09,404 INFO L263 TraceCheckUtils]: 17: Hoare triple {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} call #t~ret1 := mult(~n, ~m - 1); {657#true} is VALID [2020-07-18 00:14:09,404 INFO L280 TraceCheckUtils]: 18: Hoare triple {657#true} ~n := #in~n; {657#true} is VALID [2020-07-18 00:14:09,406 INFO L280 TraceCheckUtils]: 19: Hoare triple {657#true} ~m := #in~m; {710#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:09,407 INFO L280 TraceCheckUtils]: 20: Hoare triple {710#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {711#(and (= |mult_#in~m| mult_~m) (<= 0 mult_~m))} is VALID [2020-07-18 00:14:09,408 INFO L280 TraceCheckUtils]: 21: Hoare triple {711#(and (= |mult_#in~m| mult_~m) (<= 0 mult_~m))} assume 0 == ~m; {712#(and (<= |mult_#in~m| 0) (<= 0 |mult_#in~m|))} is VALID [2020-07-18 00:14:09,411 INFO L280 TraceCheckUtils]: 22: Hoare triple {712#(and (<= |mult_#in~m| 0) (<= 0 |mult_#in~m|))} #res := 0; {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} is VALID [2020-07-18 00:14:09,412 INFO L280 TraceCheckUtils]: 23: Hoare triple {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} assume true; {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} is VALID [2020-07-18 00:14:09,415 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} #61#return; {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} is VALID [2020-07-18 00:14:09,417 INFO L280 TraceCheckUtils]: 25: Hoare triple {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} is VALID [2020-07-18 00:14:09,418 INFO L280 TraceCheckUtils]: 26: Hoare triple {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} #res := ~n + #t~ret1; {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} is VALID [2020-07-18 00:14:09,419 INFO L280 TraceCheckUtils]: 27: Hoare triple {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} havoc #t~ret1; {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} is VALID [2020-07-18 00:14:09,420 INFO L280 TraceCheckUtils]: 28: Hoare triple {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} assume true; {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} is VALID [2020-07-18 00:14:09,422 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} {657#true} #67#return; {678#(and (<= (+ main_~m~0 main_~n~0) (+ |main_#t~ret4| 1)) (<= (+ |main_#t~ret4| 1) (+ main_~m~0 main_~n~0)))} is VALID [2020-07-18 00:14:09,423 INFO L280 TraceCheckUtils]: 30: Hoare triple {678#(and (<= (+ main_~m~0 main_~n~0) (+ |main_#t~ret4| 1)) (<= (+ |main_#t~ret4| 1) (+ main_~m~0 main_~n~0)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {678#(and (<= (+ main_~m~0 main_~n~0) (+ |main_#t~ret4| 1)) (<= (+ |main_#t~ret4| 1) (+ main_~m~0 main_~n~0)))} is VALID [2020-07-18 00:14:09,424 INFO L280 TraceCheckUtils]: 31: Hoare triple {678#(and (<= (+ main_~m~0 main_~n~0) (+ |main_#t~ret4| 1)) (<= (+ |main_#t~ret4| 1) (+ main_~m~0 main_~n~0)))} ~res1~0 := #t~ret4; {679#(and (<= (+ main_~m~0 main_~n~0) (+ main_~res1~0 1)) (<= (+ main_~res1~0 1) (+ main_~m~0 main_~n~0)))} is VALID [2020-07-18 00:14:09,424 INFO L280 TraceCheckUtils]: 32: Hoare triple {679#(and (<= (+ main_~m~0 main_~n~0) (+ main_~res1~0 1)) (<= (+ main_~res1~0 1) (+ main_~m~0 main_~n~0)))} havoc #t~ret4; {679#(and (<= (+ main_~m~0 main_~n~0) (+ main_~res1~0 1)) (<= (+ main_~res1~0 1) (+ main_~m~0 main_~n~0)))} is VALID [2020-07-18 00:14:09,425 INFO L263 TraceCheckUtils]: 33: Hoare triple {679#(and (<= (+ main_~m~0 main_~n~0) (+ main_~res1~0 1)) (<= (+ main_~res1~0 1) (+ main_~m~0 main_~n~0)))} call #t~ret5 := mult(~n~0, ~m~0); {657#true} is VALID [2020-07-18 00:14:09,426 INFO L280 TraceCheckUtils]: 34: Hoare triple {657#true} ~n := #in~n; {699#(= |mult_#in~n| mult_~n)} is VALID [2020-07-18 00:14:09,426 INFO L280 TraceCheckUtils]: 35: Hoare triple {699#(= |mult_#in~n| mult_~n)} ~m := #in~m; {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} is VALID [2020-07-18 00:14:09,427 INFO L280 TraceCheckUtils]: 36: Hoare triple {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} assume !(~m < 0); {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} is VALID [2020-07-18 00:14:09,428 INFO L280 TraceCheckUtils]: 37: Hoare triple {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} assume !(0 == ~m); {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} is VALID [2020-07-18 00:14:09,428 INFO L263 TraceCheckUtils]: 38: Hoare triple {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} call #t~ret1 := mult(~n, ~m - 1); {657#true} is VALID [2020-07-18 00:14:09,428 INFO L280 TraceCheckUtils]: 39: Hoare triple {657#true} ~n := #in~n; {657#true} is VALID [2020-07-18 00:14:09,429 INFO L280 TraceCheckUtils]: 40: Hoare triple {657#true} ~m := #in~m; {710#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:09,430 INFO L280 TraceCheckUtils]: 41: Hoare triple {710#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {711#(and (= |mult_#in~m| mult_~m) (<= 0 mult_~m))} is VALID [2020-07-18 00:14:09,431 INFO L280 TraceCheckUtils]: 42: Hoare triple {711#(and (= |mult_#in~m| mult_~m) (<= 0 mult_~m))} assume 0 == ~m; {712#(and (<= |mult_#in~m| 0) (<= 0 |mult_#in~m|))} is VALID [2020-07-18 00:14:09,431 INFO L280 TraceCheckUtils]: 43: Hoare triple {712#(and (<= |mult_#in~m| 0) (<= 0 |mult_#in~m|))} #res := 0; {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} is VALID [2020-07-18 00:14:09,432 INFO L280 TraceCheckUtils]: 44: Hoare triple {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} assume true; {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} is VALID [2020-07-18 00:14:09,434 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {713#(and (<= |mult_#res| |mult_#in~m|) (<= |mult_#in~m| |mult_#res|))} {700#(and (= |mult_#in~m| mult_~m) (= |mult_#in~n| mult_~n))} #61#return; {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} is VALID [2020-07-18 00:14:09,435 INFO L280 TraceCheckUtils]: 46: Hoare triple {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} is VALID [2020-07-18 00:14:09,436 INFO L280 TraceCheckUtils]: 47: Hoare triple {708#(and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| (+ |mult_#t~ret1| 1)) (<= (+ |mult_#t~ret1| 1) |mult_#in~m|))} #res := ~n + #t~ret1; {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} is VALID [2020-07-18 00:14:09,437 INFO L280 TraceCheckUtils]: 48: Hoare triple {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} havoc #t~ret1; {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} is VALID [2020-07-18 00:14:09,438 INFO L280 TraceCheckUtils]: 49: Hoare triple {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} assume true; {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} is VALID [2020-07-18 00:14:09,440 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {709#(and (<= (+ |mult_#in~m| |mult_#in~n|) (+ |mult_#res| 1)) (<= (+ |mult_#res| 1) (+ |mult_#in~m| |mult_#in~n|)))} {679#(and (<= (+ main_~m~0 main_~n~0) (+ main_~res1~0 1)) (<= (+ main_~res1~0 1) (+ main_~m~0 main_~n~0)))} #69#return; {697#(and (<= main_~res1~0 |main_#t~ret5|) (<= |main_#t~ret5| main_~res1~0))} is VALID [2020-07-18 00:14:09,441 INFO L280 TraceCheckUtils]: 51: Hoare triple {697#(and (<= main_~res1~0 |main_#t~ret5|) (<= |main_#t~ret5| main_~res1~0))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {697#(and (<= main_~res1~0 |main_#t~ret5|) (<= |main_#t~ret5| main_~res1~0))} is VALID [2020-07-18 00:14:09,442 INFO L280 TraceCheckUtils]: 52: Hoare triple {697#(and (<= main_~res1~0 |main_#t~ret5|) (<= |main_#t~ret5| main_~res1~0))} ~res2~0 := #t~ret5; {698#(and (<= main_~res1~0 main_~res2~0) (< main_~res2~0 (+ main_~res1~0 1)))} is VALID [2020-07-18 00:14:09,442 INFO L280 TraceCheckUtils]: 53: Hoare triple {698#(and (<= main_~res1~0 main_~res2~0) (< main_~res2~0 (+ main_~res1~0 1)))} havoc #t~ret5; {698#(and (<= main_~res1~0 main_~res2~0) (< main_~res2~0 (+ main_~res1~0 1)))} is VALID [2020-07-18 00:14:09,443 INFO L280 TraceCheckUtils]: 54: Hoare triple {698#(and (<= main_~res1~0 main_~res2~0) (< main_~res2~0 (+ main_~res1~0 1)))} assume (~res1~0 != ~res2~0 && ~m~0 > 0) && ~n~0 > 0; {658#false} is VALID [2020-07-18 00:14:09,443 INFO L280 TraceCheckUtils]: 55: Hoare triple {658#false} assume !false; {658#false} is VALID [2020-07-18 00:14:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-18 00:14:09,455 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:09,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1947175853] [2020-07-18 00:14:09,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:09,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-18 00:14:09,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138741289] [2020-07-18 00:14:09,457 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2020-07-18 00:14:09,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:09,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 00:14:09,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:09,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 00:14:09,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:09,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 00:14:09,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-07-18 00:14:09,516 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 14 states. [2020-07-18 00:14:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:11,178 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2020-07-18 00:14:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 00:14:11,178 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2020-07-18 00:14:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:14:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2020-07-18 00:14:11,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:14:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2020-07-18 00:14:11,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 78 transitions. [2020-07-18 00:14:11,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:11,308 INFO L225 Difference]: With dead ends: 68 [2020-07-18 00:14:11,309 INFO L226 Difference]: Without dead ends: 62 [2020-07-18 00:14:11,310 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2020-07-18 00:14:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-18 00:14:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2020-07-18 00:14:11,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:11,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 51 states. [2020-07-18 00:14:11,403 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 51 states. [2020-07-18 00:14:11,403 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 51 states. [2020-07-18 00:14:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:11,408 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2020-07-18 00:14:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2020-07-18 00:14:11,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:11,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:11,410 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 62 states. [2020-07-18 00:14:11,410 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 62 states. [2020-07-18 00:14:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:11,414 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2020-07-18 00:14:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2020-07-18 00:14:11,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:11,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:11,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:11,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-18 00:14:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2020-07-18 00:14:11,419 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 56 [2020-07-18 00:14:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:11,420 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2020-07-18 00:14:11,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 00:14:11,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2020-07-18 00:14:11,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2020-07-18 00:14:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-18 00:14:11,528 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:11,528 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:11,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:14:11,529 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:11,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:11,529 INFO L82 PathProgramCache]: Analyzing trace with hash -156864787, now seen corresponding path program 1 times [2020-07-18 00:14:11,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:11,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1039680405] [2020-07-18 00:14:11,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:11,585 INFO L280 TraceCheckUtils]: 0: Hoare triple {1105#true} assume true; {1105#true} is VALID [2020-07-18 00:14:11,585 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1105#true} {1105#true} #63#return; {1105#true} is VALID [2020-07-18 00:14:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:11,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {1105#true} ~m := #in~m; {1105#true} is VALID [2020-07-18 00:14:11,609 INFO L280 TraceCheckUtils]: 2: Hoare triple {1105#true} assume !(~m < 0); {1105#true} is VALID [2020-07-18 00:14:11,609 INFO L280 TraceCheckUtils]: 3: Hoare triple {1105#true} assume 0 == ~m; {1105#true} is VALID [2020-07-18 00:14:11,610 INFO L280 TraceCheckUtils]: 4: Hoare triple {1105#true} #res := 0; {1105#true} is VALID [2020-07-18 00:14:11,610 INFO L280 TraceCheckUtils]: 5: Hoare triple {1105#true} assume true; {1105#true} is VALID [2020-07-18 00:14:11,610 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1105#true} {1105#true} #61#return; {1105#true} is VALID [2020-07-18 00:14:11,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,611 INFO L280 TraceCheckUtils]: 1: Hoare triple {1105#true} ~m := #in~m; {1105#true} is VALID [2020-07-18 00:14:11,612 INFO L280 TraceCheckUtils]: 2: Hoare triple {1105#true} assume !(~m < 0); {1105#true} is VALID [2020-07-18 00:14:11,612 INFO L280 TraceCheckUtils]: 3: Hoare triple {1105#true} assume !(0 == ~m); {1105#true} is VALID [2020-07-18 00:14:11,613 INFO L263 TraceCheckUtils]: 4: Hoare triple {1105#true} call #t~ret1 := mult(~n, ~m - 1); {1105#true} is VALID [2020-07-18 00:14:11,613 INFO L280 TraceCheckUtils]: 5: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,613 INFO L280 TraceCheckUtils]: 6: Hoare triple {1105#true} ~m := #in~m; {1105#true} is VALID [2020-07-18 00:14:11,613 INFO L280 TraceCheckUtils]: 7: Hoare triple {1105#true} assume !(~m < 0); {1105#true} is VALID [2020-07-18 00:14:11,614 INFO L280 TraceCheckUtils]: 8: Hoare triple {1105#true} assume 0 == ~m; {1105#true} is VALID [2020-07-18 00:14:11,614 INFO L280 TraceCheckUtils]: 9: Hoare triple {1105#true} #res := 0; {1105#true} is VALID [2020-07-18 00:14:11,615 INFO L280 TraceCheckUtils]: 10: Hoare triple {1105#true} assume true; {1105#true} is VALID [2020-07-18 00:14:11,615 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1105#true} {1105#true} #61#return; {1105#true} is VALID [2020-07-18 00:14:11,616 INFO L280 TraceCheckUtils]: 12: Hoare triple {1105#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1105#true} is VALID [2020-07-18 00:14:11,616 INFO L280 TraceCheckUtils]: 13: Hoare triple {1105#true} #res := ~n + #t~ret1; {1105#true} is VALID [2020-07-18 00:14:11,616 INFO L280 TraceCheckUtils]: 14: Hoare triple {1105#true} havoc #t~ret1; {1105#true} is VALID [2020-07-18 00:14:11,617 INFO L280 TraceCheckUtils]: 15: Hoare triple {1105#true} assume true; {1105#true} is VALID [2020-07-18 00:14:11,617 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1105#true} {1105#true} #67#return; {1105#true} is VALID [2020-07-18 00:14:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:11,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {1105#true} ~m := #in~m; {1185#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:11,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {1185#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {1185#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:11,751 INFO L280 TraceCheckUtils]: 3: Hoare triple {1185#(= |mult_#in~m| mult_~m)} assume 0 == ~m; {1186#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:11,752 INFO L280 TraceCheckUtils]: 4: Hoare triple {1186#(<= |mult_#in~m| 0)} #res := 0; {1186#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:11,753 INFO L280 TraceCheckUtils]: 5: Hoare triple {1186#(<= |mult_#in~m| 0)} assume true; {1186#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:11,754 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1186#(<= |mult_#in~m| 0)} {1177#(<= (+ mult_~m 1) 0)} #59#return; {1106#false} is VALID [2020-07-18 00:14:11,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {1105#true} ~m := #in~m; {1105#true} is VALID [2020-07-18 00:14:11,756 INFO L280 TraceCheckUtils]: 2: Hoare triple {1105#true} assume ~m < 0; {1177#(<= (+ mult_~m 1) 0)} is VALID [2020-07-18 00:14:11,756 INFO L263 TraceCheckUtils]: 3: Hoare triple {1177#(<= (+ mult_~m 1) 0)} call #t~ret0 := mult(~n, -~m); {1105#true} is VALID [2020-07-18 00:14:11,756 INFO L280 TraceCheckUtils]: 4: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,757 INFO L280 TraceCheckUtils]: 5: Hoare triple {1105#true} ~m := #in~m; {1185#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:11,758 INFO L280 TraceCheckUtils]: 6: Hoare triple {1185#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {1185#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:11,759 INFO L280 TraceCheckUtils]: 7: Hoare triple {1185#(= |mult_#in~m| mult_~m)} assume 0 == ~m; {1186#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:11,759 INFO L280 TraceCheckUtils]: 8: Hoare triple {1186#(<= |mult_#in~m| 0)} #res := 0; {1186#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:11,760 INFO L280 TraceCheckUtils]: 9: Hoare triple {1186#(<= |mult_#in~m| 0)} assume true; {1186#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:11,761 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1186#(<= |mult_#in~m| 0)} {1177#(<= (+ mult_~m 1) 0)} #59#return; {1106#false} is VALID [2020-07-18 00:14:11,761 INFO L280 TraceCheckUtils]: 11: Hoare triple {1106#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1106#false} is VALID [2020-07-18 00:14:11,762 INFO L280 TraceCheckUtils]: 12: Hoare triple {1106#false} #res := #t~ret0; {1106#false} is VALID [2020-07-18 00:14:11,762 INFO L280 TraceCheckUtils]: 13: Hoare triple {1106#false} havoc #t~ret0; {1106#false} is VALID [2020-07-18 00:14:11,762 INFO L280 TraceCheckUtils]: 14: Hoare triple {1106#false} assume true; {1106#false} is VALID [2020-07-18 00:14:11,762 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1106#false} {1160#(< 0 mult_~m)} #61#return; {1106#false} is VALID [2020-07-18 00:14:11,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {1105#true} ~m := #in~m; {1105#true} is VALID [2020-07-18 00:14:11,764 INFO L280 TraceCheckUtils]: 2: Hoare triple {1105#true} assume !(~m < 0); {1159#(< 0 (+ mult_~m 1))} is VALID [2020-07-18 00:14:11,765 INFO L280 TraceCheckUtils]: 3: Hoare triple {1159#(< 0 (+ mult_~m 1))} assume !(0 == ~m); {1160#(< 0 mult_~m)} is VALID [2020-07-18 00:14:11,765 INFO L263 TraceCheckUtils]: 4: Hoare triple {1160#(< 0 mult_~m)} call #t~ret1 := mult(~n, ~m - 1); {1105#true} is VALID [2020-07-18 00:14:11,766 INFO L280 TraceCheckUtils]: 5: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,766 INFO L280 TraceCheckUtils]: 6: Hoare triple {1105#true} ~m := #in~m; {1105#true} is VALID [2020-07-18 00:14:11,767 INFO L280 TraceCheckUtils]: 7: Hoare triple {1105#true} assume ~m < 0; {1177#(<= (+ mult_~m 1) 0)} is VALID [2020-07-18 00:14:11,767 INFO L263 TraceCheckUtils]: 8: Hoare triple {1177#(<= (+ mult_~m 1) 0)} call #t~ret0 := mult(~n, -~m); {1105#true} is VALID [2020-07-18 00:14:11,767 INFO L280 TraceCheckUtils]: 9: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,768 INFO L280 TraceCheckUtils]: 10: Hoare triple {1105#true} ~m := #in~m; {1185#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:11,769 INFO L280 TraceCheckUtils]: 11: Hoare triple {1185#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {1185#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:11,769 INFO L280 TraceCheckUtils]: 12: Hoare triple {1185#(= |mult_#in~m| mult_~m)} assume 0 == ~m; {1186#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:11,770 INFO L280 TraceCheckUtils]: 13: Hoare triple {1186#(<= |mult_#in~m| 0)} #res := 0; {1186#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:11,770 INFO L280 TraceCheckUtils]: 14: Hoare triple {1186#(<= |mult_#in~m| 0)} assume true; {1186#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:11,772 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1186#(<= |mult_#in~m| 0)} {1177#(<= (+ mult_~m 1) 0)} #59#return; {1106#false} is VALID [2020-07-18 00:14:11,772 INFO L280 TraceCheckUtils]: 16: Hoare triple {1106#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1106#false} is VALID [2020-07-18 00:14:11,772 INFO L280 TraceCheckUtils]: 17: Hoare triple {1106#false} #res := #t~ret0; {1106#false} is VALID [2020-07-18 00:14:11,772 INFO L280 TraceCheckUtils]: 18: Hoare triple {1106#false} havoc #t~ret0; {1106#false} is VALID [2020-07-18 00:14:11,773 INFO L280 TraceCheckUtils]: 19: Hoare triple {1106#false} assume true; {1106#false} is VALID [2020-07-18 00:14:11,773 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1106#false} {1160#(< 0 mult_~m)} #61#return; {1106#false} is VALID [2020-07-18 00:14:11,774 INFO L280 TraceCheckUtils]: 21: Hoare triple {1106#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1106#false} is VALID [2020-07-18 00:14:11,775 INFO L280 TraceCheckUtils]: 22: Hoare triple {1106#false} #res := ~n + #t~ret1; {1106#false} is VALID [2020-07-18 00:14:11,775 INFO L280 TraceCheckUtils]: 23: Hoare triple {1106#false} havoc #t~ret1; {1106#false} is VALID [2020-07-18 00:14:11,775 INFO L280 TraceCheckUtils]: 24: Hoare triple {1106#false} assume true; {1106#false} is VALID [2020-07-18 00:14:11,775 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1106#false} {1105#true} #69#return; {1106#false} is VALID [2020-07-18 00:14:11,776 INFO L263 TraceCheckUtils]: 0: Hoare triple {1105#true} call ULTIMATE.init(); {1105#true} is VALID [2020-07-18 00:14:11,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {1105#true} assume true; {1105#true} is VALID [2020-07-18 00:14:11,777 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1105#true} {1105#true} #63#return; {1105#true} is VALID [2020-07-18 00:14:11,777 INFO L263 TraceCheckUtils]: 3: Hoare triple {1105#true} call #t~ret6 := main(); {1105#true} is VALID [2020-07-18 00:14:11,777 INFO L280 TraceCheckUtils]: 4: Hoare triple {1105#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1105#true} is VALID [2020-07-18 00:14:11,778 INFO L280 TraceCheckUtils]: 5: Hoare triple {1105#true} ~m~0 := #t~nondet2; {1105#true} is VALID [2020-07-18 00:14:11,778 INFO L280 TraceCheckUtils]: 6: Hoare triple {1105#true} havoc #t~nondet2; {1105#true} is VALID [2020-07-18 00:14:11,778 INFO L280 TraceCheckUtils]: 7: Hoare triple {1105#true} assume !(~m~0 < 0 || ~m~0 > 46340); {1105#true} is VALID [2020-07-18 00:14:11,778 INFO L280 TraceCheckUtils]: 8: Hoare triple {1105#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1105#true} is VALID [2020-07-18 00:14:11,778 INFO L280 TraceCheckUtils]: 9: Hoare triple {1105#true} ~n~0 := #t~nondet3; {1105#true} is VALID [2020-07-18 00:14:11,779 INFO L280 TraceCheckUtils]: 10: Hoare triple {1105#true} havoc #t~nondet3; {1105#true} is VALID [2020-07-18 00:14:11,779 INFO L280 TraceCheckUtils]: 11: Hoare triple {1105#true} assume !(~n~0 < 0 || ~n~0 > 46340); {1105#true} is VALID [2020-07-18 00:14:11,780 INFO L263 TraceCheckUtils]: 12: Hoare triple {1105#true} call #t~ret4 := mult(~m~0, ~n~0); {1105#true} is VALID [2020-07-18 00:14:11,781 INFO L280 TraceCheckUtils]: 13: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,781 INFO L280 TraceCheckUtils]: 14: Hoare triple {1105#true} ~m := #in~m; {1105#true} is VALID [2020-07-18 00:14:11,781 INFO L280 TraceCheckUtils]: 15: Hoare triple {1105#true} assume !(~m < 0); {1105#true} is VALID [2020-07-18 00:14:11,781 INFO L280 TraceCheckUtils]: 16: Hoare triple {1105#true} assume !(0 == ~m); {1105#true} is VALID [2020-07-18 00:14:11,782 INFO L263 TraceCheckUtils]: 17: Hoare triple {1105#true} call #t~ret1 := mult(~n, ~m - 1); {1105#true} is VALID [2020-07-18 00:14:11,782 INFO L280 TraceCheckUtils]: 18: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,782 INFO L280 TraceCheckUtils]: 19: Hoare triple {1105#true} ~m := #in~m; {1105#true} is VALID [2020-07-18 00:14:11,782 INFO L280 TraceCheckUtils]: 20: Hoare triple {1105#true} assume !(~m < 0); {1105#true} is VALID [2020-07-18 00:14:11,782 INFO L280 TraceCheckUtils]: 21: Hoare triple {1105#true} assume 0 == ~m; {1105#true} is VALID [2020-07-18 00:14:11,783 INFO L280 TraceCheckUtils]: 22: Hoare triple {1105#true} #res := 0; {1105#true} is VALID [2020-07-18 00:14:11,783 INFO L280 TraceCheckUtils]: 23: Hoare triple {1105#true} assume true; {1105#true} is VALID [2020-07-18 00:14:11,783 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1105#true} {1105#true} #61#return; {1105#true} is VALID [2020-07-18 00:14:11,785 INFO L280 TraceCheckUtils]: 25: Hoare triple {1105#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1105#true} is VALID [2020-07-18 00:14:11,786 INFO L280 TraceCheckUtils]: 26: Hoare triple {1105#true} #res := ~n + #t~ret1; {1105#true} is VALID [2020-07-18 00:14:11,786 INFO L280 TraceCheckUtils]: 27: Hoare triple {1105#true} havoc #t~ret1; {1105#true} is VALID [2020-07-18 00:14:11,786 INFO L280 TraceCheckUtils]: 28: Hoare triple {1105#true} assume true; {1105#true} is VALID [2020-07-18 00:14:11,786 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1105#true} {1105#true} #67#return; {1105#true} is VALID [2020-07-18 00:14:11,787 INFO L280 TraceCheckUtils]: 30: Hoare triple {1105#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1105#true} is VALID [2020-07-18 00:14:11,787 INFO L280 TraceCheckUtils]: 31: Hoare triple {1105#true} ~res1~0 := #t~ret4; {1105#true} is VALID [2020-07-18 00:14:11,787 INFO L280 TraceCheckUtils]: 32: Hoare triple {1105#true} havoc #t~ret4; {1105#true} is VALID [2020-07-18 00:14:11,787 INFO L263 TraceCheckUtils]: 33: Hoare triple {1105#true} call #t~ret5 := mult(~n~0, ~m~0); {1105#true} is VALID [2020-07-18 00:14:11,787 INFO L280 TraceCheckUtils]: 34: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,788 INFO L280 TraceCheckUtils]: 35: Hoare triple {1105#true} ~m := #in~m; {1105#true} is VALID [2020-07-18 00:14:11,790 INFO L280 TraceCheckUtils]: 36: Hoare triple {1105#true} assume !(~m < 0); {1159#(< 0 (+ mult_~m 1))} is VALID [2020-07-18 00:14:11,791 INFO L280 TraceCheckUtils]: 37: Hoare triple {1159#(< 0 (+ mult_~m 1))} assume !(0 == ~m); {1160#(< 0 mult_~m)} is VALID [2020-07-18 00:14:11,792 INFO L263 TraceCheckUtils]: 38: Hoare triple {1160#(< 0 mult_~m)} call #t~ret1 := mult(~n, ~m - 1); {1105#true} is VALID [2020-07-18 00:14:11,792 INFO L280 TraceCheckUtils]: 39: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,792 INFO L280 TraceCheckUtils]: 40: Hoare triple {1105#true} ~m := #in~m; {1105#true} is VALID [2020-07-18 00:14:11,793 INFO L280 TraceCheckUtils]: 41: Hoare triple {1105#true} assume ~m < 0; {1177#(<= (+ mult_~m 1) 0)} is VALID [2020-07-18 00:14:11,793 INFO L263 TraceCheckUtils]: 42: Hoare triple {1177#(<= (+ mult_~m 1) 0)} call #t~ret0 := mult(~n, -~m); {1105#true} is VALID [2020-07-18 00:14:11,794 INFO L280 TraceCheckUtils]: 43: Hoare triple {1105#true} ~n := #in~n; {1105#true} is VALID [2020-07-18 00:14:11,794 INFO L280 TraceCheckUtils]: 44: Hoare triple {1105#true} ~m := #in~m; {1185#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:11,795 INFO L280 TraceCheckUtils]: 45: Hoare triple {1185#(= |mult_#in~m| mult_~m)} assume !(~m < 0); {1185#(= |mult_#in~m| mult_~m)} is VALID [2020-07-18 00:14:11,796 INFO L280 TraceCheckUtils]: 46: Hoare triple {1185#(= |mult_#in~m| mult_~m)} assume 0 == ~m; {1186#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:11,796 INFO L280 TraceCheckUtils]: 47: Hoare triple {1186#(<= |mult_#in~m| 0)} #res := 0; {1186#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:11,797 INFO L280 TraceCheckUtils]: 48: Hoare triple {1186#(<= |mult_#in~m| 0)} assume true; {1186#(<= |mult_#in~m| 0)} is VALID [2020-07-18 00:14:11,798 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {1186#(<= |mult_#in~m| 0)} {1177#(<= (+ mult_~m 1) 0)} #59#return; {1106#false} is VALID [2020-07-18 00:14:11,798 INFO L280 TraceCheckUtils]: 50: Hoare triple {1106#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1106#false} is VALID [2020-07-18 00:14:11,799 INFO L280 TraceCheckUtils]: 51: Hoare triple {1106#false} #res := #t~ret0; {1106#false} is VALID [2020-07-18 00:14:11,799 INFO L280 TraceCheckUtils]: 52: Hoare triple {1106#false} havoc #t~ret0; {1106#false} is VALID [2020-07-18 00:14:11,799 INFO L280 TraceCheckUtils]: 53: Hoare triple {1106#false} assume true; {1106#false} is VALID [2020-07-18 00:14:11,799 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {1106#false} {1160#(< 0 mult_~m)} #61#return; {1106#false} is VALID [2020-07-18 00:14:11,800 INFO L280 TraceCheckUtils]: 55: Hoare triple {1106#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1106#false} is VALID [2020-07-18 00:14:11,800 INFO L280 TraceCheckUtils]: 56: Hoare triple {1106#false} #res := ~n + #t~ret1; {1106#false} is VALID [2020-07-18 00:14:11,800 INFO L280 TraceCheckUtils]: 57: Hoare triple {1106#false} havoc #t~ret1; {1106#false} is VALID [2020-07-18 00:14:11,800 INFO L280 TraceCheckUtils]: 58: Hoare triple {1106#false} assume true; {1106#false} is VALID [2020-07-18 00:14:11,800 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {1106#false} {1105#true} #69#return; {1106#false} is VALID [2020-07-18 00:14:11,801 INFO L280 TraceCheckUtils]: 60: Hoare triple {1106#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1106#false} is VALID [2020-07-18 00:14:11,801 INFO L280 TraceCheckUtils]: 61: Hoare triple {1106#false} ~res2~0 := #t~ret5; {1106#false} is VALID [2020-07-18 00:14:11,801 INFO L280 TraceCheckUtils]: 62: Hoare triple {1106#false} havoc #t~ret5; {1106#false} is VALID [2020-07-18 00:14:11,801 INFO L280 TraceCheckUtils]: 63: Hoare triple {1106#false} assume (~res1~0 != ~res2~0 && ~m~0 > 0) && ~n~0 > 0; {1106#false} is VALID [2020-07-18 00:14:11,802 INFO L280 TraceCheckUtils]: 64: Hoare triple {1106#false} assume !false; {1106#false} is VALID [2020-07-18 00:14:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-18 00:14:12,183 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:12,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1039680405] [2020-07-18 00:14:12,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:12,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-18 00:14:12,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617434899] [2020-07-18 00:14:12,185 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2020-07-18 00:14:12,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:12,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-18 00:14:12,201 WARN L140 InductivityCheck]: Transition 1189#(and (<= |mult_#in~m| 0) (<= 0 (+ |mult_#res| 2147483648)) (<= |mult_#res| 2147483647)) ( _ , 1160#(< 0 mult_~m) , #61#return; , 1190#(and (<= |mult_#in~m| 0) (<= |mult_#t~ret1| 2147483647) (<= 0 (+ |mult_#t~ret1| 2147483648))) ) not inductive [2020-07-18 00:14:12,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:14:12,202 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) 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:14:12,208 INFO L168 Benchmark]: Toolchain (without parser) took 6332.63 ms. Allocated memory was 138.9 MB in the beginning and 279.4 MB in the end (delta: 140.5 MB). Free memory was 102.6 MB in the beginning and 123.6 MB in the end (delta: -21.0 MB). Peak memory consumption was 119.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:12,210 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 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:14:12,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.92 ms. Allocated memory is still 138.9 MB. Free memory was 102.2 MB in the beginning and 91.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:12,212 INFO L168 Benchmark]: Boogie Preprocessor took 116.79 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 91.9 MB in the beginning and 182.3 MB in the end (delta: -90.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:12,217 INFO L168 Benchmark]: RCFGBuilder took 465.96 ms. Allocated memory is still 203.4 MB. Free memory was 181.6 MB in the beginning and 159.4 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:12,219 INFO L168 Benchmark]: TraceAbstraction took 5456.98 ms. Allocated memory was 203.4 MB in the beginning and 279.4 MB in the end (delta: 76.0 MB). Free memory was 158.8 MB in the beginning and 123.6 MB in the end (delta: 35.2 MB). Peak memory consumption was 111.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:12,222 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.29 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 285.92 ms. Allocated memory is still 138.9 MB. Free memory was 102.2 MB in the beginning and 91.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.79 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 91.9 MB in the beginning and 182.3 MB in the end (delta: -90.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 465.96 ms. Allocated memory is still 203.4 MB. Free memory was 181.6 MB in the beginning and 159.4 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5456.98 ms. Allocated memory was 203.4 MB in the beginning and 279.4 MB in the end (delta: 76.0 MB). Free memory was 158.8 MB in the beginning and 123.6 MB in the end (delta: 35.2 MB). Peak memory consumption was 111.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...