/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -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-46f3038-m [2020-07-08 22:21:17,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 22:21:17,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 22:21:17,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 22:21:17,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 22:21:17,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 22:21:17,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 22:21:17,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 22:21:17,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 22:21:17,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 22:21:17,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 22:21:17,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 22:21:17,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 22:21:17,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 22:21:17,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 22:21:18,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 22:21:18,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 22:21:18,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 22:21:18,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 22:21:18,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 22:21:18,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 22:21:18,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 22:21:18,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 22:21:18,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 22:21:18,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 22:21:18,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 22:21:18,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 22:21:18,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 22:21:18,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 22:21:18,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 22:21:18,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 22:21:18,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 22:21:18,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 22:21:18,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 22:21:18,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 22:21:18,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 22:21:18,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 22:21:18,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 22:21:18,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 22:21:18,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 22:21:18,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 22:21:18,033 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 22:21:18,060 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 22:21:18,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 22:21:18,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 22:21:18,064 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 22:21:18,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 22:21:18,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 22:21:18,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 22:21:18,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 22:21:18,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 22:21:18,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 22:21:18,066 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 22:21:18,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 22:21:18,066 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 22:21:18,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 22:21:18,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 22:21:18,066 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 22:21:18,067 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 22:21:18,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 22:21:18,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:21:18,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 22:21:18,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 22:21:18,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 22:21:18,071 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 22:21:18,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 22:21:18,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 22:21:18,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 22:21:18,380 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 22:21:18,380 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 22:21:18,381 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-08 22:21:18,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf8438e5/9bcf3248b03c44788cd0228275f63719/FLAG6e5c03a7f [2020-07-08 22:21:18,874 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 22:21:18,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/oomInt.c_1.i [2020-07-08 22:21:18,880 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf8438e5/9bcf3248b03c44788cd0228275f63719/FLAG6e5c03a7f [2020-07-08 22:21:19,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf8438e5/9bcf3248b03c44788cd0228275f63719 [2020-07-08 22:21:19,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 22:21:19,329 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 22:21:19,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 22:21:19,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 22:21:19,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 22:21:19,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:21:19" (1/1) ... [2020-07-08 22:21:19,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e929f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:19, skipping insertion in model container [2020-07-08 22:21:19,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:21:19" (1/1) ... [2020-07-08 22:21:19,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 22:21:19,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 22:21:19,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:21:19,568 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 22:21:19,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:21:19,597 INFO L208 MainTranslator]: Completed translation [2020-07-08 22:21:19,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:19 WrapperNode [2020-07-08 22:21:19,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 22:21:19,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 22:21:19,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 22:21:19,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 22:21:19,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:19" (1/1) ... [2020-07-08 22:21:19,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:19" (1/1) ... [2020-07-08 22:21:19,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:19" (1/1) ... [2020-07-08 22:21:19,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:19" (1/1) ... [2020-07-08 22:21:19,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:19" (1/1) ... [2020-07-08 22:21:19,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:19" (1/1) ... [2020-07-08 22:21:19,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:19" (1/1) ... [2020-07-08 22:21:19,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 22:21:19,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 22:21:19,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 22:21:19,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 22:21:19,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:21:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 22:21:19,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 22:21:19,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-07-08 22:21:19,769 INFO L138 BoogieDeclarations]: Found implementation of procedure abs_int [2020-07-08 22:21:19,769 INFO L138 BoogieDeclarations]: Found implementation of procedure firstFunction [2020-07-08 22:21:19,769 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 22:21:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 22:21:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-07-08 22:21:19,770 INFO L130 BoogieDeclarations]: Found specification of procedure abs_int [2020-07-08 22:21:19,770 INFO L130 BoogieDeclarations]: Found specification of procedure firstFunction [2020-07-08 22:21:19,770 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 22:21:19,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 22:21:19,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 22:21:20,012 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 22:21:20,013 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 22:21:20,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:21:20 BoogieIcfgContainer [2020-07-08 22:21:20,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 22:21:20,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 22:21:20,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 22:21:20,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 22:21:20,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:21:19" (1/3) ... [2020-07-08 22:21:20,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eef59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:21:20, skipping insertion in model container [2020-07-08 22:21:20,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:21:19" (2/3) ... [2020-07-08 22:21:20,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eef59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:21:20, skipping insertion in model container [2020-07-08 22:21:20,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:21:20" (3/3) ... [2020-07-08 22:21:20,042 INFO L109 eAbstractionObserver]: Analyzing ICFG oomInt.c_1.i [2020-07-08 22:21:20,065 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 22:21:20,073 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 22:21:20,098 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 22:21:20,114 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 22:21:20,115 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 22:21:20,115 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 22:21:20,115 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 22:21:20,115 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 22:21:20,115 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 22:21:20,116 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 22:21:20,116 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 22:21:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-08 22:21:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 22:21:20,137 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:21:20,138 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:21:20,138 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:21:20,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:21:20,144 INFO L82 PathProgramCache]: Analyzing trace with hash -874370234, now seen corresponding path program 1 times [2020-07-08 22:21:20,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:21:20,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1117380827] [2020-07-08 22:21:20,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:21:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:20,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {31#true} is VALID [2020-07-08 22:21:20,363 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-08 22:21:20,364 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #31#return; {31#true} is VALID [2020-07-08 22:21:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:20,465 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-08 22:21:20,466 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-08 22:21:20,467 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-08 22:21:20,469 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-08 22:21:20,471 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-08 22:21:20,473 INFO L263 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {43#(= ~p~0 |old(~p~0)|)} is VALID [2020-07-08 22:21:20,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {31#true} is VALID [2020-07-08 22:21:20,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-08 22:21:20,474 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #31#return; {31#true} is VALID [2020-07-08 22:21:20,474 INFO L263 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret1 := main(); {31#true} is VALID [2020-07-08 22:21:20,475 INFO L263 TraceCheckUtils]: 5: Hoare triple {31#true} call firstFunction(); {31#true} is VALID [2020-07-08 22:21:20,475 INFO L263 TraceCheckUtils]: 6: Hoare triple {31#true} call #t~ret0 := abs_int(-3); {31#true} is VALID [2020-07-08 22:21:20,476 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-08 22:21:20,477 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-08 22:21:20,479 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-08 22:21:20,480 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-08 22:21:20,482 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-08 22:21:20,483 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-08 22:21:20,484 INFO L280 TraceCheckUtils]: 13: Hoare triple {41#(<= 1 |firstFunction_#t~ret0|)} ~p~0 := #t~ret0; {42#(<= 1 ~p~0)} is VALID [2020-07-08 22:21:20,485 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#(<= 1 ~p~0)} havoc #t~ret0; {42#(<= 1 ~p~0)} is VALID [2020-07-08 22:21:20,487 INFO L280 TraceCheckUtils]: 15: Hoare triple {42#(<= 1 ~p~0)} assume !(~p~0 >= 0); {32#false} is VALID [2020-07-08 22:21:20,488 INFO L263 TraceCheckUtils]: 16: Hoare triple {32#false} call __blast_assert(); {32#false} is VALID [2020-07-08 22:21:20,488 INFO L280 TraceCheckUtils]: 17: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-08 22:21:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:21:20,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1117380827] [2020-07-08 22:21:20,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:21:20,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 22:21:20,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029417995] [2020-07-08 22:21:20,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-08 22:21:20,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:21:20,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 22:21:20,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:20,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 22:21:20,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:21:20,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 22:21:20,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 22:21:20,561 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2020-07-08 22:21:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:21,027 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-07-08 22:21:21,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 22:21:21,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-08 22:21:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:21:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:21:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-08 22:21:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:21:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-08 22:21:21,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2020-07-08 22:21:21,111 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-08 22:21:21,122 INFO L225 Difference]: With dead ends: 49 [2020-07-08 22:21:21,122 INFO L226 Difference]: Without dead ends: 19 [2020-07-08 22:21:21,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-08 22:21:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-08 22:21:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-08 22:21:21,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:21:21,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-08 22:21:21,183 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-08 22:21:21,183 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-08 22:21:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:21,187 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-08 22:21:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-08 22:21:21,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:21,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:21:21,188 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-08 22:21:21,188 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-08 22:21:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:21,191 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-08 22:21:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-08 22:21:21,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:21,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:21:21,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:21:21,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:21:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 22:21:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2020-07-08 22:21:21,196 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 18 [2020-07-08 22:21:21,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:21:21,197 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2020-07-08 22:21:21,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 22:21:21,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 18 transitions. [2020-07-08 22:21:21,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-08 22:21:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 22:21:21,221 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:21:21,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:21:21,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 22:21:21,222 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:21:21,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:21:21,222 INFO L82 PathProgramCache]: Analyzing trace with hash -587338874, now seen corresponding path program 1 times [2020-07-08 22:21:21,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:21:21,223 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1689307382] [2020-07-08 22:21:21,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:21:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:21,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {230#true} is VALID [2020-07-08 22:21:21,256 INFO L280 TraceCheckUtils]: 1: Hoare triple {230#true} assume true; {230#true} is VALID [2020-07-08 22:21:21,256 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {230#true} {230#true} #31#return; {230#true} is VALID [2020-07-08 22:21:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:21:21,345 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-08 22:21:21,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {241#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume !(~i < 0); {242#(and (not (= 0 (+ abs_int_~i 3))) (= |abs_int_#in~i| abs_int_~i))} is VALID [2020-07-08 22:21:21,348 INFO L280 TraceCheckUtils]: 2: Hoare triple {242#(and (not (= 0 (+ abs_int_~i 3))) (= |abs_int_#in~i| abs_int_~i))} #res := ~i; {243#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-08 22:21:21,349 INFO L280 TraceCheckUtils]: 3: Hoare triple {243#(not (= 0 (+ |abs_int_#in~i| 3)))} assume true; {243#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-08 22:21:21,350 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {243#(not (= 0 (+ |abs_int_#in~i| 3)))} {230#true} #35#return; {231#false} is VALID [2020-07-08 22:21:21,352 INFO L263 TraceCheckUtils]: 0: Hoare triple {230#true} call ULTIMATE.init(); {240#(= ~p~0 |old(~p~0)|)} is VALID [2020-07-08 22:21:21,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {230#true} is VALID [2020-07-08 22:21:21,352 INFO L280 TraceCheckUtils]: 2: Hoare triple {230#true} assume true; {230#true} is VALID [2020-07-08 22:21:21,353 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {230#true} {230#true} #31#return; {230#true} is VALID [2020-07-08 22:21:21,353 INFO L263 TraceCheckUtils]: 4: Hoare triple {230#true} call #t~ret1 := main(); {230#true} is VALID [2020-07-08 22:21:21,353 INFO L263 TraceCheckUtils]: 5: Hoare triple {230#true} call firstFunction(); {230#true} is VALID [2020-07-08 22:21:21,354 INFO L263 TraceCheckUtils]: 6: Hoare triple {230#true} call #t~ret0 := abs_int(-3); {230#true} is VALID [2020-07-08 22:21:21,355 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-08 22:21:21,356 INFO L280 TraceCheckUtils]: 8: Hoare triple {241#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume !(~i < 0); {242#(and (not (= 0 (+ abs_int_~i 3))) (= |abs_int_#in~i| abs_int_~i))} is VALID [2020-07-08 22:21:21,357 INFO L280 TraceCheckUtils]: 9: Hoare triple {242#(and (not (= 0 (+ abs_int_~i 3))) (= |abs_int_#in~i| abs_int_~i))} #res := ~i; {243#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-08 22:21:21,358 INFO L280 TraceCheckUtils]: 10: Hoare triple {243#(not (= 0 (+ |abs_int_#in~i| 3)))} assume true; {243#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-08 22:21:21,360 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {243#(not (= 0 (+ |abs_int_#in~i| 3)))} {230#true} #35#return; {231#false} is VALID [2020-07-08 22:21:21,360 INFO L280 TraceCheckUtils]: 12: Hoare triple {231#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {231#false} is VALID [2020-07-08 22:21:21,361 INFO L280 TraceCheckUtils]: 13: Hoare triple {231#false} ~p~0 := #t~ret0; {231#false} is VALID [2020-07-08 22:21:21,361 INFO L280 TraceCheckUtils]: 14: Hoare triple {231#false} havoc #t~ret0; {231#false} is VALID [2020-07-08 22:21:21,362 INFO L280 TraceCheckUtils]: 15: Hoare triple {231#false} assume !(~p~0 >= 0); {231#false} is VALID [2020-07-08 22:21:21,363 INFO L263 TraceCheckUtils]: 16: Hoare triple {231#false} call __blast_assert(); {231#false} is VALID [2020-07-08 22:21:21,363 INFO L280 TraceCheckUtils]: 17: Hoare triple {231#false} assume !false; {231#false} is VALID [2020-07-08 22:21:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:21:21,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1689307382] [2020-07-08 22:21:21,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:21:21,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 22:21:21,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41246520] [2020-07-08 22:21:21,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 22:21:21,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:21:21,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 22:21:21,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:21,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 22:21:21,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:21:21,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 22:21:21,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 22:21:21,399 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 6 states. [2020-07-08 22:21:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:21,504 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-08 22:21:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 22:21:21,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 22:21:21,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:21:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 22:21:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-08 22:21:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 22:21:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-08 22:21:21,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2020-07-08 22:21:21,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:21,534 INFO L225 Difference]: With dead ends: 19 [2020-07-08 22:21:21,534 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 22:21:21,535 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-08 22:21:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 22:21:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 22:21:21,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:21:21,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:21,536 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:21,536 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:21,537 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:21:21,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:21:21,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:21,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:21:21,538 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:21,538 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:21,538 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:21:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:21:21,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:21,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:21:21,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:21:21,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:21:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 22:21:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 22:21:21,540 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-07-08 22:21:21,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:21:21,540 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 22:21:21,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 22:21:21,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 22:21:21,541 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-08 22:21:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:21:21,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:21,541 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 22:21:21,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 22:21:21,780 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:21:21,781 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~p~0 |old(~p~0)|) [2020-07-08 22:21:21,781 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:21:21,781 INFO L271 CegarLoopResult]: At program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: true [2020-07-08 22:21:21,781 INFO L271 CegarLoopResult]: At program point __blast_assertEXIT(lines 5 8) the Hoare annotation is: true [2020-07-08 22:21:21,782 INFO L271 CegarLoopResult]: At program point __blast_assertFINAL(lines 5 8) the Hoare annotation is: true [2020-07-08 22:21:21,782 INFO L271 CegarLoopResult]: At program point __blast_assertENTRY(lines 5 8) the Hoare annotation is: true [2020-07-08 22:21:21,782 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:21:21,782 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 22:21:21,782 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 22:21:21,782 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:21:21,783 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-08 22:21:21,783 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-08 22:21:21,783 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (not (= 0 (+ abs_int_~i 3))) (= |abs_int_#in~i| abs_int_~i)) [2020-07-08 22:21:21,784 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-08 22:21:21,784 INFO L271 CegarLoopResult]: At program point abs_intENTRY(lines 15 24) the Hoare annotation is: true [2020-07-08 22:21:21,784 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-08 22:21:21,784 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (<= 1 ~p~0) [2020-07-08 22:21:21,784 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-08 22:21:21,785 INFO L264 CegarLoopResult]: At program point firstFunctionENTRY(lines 26 30) the Hoare annotation is: (= ~p~0 |old(~p~0)|) [2020-07-08 22:21:21,785 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-08 22:21:21,785 INFO L264 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: false [2020-07-08 22:21:21,785 INFO L264 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: (and (<= 1 |firstFunction_#t~ret0|) (<= 1 ~p~0)) [2020-07-08 22:21:21,786 INFO L271 CegarLoopResult]: At program point L29-3(lines 26 30) the Hoare annotation is: true [2020-07-08 22:21:21,786 INFO L271 CegarLoopResult]: At program point firstFunctionEXIT(lines 26 30) the Hoare annotation is: true [2020-07-08 22:21:21,786 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 32 35) the Hoare annotation is: (= ~p~0 |old(~p~0)|) [2020-07-08 22:21:21,786 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 32 35) the Hoare annotation is: true [2020-07-08 22:21:21,786 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 32 35) the Hoare annotation is: true [2020-07-08 22:21:21,803 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-08 22:21:21,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:21:21 BoogieIcfgContainer [2020-07-08 22:21:21,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 22:21:21,819 INFO L168 Benchmark]: Toolchain (without parser) took 2489.23 ms. Allocated memory was 138.4 MB in the beginning and 236.5 MB in the end (delta: 98.0 MB). Free memory was 103.7 MB in the beginning and 89.8 MB in the end (delta: 13.9 MB). Peak memory consumption was 112.0 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:21,820 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-08 22:21:21,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.62 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 93.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:21,822 INFO L168 Benchmark]: Boogie Preprocessor took 26.81 ms. Allocated memory is still 138.4 MB. Free memory was 93.9 MB in the beginning and 92.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:21,823 INFO L168 Benchmark]: RCFGBuilder took 392.71 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.5 MB in the beginning and 166.8 MB in the end (delta: -74.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:21,824 INFO L168 Benchmark]: TraceAbstraction took 1796.09 ms. Allocated memory was 202.4 MB in the beginning and 236.5 MB in the end (delta: 34.1 MB). Free memory was 166.2 MB in the beginning and 89.8 MB in the end (delta: 76.4 MB). Peak memory consumption was 110.5 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:21,828 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.79 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 268.62 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 93.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.81 ms. Allocated memory is still 138.4 MB. Free memory was 93.9 MB in the beginning and 92.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.71 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.5 MB in the beginning and 166.8 MB in the end (delta: -74.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1796.09 ms. Allocated memory was 202.4 MB in the beginning and 236.5 MB in the end (delta: 34.1 MB). Free memory was 166.2 MB in the beginning and 89.8 MB in the end (delta: 76.4 MB). Peak memory consumption was 110.5 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.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 SDtfs, 28 SDslu, 73 SDs, 0 SdLazy, 64 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 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, 117 HoareAnnotationTreeSize, 32 FomulaSimplifications, 15 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 69 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 1819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...