/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/ldv-regression/oomInt.c_1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:01:01,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:01:01,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:01:01,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:01:01,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:01:01,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:01:01,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:01:01,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:01:01,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:01:01,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:01:01,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:01:01,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:01:01,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:01:01,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:01:01,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:01:01,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:01:01,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:01:01,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:01:01,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:01:01,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:01:01,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:01:01,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:01:01,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:01:01,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:01:01,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:01:01,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:01:01,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:01:01,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:01:01,477 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:01:01,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:01:01,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:01:01,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:01:01,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:01:01,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:01:01,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:01:01,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:01:01,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:01:01,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:01:01,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:01:01,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:01:01,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:01:01,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:01:01,496 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:01:01,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:01:01,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:01:01,498 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:01:01,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:01:01,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:01:01,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:01:01,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:01:01,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:01:01,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:01:01,499 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:01:01,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:01:01,500 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:01:01,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:01:01,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:01:01,500 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:01:01,501 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:01:01,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:01:01,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:01:01,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:01:01,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:01:01,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:01:01,502 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:01:01,802 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:01:01,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:01:01,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:01:01,823 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:01:01,824 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:01:01,825 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/oomInt.c_1.i [2020-07-10 19:01:01,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94967356/bb8829dc927e4492a4a064998e985676/FLAG2d0acd973 [2020-07-10 19:01:02,343 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:01:02,344 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/oomInt.c_1.i [2020-07-10 19:01:02,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94967356/bb8829dc927e4492a4a064998e985676/FLAG2d0acd973 [2020-07-10 19:01:02,724 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94967356/bb8829dc927e4492a4a064998e985676 [2020-07-10 19:01:02,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:01:02,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:01:02,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:01:02,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:01:02,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:01:02,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:01:02" (1/1) ... [2020-07-10 19:01:02,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4b5cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:02, skipping insertion in model container [2020-07-10 19:01:02,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:01:02" (1/1) ... [2020-07-10 19:01:02,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:01:02,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:01:02,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:01:02,977 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:01:02,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:01:03,007 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:01:03,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:03 WrapperNode [2020-07-10 19:01:03,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:01:03,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:01:03,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:01:03,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:01:03,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:03" (1/1) ... [2020-07-10 19:01:03,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:03" (1/1) ... [2020-07-10 19:01:03,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:03" (1/1) ... [2020-07-10 19:01:03,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:03" (1/1) ... [2020-07-10 19:01:03,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:03" (1/1) ... [2020-07-10 19:01:03,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:03" (1/1) ... [2020-07-10 19:01:03,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:03" (1/1) ... [2020-07-10 19:01:03,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:01:03,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:01:03,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:01:03,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:01:03,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:03" (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-10 19:01:03,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:01:03,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:01:03,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-07-10 19:01:03,197 INFO L138 BoogieDeclarations]: Found implementation of procedure abs_int [2020-07-10 19:01:03,197 INFO L138 BoogieDeclarations]: Found implementation of procedure firstFunction [2020-07-10 19:01:03,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:01:03,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:01:03,198 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-07-10 19:01:03,198 INFO L130 BoogieDeclarations]: Found specification of procedure abs_int [2020-07-10 19:01:03,198 INFO L130 BoogieDeclarations]: Found specification of procedure firstFunction [2020-07-10 19:01:03,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:01:03,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:01:03,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:01:03,436 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:01:03,437 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 19:01:03,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:01:03 BoogieIcfgContainer [2020-07-10 19:01:03,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:01:03,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:01:03,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:01:03,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:01:03,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:01:02" (1/3) ... [2020-07-10 19:01:03,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff6a9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:01:03, skipping insertion in model container [2020-07-10 19:01:03,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:03" (2/3) ... [2020-07-10 19:01:03,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff6a9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:01:03, skipping insertion in model container [2020-07-10 19:01:03,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:01:03" (3/3) ... [2020-07-10 19:01:03,454 INFO L109 eAbstractionObserver]: Analyzing ICFG oomInt.c_1.i [2020-07-10 19:01:03,469 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:01:03,479 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 19:01:03,497 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 19:01:03,526 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:01:03,526 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:01:03,527 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:01:03,527 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:01:03,527 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:01:03,527 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:01:03,528 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:01:03,528 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:01:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-10 19:01:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 19:01:03,561 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:01:03,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:01:03,563 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:01:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:01:03,577 INFO L82 PathProgramCache]: Analyzing trace with hash -874370234, now seen corresponding path program 1 times [2020-07-10 19:01:03,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:01:03,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [66811408] [2020-07-10 19:01:03,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:01:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:03,843 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {31#true} is VALID [2020-07-10 19:01:03,843 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-10 19:01:03,844 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #31#return; {31#true} is VALID [2020-07-10 19:01:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:04,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} ~i := #in~i; {44#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-10 19:01:04,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume ~i < 0; {44#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-10 19:01:04,036 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} #res := -~i; {45#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} is VALID [2020-07-10 19:01:04,038 INFO L280 TraceCheckUtils]: 3: Hoare triple {45#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} assume true; {45#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} is VALID [2020-07-10 19:01:04,041 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {45#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} {31#true} #35#return; {41#(<= 1 |firstFunction_#t~ret0|)} is VALID [2020-07-10 19:01:04,047 INFO L263 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {43#(= ~p~0 |old(~p~0)|)} is VALID [2020-07-10 19:01:04,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {31#true} is VALID [2020-07-10 19:01:04,048 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-10 19:01:04,048 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #31#return; {31#true} is VALID [2020-07-10 19:01:04,049 INFO L263 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret1 := main(); {31#true} is VALID [2020-07-10 19:01:04,049 INFO L263 TraceCheckUtils]: 5: Hoare triple {31#true} call firstFunction(); {31#true} is VALID [2020-07-10 19:01:04,050 INFO L263 TraceCheckUtils]: 6: Hoare triple {31#true} call #t~ret0 := abs_int(-3); {31#true} is VALID [2020-07-10 19:01:04,054 INFO L280 TraceCheckUtils]: 7: Hoare triple {31#true} ~i := #in~i; {44#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-10 19:01:04,055 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume ~i < 0; {44#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-10 19:01:04,061 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} #res := -~i; {45#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} is VALID [2020-07-10 19:01:04,066 INFO L280 TraceCheckUtils]: 10: Hoare triple {45#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} assume true; {45#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} is VALID [2020-07-10 19:01:04,071 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {45#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} {31#true} #35#return; {41#(<= 1 |firstFunction_#t~ret0|)} is VALID [2020-07-10 19:01:04,072 INFO L280 TraceCheckUtils]: 12: Hoare triple {41#(<= 1 |firstFunction_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {41#(<= 1 |firstFunction_#t~ret0|)} is VALID [2020-07-10 19:01:04,073 INFO L280 TraceCheckUtils]: 13: Hoare triple {41#(<= 1 |firstFunction_#t~ret0|)} ~p~0 := #t~ret0; {42#(<= 1 ~p~0)} is VALID [2020-07-10 19:01:04,074 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#(<= 1 ~p~0)} havoc #t~ret0; {42#(<= 1 ~p~0)} is VALID [2020-07-10 19:01:04,077 INFO L280 TraceCheckUtils]: 15: Hoare triple {42#(<= 1 ~p~0)} assume !(~p~0 >= 0); {32#false} is VALID [2020-07-10 19:01:04,078 INFO L263 TraceCheckUtils]: 16: Hoare triple {32#false} call __blast_assert(); {32#false} is VALID [2020-07-10 19:01:04,078 INFO L280 TraceCheckUtils]: 17: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-10 19:01:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:01:04,087 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:01:04,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [66811408] [2020-07-10 19:01:04,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:01:04,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 19:01:04,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733466094] [2020-07-10 19:01:04,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-10 19:01:04,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:01:04,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 19:01:04,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:04,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 19:01:04,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:01:04,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 19:01:04,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 19:01:04,205 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2020-07-10 19:01:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:04,752 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-07-10 19:01:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 19:01:04,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-10 19:01:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:01:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:01:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-10 19:01:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:01:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-10 19:01:04,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2020-07-10 19:01:04,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:04,865 INFO L225 Difference]: With dead ends: 49 [2020-07-10 19:01:04,866 INFO L226 Difference]: Without dead ends: 19 [2020-07-10 19:01:04,870 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-10 19:01:04,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-10 19:01:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-10 19:01:04,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:01:04,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-10 19:01:04,936 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 19:01:04,936 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 19:01:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:04,940 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-10 19:01:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-10 19:01:04,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:04,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:04,941 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 19:01:04,941 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 19:01:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:04,944 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-10 19:01:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-10 19:01:04,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:04,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:04,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:01:04,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:01:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 19:01:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2020-07-10 19:01:04,950 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 18 [2020-07-10 19:01:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:01:04,950 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2020-07-10 19:01:04,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 19:01:04,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 18 transitions. [2020-07-10 19:01:04,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-10 19:01:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 19:01:04,980 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:01:04,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:01:04,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:01:04,981 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:01:04,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:01:04,981 INFO L82 PathProgramCache]: Analyzing trace with hash -587338874, now seen corresponding path program 1 times [2020-07-10 19:01:04,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:01:04,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1182906242] [2020-07-10 19:01:04,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:01:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:05,025 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {230#true} is VALID [2020-07-10 19:01:05,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {230#true} assume true; {230#true} is VALID [2020-07-10 19:01:05,026 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {230#true} {230#true} #31#return; {230#true} is VALID [2020-07-10 19:01:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:05,093 INFO L280 TraceCheckUtils]: 0: Hoare triple {230#true} ~i := #in~i; {241#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-10 19:01:05,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {241#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume !(~i < 0); {242#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-10 19:01:05,095 INFO L280 TraceCheckUtils]: 2: Hoare triple {242#(not (= 0 (+ |abs_int_#in~i| 3)))} #res := ~i; {242#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-10 19:01:05,096 INFO L280 TraceCheckUtils]: 3: Hoare triple {242#(not (= 0 (+ |abs_int_#in~i| 3)))} assume true; {242#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-10 19:01:05,097 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {242#(not (= 0 (+ |abs_int_#in~i| 3)))} {230#true} #35#return; {231#false} is VALID [2020-07-10 19:01:05,099 INFO L263 TraceCheckUtils]: 0: Hoare triple {230#true} call ULTIMATE.init(); {240#(= ~p~0 |old(~p~0)|)} is VALID [2020-07-10 19:01:05,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {230#true} is VALID [2020-07-10 19:01:05,099 INFO L280 TraceCheckUtils]: 2: Hoare triple {230#true} assume true; {230#true} is VALID [2020-07-10 19:01:05,100 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {230#true} {230#true} #31#return; {230#true} is VALID [2020-07-10 19:01:05,100 INFO L263 TraceCheckUtils]: 4: Hoare triple {230#true} call #t~ret1 := main(); {230#true} is VALID [2020-07-10 19:01:05,100 INFO L263 TraceCheckUtils]: 5: Hoare triple {230#true} call firstFunction(); {230#true} is VALID [2020-07-10 19:01:05,101 INFO L263 TraceCheckUtils]: 6: Hoare triple {230#true} call #t~ret0 := abs_int(-3); {230#true} is VALID [2020-07-10 19:01:05,102 INFO L280 TraceCheckUtils]: 7: Hoare triple {230#true} ~i := #in~i; {241#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-10 19:01:05,103 INFO L280 TraceCheckUtils]: 8: Hoare triple {241#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume !(~i < 0); {242#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-10 19:01:05,104 INFO L280 TraceCheckUtils]: 9: Hoare triple {242#(not (= 0 (+ |abs_int_#in~i| 3)))} #res := ~i; {242#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-10 19:01:05,105 INFO L280 TraceCheckUtils]: 10: Hoare triple {242#(not (= 0 (+ |abs_int_#in~i| 3)))} assume true; {242#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-10 19:01:05,106 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {242#(not (= 0 (+ |abs_int_#in~i| 3)))} {230#true} #35#return; {231#false} is VALID [2020-07-10 19:01:05,106 INFO L280 TraceCheckUtils]: 12: Hoare triple {231#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {231#false} is VALID [2020-07-10 19:01:05,107 INFO L280 TraceCheckUtils]: 13: Hoare triple {231#false} ~p~0 := #t~ret0; {231#false} is VALID [2020-07-10 19:01:05,107 INFO L280 TraceCheckUtils]: 14: Hoare triple {231#false} havoc #t~ret0; {231#false} is VALID [2020-07-10 19:01:05,107 INFO L280 TraceCheckUtils]: 15: Hoare triple {231#false} assume !(~p~0 >= 0); {231#false} is VALID [2020-07-10 19:01:05,108 INFO L263 TraceCheckUtils]: 16: Hoare triple {231#false} call __blast_assert(); {231#false} is VALID [2020-07-10 19:01:05,108 INFO L280 TraceCheckUtils]: 17: Hoare triple {231#false} assume !false; {231#false} is VALID [2020-07-10 19:01:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:01:05,110 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:01:05,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1182906242] [2020-07-10 19:01:05,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:01:05,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 19:01:05,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324033745] [2020-07-10 19:01:05,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 19:01:05,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:01:05,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 19:01:05,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:05,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 19:01:05,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:01:05,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 19:01:05,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 19:01:05,137 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 5 states. [2020-07-10 19:01:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:05,244 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-10 19:01:05,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 19:01:05,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 19:01:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:01:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:01:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-10 19:01:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:01:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-10 19:01:05,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2020-07-10 19:01:05,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:05,276 INFO L225 Difference]: With dead ends: 19 [2020-07-10 19:01:05,277 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 19:01:05,278 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 19:01:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 19:01:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 19:01:05,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:01:05,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:05,280 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:05,280 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:05,281 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:01:05,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:01:05,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:05,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:05,281 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:05,282 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:05,282 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:01:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:01:05,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:05,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:05,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:01:05,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:01:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 19:01:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 19:01:05,284 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-07-10 19:01:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:01:05,284 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 19:01:05,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 19:01:05,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 19:01:05,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:01:05,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:05,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:01:05,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 19:01:05,517 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 19:01:05,517 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~p~0 |old(~p~0)|) [2020-07-10 19:01:05,517 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:01:05,518 INFO L271 CegarLoopResult]: At program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: true [2020-07-10 19:01:05,518 INFO L271 CegarLoopResult]: At program point __blast_assertEXIT(lines 5 8) the Hoare annotation is: true [2020-07-10 19:01:05,518 INFO L271 CegarLoopResult]: At program point __blast_assertFINAL(lines 5 8) the Hoare annotation is: true [2020-07-10 19:01:05,518 INFO L271 CegarLoopResult]: At program point __blast_assertENTRY(lines 5 8) the Hoare annotation is: true [2020-07-10 19:01:05,519 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:01:05,519 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 19:01:05,519 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 19:01:05,519 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 19:01:05,519 INFO L264 CegarLoopResult]: At program point L17(lines 17 23) the Hoare annotation is: (or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3))) [2020-07-10 19:01:05,520 INFO L264 CegarLoopResult]: At program point abs_intEXIT(lines 15 24) the Hoare annotation is: (and (or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|)) (or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))) [2020-07-10 19:01:05,520 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (not (= 0 (+ |abs_int_#in~i| 3))) (or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))) [2020-07-10 19:01:05,520 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3))) [2020-07-10 19:01:05,521 INFO L271 CegarLoopResult]: At program point abs_intENTRY(lines 15 24) the Hoare annotation is: true [2020-07-10 19:01:05,521 INFO L264 CegarLoopResult]: At program point abs_intFINAL(lines 15 24) the Hoare annotation is: (and (or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|)) (or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))) [2020-07-10 19:01:05,521 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (<= 1 ~p~0) [2020-07-10 19:01:05,522 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (= ~p~0 |old(~p~0)|) (<= 1 |firstFunction_#t~ret0|)) [2020-07-10 19:01:05,522 INFO L264 CegarLoopResult]: At program point firstFunctionENTRY(lines 26 30) the Hoare annotation is: (= ~p~0 |old(~p~0)|) [2020-07-10 19:01:05,522 INFO L264 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: (and (= ~p~0 |old(~p~0)|) (<= 1 |firstFunction_#t~ret0|)) [2020-07-10 19:01:05,522 INFO L264 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: false [2020-07-10 19:01:05,522 INFO L264 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: (and (<= 1 |firstFunction_#t~ret0|) (<= 1 ~p~0)) [2020-07-10 19:01:05,523 INFO L271 CegarLoopResult]: At program point L29-3(lines 26 30) the Hoare annotation is: true [2020-07-10 19:01:05,523 INFO L271 CegarLoopResult]: At program point firstFunctionEXIT(lines 26 30) the Hoare annotation is: true [2020-07-10 19:01:05,523 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 32 35) the Hoare annotation is: (= ~p~0 |old(~p~0)|) [2020-07-10 19:01:05,523 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 32 35) the Hoare annotation is: true [2020-07-10 19:01:05,524 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 32 35) the Hoare annotation is: true [2020-07-10 19:01:05,541 INFO L163 areAnnotationChecker]: CFG has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 19:01:05,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 07:01:05 BoogieIcfgContainer [2020-07-10 19:01:05,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 19:01:05,559 INFO L168 Benchmark]: Toolchain (without parser) took 2821.28 ms. Allocated memory was 135.3 MB in the beginning and 227.5 MB in the end (delta: 92.3 MB). Free memory was 100.1 MB in the beginning and 94.4 MB in the end (delta: 5.7 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:05,561 INFO L168 Benchmark]: CDTParser took 0.87 ms. Allocated memory is still 135.3 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 19:01:05,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.86 ms. Allocated memory is still 135.3 MB. Free memory was 99.9 MB in the beginning and 90.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:05,563 INFO L168 Benchmark]: Boogie Preprocessor took 24.35 ms. Allocated memory is still 135.3 MB. Free memory was 90.4 MB in the beginning and 89.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:05,564 INFO L168 Benchmark]: RCFGBuilder took 411.48 ms. Allocated memory was 135.3 MB in the beginning and 200.3 MB in the end (delta: 65.0 MB). Free memory was 89.1 MB in the beginning and 164.2 MB in the end (delta: -75.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:05,565 INFO L168 Benchmark]: TraceAbstraction took 2109.38 ms. Allocated memory was 200.3 MB in the beginning and 227.5 MB in the end (delta: 27.3 MB). Free memory was 163.4 MB in the beginning and 94.4 MB in the end (delta: 69.0 MB). Peak memory consumption was 96.3 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:05,569 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.87 ms. Allocated memory is still 135.3 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 268.86 ms. Allocated memory is still 135.3 MB. Free memory was 99.9 MB in the beginning and 90.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.35 ms. Allocated memory is still 135.3 MB. Free memory was 90.4 MB in the beginning and 89.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 411.48 ms. Allocated memory was 135.3 MB in the beginning and 200.3 MB in the end (delta: 65.0 MB). Free memory was 89.1 MB in the beginning and 164.2 MB in the end (delta: -75.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2109.38 ms. Allocated memory was 200.3 MB in the beginning and 227.5 MB in the end (delta: 27.3 MB). Free memory was 163.4 MB in the beginning and 94.4 MB in the end (delta: 69.0 MB). Peak memory consumption was 96.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for __blast_assert Derived contract for procedure __blast_assert: 1 - ProcedureContractResult [Line: 15]: Procedure Contract for abs_int Derived contract for procedure abs_int: (!(0 == \old(i) + 3) || 3 <= \result) && (\old(i) == i || 0 == i + 3) - ProcedureContractResult [Line: 26]: Procedure Contract for firstFunction Derived contract for procedure firstFunction: 1 - ProcedureContractResult [Line: 32]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.7s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 SDtfs, 26 SDslu, 73 SDs, 0 SdLazy, 63 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 32 PreInvPairs, 50 NumberOfFragments, 123 HoareAnnotationTreeSize, 32 FomulaSimplifications, 50 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 19 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...