/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.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 16:23:22,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 16:23:22,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 16:23:22,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 16:23:22,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 16:23:22,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 16:23:22,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 16:23:22,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 16:23:22,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 16:23:22,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 16:23:22,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 16:23:22,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 16:23:22,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 16:23:22,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 16:23:22,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 16:23:22,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 16:23:22,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 16:23:22,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 16:23:22,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 16:23:22,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 16:23:22,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 16:23:22,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 16:23:22,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 16:23:22,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 16:23:22,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 16:23:22,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 16:23:22,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 16:23:22,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 16:23:22,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 16:23:22,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 16:23:22,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 16:23:22,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 16:23:22,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 16:23:22,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 16:23:22,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 16:23:22,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 16:23:22,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 16:23:22,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 16:23:22,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 16:23:22,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 16:23:22,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 16:23:22,685 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 16:23:22,703 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 16:23:22,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 16:23:22,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 16:23:22,706 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 16:23:22,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 16:23:22,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 16:23:22,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 16:23:22,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 16:23:22,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 16:23:22,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 16:23:22,708 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 16:23:22,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 16:23:22,709 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 16:23:22,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 16:23:22,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 16:23:22,710 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 16:23:22,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 16:23:22,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 16:23:22,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 16:23:22,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 16:23:22,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 16:23:22,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 16:23:22,711 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 16:23:23,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 16:23:23,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 16:23:23,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 16:23:23,027 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 16:23:23,027 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 16:23:23,028 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/oomInt.i [2020-07-08 16:23:23,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b38a8f31/01892cbdd74f4cc99e63c9fba36142dd/FLAG93c8704dc [2020-07-08 16:23:23,539 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 16:23:23,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/oomInt.i [2020-07-08 16:23:23,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b38a8f31/01892cbdd74f4cc99e63c9fba36142dd/FLAG93c8704dc [2020-07-08 16:23:23,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b38a8f31/01892cbdd74f4cc99e63c9fba36142dd [2020-07-08 16:23:23,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 16:23:23,953 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 16:23:23,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 16:23:23,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 16:23:23,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 16:23:23,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:23:23" (1/1) ... [2020-07-08 16:23:23,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c7fc675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:23, skipping insertion in model container [2020-07-08 16:23:23,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:23:23" (1/1) ... [2020-07-08 16:23:23,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 16:23:23,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 16:23:24,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:23:24,188 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 16:23:24,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:23:24,223 INFO L208 MainTranslator]: Completed translation [2020-07-08 16:23:24,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:24 WrapperNode [2020-07-08 16:23:24,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 16:23:24,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 16:23:24,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 16:23:24,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 16:23:24,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:24" (1/1) ... [2020-07-08 16:23:24,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:24" (1/1) ... [2020-07-08 16:23:24,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:24" (1/1) ... [2020-07-08 16:23:24,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:24" (1/1) ... [2020-07-08 16:23:24,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:24" (1/1) ... [2020-07-08 16:23:24,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:24" (1/1) ... [2020-07-08 16:23:24,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:24" (1/1) ... [2020-07-08 16:23:24,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 16:23:24,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 16:23:24,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 16:23:24,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 16:23:24,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:24" (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 16:23:24,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 16:23:24,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 16:23:24,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 16:23:24,429 INFO L138 BoogieDeclarations]: Found implementation of procedure abs_int [2020-07-08 16:23:24,430 INFO L138 BoogieDeclarations]: Found implementation of procedure firstFunction [2020-07-08 16:23:24,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 16:23:24,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 16:23:24,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 16:23:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure abs_int [2020-07-08 16:23:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure firstFunction [2020-07-08 16:23:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 16:23:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 16:23:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 16:23:24,687 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 16:23:24,687 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 16:23:24,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:23:24 BoogieIcfgContainer [2020-07-08 16:23:24,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 16:23:24,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 16:23:24,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 16:23:24,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 16:23:24,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 04:23:23" (1/3) ... [2020-07-08 16:23:24,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fd907e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:23:24, skipping insertion in model container [2020-07-08 16:23:24,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:23:24" (2/3) ... [2020-07-08 16:23:24,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fd907e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:23:24, skipping insertion in model container [2020-07-08 16:23:24,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:23:24" (3/3) ... [2020-07-08 16:23:24,705 INFO L109 eAbstractionObserver]: Analyzing ICFG oomInt.i [2020-07-08 16:23:24,721 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 16:23:24,732 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 16:23:24,753 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 16:23:24,803 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 16:23:24,804 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 16:23:24,804 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 16:23:24,804 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 16:23:24,804 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 16:23:24,804 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 16:23:24,805 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 16:23:24,805 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 16:23:24,844 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-08 16:23:24,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 16:23:24,860 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:23:24,862 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:23:24,862 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:23:24,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:23:24,869 INFO L82 PathProgramCache]: Analyzing trace with hash 531924990, now seen corresponding path program 1 times [2020-07-08 16:23:24,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:23:24,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1238369853] [2020-07-08 16:23:24,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:23:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:23:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:23:25,201 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {32#true} is VALID [2020-07-08 16:23:25,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-08 16:23:25,202 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #33#return; {32#true} is VALID [2020-07-08 16:23:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:23:25,312 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} ~i := #in~i; {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-08 16:23:25,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume ~i < 0; {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-08 16:23:25,315 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} #res := -~i; {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} is VALID [2020-07-08 16:23:25,317 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} assume true; {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} is VALID [2020-07-08 16:23:25,320 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} {32#true} #37#return; {42#(<= 1 |firstFunction_#t~ret0|)} is VALID [2020-07-08 16:23:25,322 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {46#(= ~p~0 |old(~p~0)|)} is VALID [2020-07-08 16:23:25,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {32#true} is VALID [2020-07-08 16:23:25,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-08 16:23:25,324 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #33#return; {32#true} is VALID [2020-07-08 16:23:25,324 INFO L263 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret1 := main(); {32#true} is VALID [2020-07-08 16:23:25,325 INFO L263 TraceCheckUtils]: 5: Hoare triple {32#true} call firstFunction(); {32#true} is VALID [2020-07-08 16:23:25,325 INFO L263 TraceCheckUtils]: 6: Hoare triple {32#true} call #t~ret0 := abs_int(-3); {32#true} is VALID [2020-07-08 16:23:25,327 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} ~i := #in~i; {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-08 16:23:25,328 INFO L280 TraceCheckUtils]: 8: Hoare triple {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume ~i < 0; {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-08 16:23:25,330 INFO L280 TraceCheckUtils]: 9: Hoare triple {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} #res := -~i; {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} is VALID [2020-07-08 16:23:25,331 INFO L280 TraceCheckUtils]: 10: Hoare triple {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} assume true; {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} is VALID [2020-07-08 16:23:25,334 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} {32#true} #37#return; {42#(<= 1 |firstFunction_#t~ret0|)} is VALID [2020-07-08 16:23:25,335 INFO L280 TraceCheckUtils]: 12: Hoare triple {42#(<= 1 |firstFunction_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {42#(<= 1 |firstFunction_#t~ret0|)} is VALID [2020-07-08 16:23:25,337 INFO L280 TraceCheckUtils]: 13: Hoare triple {42#(<= 1 |firstFunction_#t~ret0|)} ~p~0 := #t~ret0; {43#(<= 1 ~p~0)} is VALID [2020-07-08 16:23:25,338 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#(<= 1 ~p~0)} havoc #t~ret0; {43#(<= 1 ~p~0)} is VALID [2020-07-08 16:23:25,340 INFO L263 TraceCheckUtils]: 15: Hoare triple {43#(<= 1 ~p~0)} call __VERIFIER_assert((if ~p~0 >= 0 then 1 else 0)); {44#(not (= 0 |__VERIFIER_assert_#in~i|))} is VALID [2020-07-08 16:23:25,342 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#(not (= 0 |__VERIFIER_assert_#in~i|))} ~i := #in~i; {45#(not (= 0 __VERIFIER_assert_~i))} is VALID [2020-07-08 16:23:25,344 INFO L280 TraceCheckUtils]: 17: Hoare triple {45#(not (= 0 __VERIFIER_assert_~i))} assume 0 == ~i; {33#false} is VALID [2020-07-08 16:23:25,344 INFO L280 TraceCheckUtils]: 18: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-08 16:23:25,348 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 16:23:25,349 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:23:25,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1238369853] [2020-07-08 16:23:25,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:23:25,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 16:23:25,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953962773] [2020-07-08 16:23:25,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-07-08 16:23:25,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:23:25,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 16:23:25,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:23:25,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 16:23:25,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:23:25,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 16:23:25,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-08 16:23:25,429 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 9 states. [2020-07-08 16:23:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:23:26,206 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-07-08 16:23:26,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 16:23:26,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-07-08 16:23:26,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:23:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 16:23:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2020-07-08 16:23:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 16:23:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2020-07-08 16:23:26,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2020-07-08 16:23:26,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:23:26,322 INFO L225 Difference]: With dead ends: 55 [2020-07-08 16:23:26,323 INFO L226 Difference]: Without dead ends: 20 [2020-07-08 16:23:26,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-08 16:23:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-08 16:23:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-08 16:23:26,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:23:26,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-08 16:23:26,393 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-08 16:23:26,393 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-08 16:23:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:23:26,397 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2020-07-08 16:23:26,397 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2020-07-08 16:23:26,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:23:26,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:23:26,398 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-08 16:23:26,398 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-08 16:23:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:23:26,402 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2020-07-08 16:23:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2020-07-08 16:23:26,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:23:26,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:23:26,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:23:26,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:23:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 16:23:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2020-07-08 16:23:26,407 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 19 [2020-07-08 16:23:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:23:26,408 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2020-07-08 16:23:26,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 16:23:26,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 19 transitions. [2020-07-08 16:23:26,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:23:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2020-07-08 16:23:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 16:23:26,436 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:23:26,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:23:26,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 16:23:26,437 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:23:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:23:26,438 INFO L82 PathProgramCache]: Analyzing trace with hash 839962558, now seen corresponding path program 1 times [2020-07-08 16:23:26,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:23:26,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [564030238] [2020-07-08 16:23:26,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:23:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:23:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:23:26,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {265#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {255#true} is VALID [2020-07-08 16:23:26,475 INFO L280 TraceCheckUtils]: 1: Hoare triple {255#true} assume true; {255#true} is VALID [2020-07-08 16:23:26,476 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {255#true} {255#true} #33#return; {255#true} is VALID [2020-07-08 16:23:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:23:26,562 INFO L280 TraceCheckUtils]: 0: Hoare triple {255#true} ~i := #in~i; {266#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-08 16:23:26,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {266#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume !(~i < 0); {267#(and (not (= 0 (+ abs_int_~i 3))) (= |abs_int_#in~i| abs_int_~i))} is VALID [2020-07-08 16:23:26,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {267#(and (not (= 0 (+ abs_int_~i 3))) (= |abs_int_#in~i| abs_int_~i))} #res := ~i; {268#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-08 16:23:26,567 INFO L280 TraceCheckUtils]: 3: Hoare triple {268#(not (= 0 (+ |abs_int_#in~i| 3)))} assume true; {268#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-08 16:23:26,569 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {268#(not (= 0 (+ |abs_int_#in~i| 3)))} {255#true} #37#return; {256#false} is VALID [2020-07-08 16:23:26,571 INFO L263 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {265#(= ~p~0 |old(~p~0)|)} is VALID [2020-07-08 16:23:26,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {265#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {255#true} is VALID [2020-07-08 16:23:26,572 INFO L280 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2020-07-08 16:23:26,572 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {255#true} {255#true} #33#return; {255#true} is VALID [2020-07-08 16:23:26,573 INFO L263 TraceCheckUtils]: 4: Hoare triple {255#true} call #t~ret1 := main(); {255#true} is VALID [2020-07-08 16:23:26,573 INFO L263 TraceCheckUtils]: 5: Hoare triple {255#true} call firstFunction(); {255#true} is VALID [2020-07-08 16:23:26,573 INFO L263 TraceCheckUtils]: 6: Hoare triple {255#true} call #t~ret0 := abs_int(-3); {255#true} is VALID [2020-07-08 16:23:26,575 INFO L280 TraceCheckUtils]: 7: Hoare triple {255#true} ~i := #in~i; {266#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-08 16:23:26,577 INFO L280 TraceCheckUtils]: 8: Hoare triple {266#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume !(~i < 0); {267#(and (not (= 0 (+ abs_int_~i 3))) (= |abs_int_#in~i| abs_int_~i))} is VALID [2020-07-08 16:23:26,578 INFO L280 TraceCheckUtils]: 9: Hoare triple {267#(and (not (= 0 (+ abs_int_~i 3))) (= |abs_int_#in~i| abs_int_~i))} #res := ~i; {268#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-08 16:23:26,579 INFO L280 TraceCheckUtils]: 10: Hoare triple {268#(not (= 0 (+ |abs_int_#in~i| 3)))} assume true; {268#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-08 16:23:26,581 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {268#(not (= 0 (+ |abs_int_#in~i| 3)))} {255#true} #37#return; {256#false} is VALID [2020-07-08 16:23:26,582 INFO L280 TraceCheckUtils]: 12: Hoare triple {256#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {256#false} is VALID [2020-07-08 16:23:26,582 INFO L280 TraceCheckUtils]: 13: Hoare triple {256#false} ~p~0 := #t~ret0; {256#false} is VALID [2020-07-08 16:23:26,583 INFO L280 TraceCheckUtils]: 14: Hoare triple {256#false} havoc #t~ret0; {256#false} is VALID [2020-07-08 16:23:26,583 INFO L263 TraceCheckUtils]: 15: Hoare triple {256#false} call __VERIFIER_assert((if ~p~0 >= 0 then 1 else 0)); {256#false} is VALID [2020-07-08 16:23:26,583 INFO L280 TraceCheckUtils]: 16: Hoare triple {256#false} ~i := #in~i; {256#false} is VALID [2020-07-08 16:23:26,584 INFO L280 TraceCheckUtils]: 17: Hoare triple {256#false} assume 0 == ~i; {256#false} is VALID [2020-07-08 16:23:26,584 INFO L280 TraceCheckUtils]: 18: Hoare triple {256#false} assume !false; {256#false} is VALID [2020-07-08 16:23:26,586 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 16:23:26,586 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:23:26,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [564030238] [2020-07-08 16:23:26,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:23:26,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 16:23:26,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416851426] [2020-07-08 16:23:26,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-08 16:23:26,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:23:26,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 16:23:26,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:23:26,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 16:23:26,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:23:26,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 16:23:26,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 16:23:26,620 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand 6 states. [2020-07-08 16:23:26,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:23:26,743 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2020-07-08 16:23:26,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 16:23:26,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-08 16:23:26,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:23:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 16:23:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-08 16:23:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 16:23:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-08 16:23:26,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2020-07-08 16:23:26,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:23:26,778 INFO L225 Difference]: With dead ends: 20 [2020-07-08 16:23:26,778 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 16:23:26,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-08 16:23:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 16:23:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 16:23:26,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:23:26,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 16:23:26,789 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 16:23:26,789 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 16:23:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:23:26,790 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 16:23:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 16:23:26,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:23:26,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:23:26,791 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 16:23:26,791 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 16:23:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:23:26,791 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 16:23:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 16:23:26,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:23:26,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:23:26,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:23:26,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:23:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 16:23:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 16:23:26,793 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-07-08 16:23:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:23:26,793 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 16:23:26,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 16:23:26,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 16:23:26,793 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 16:23:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 16:23:26,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:23:26,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 16:23:26,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 16:23:27,116 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 16:23:27,116 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~p~0 |old(~p~0)|) [2020-07-08 16:23:27,116 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 16:23:27,116 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 16:23:27,117 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 16:23:27,117 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 16:23:27,117 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 16:23:27,117 INFO L264 CegarLoopResult]: At program point abs_intEXIT(lines 16 25) 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 16:23:27,118 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (not (= 0 (+ abs_int_~i 3))) (= |abs_int_#in~i| abs_int_~i)) [2020-07-08 16:23:27,118 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3))) [2020-07-08 16:23:27,118 INFO L271 CegarLoopResult]: At program point abs_intENTRY(lines 16 25) the Hoare annotation is: true [2020-07-08 16:23:27,118 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3))) [2020-07-08 16:23:27,118 INFO L264 CegarLoopResult]: At program point abs_intFINAL(lines 16 25) 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 16:23:27,119 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (<= 1 ~p~0) [2020-07-08 16:23:27,119 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (= ~p~0 |old(~p~0)|) (<= 1 |firstFunction_#t~ret0|)) [2020-07-08 16:23:27,119 INFO L264 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (and (= ~p~0 |old(~p~0)|) (<= 1 |firstFunction_#t~ret0|)) [2020-07-08 16:23:27,119 INFO L264 CegarLoopResult]: At program point firstFunctionENTRY(lines 27 31) the Hoare annotation is: (= ~p~0 |old(~p~0)|) [2020-07-08 16:23:27,119 INFO L264 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: (and (<= 1 |firstFunction_#t~ret0|) (<= 1 ~p~0)) [2020-07-08 16:23:27,120 INFO L271 CegarLoopResult]: At program point firstFunctionFINAL(lines 27 31) the Hoare annotation is: true [2020-07-08 16:23:27,120 INFO L271 CegarLoopResult]: At program point firstFunctionEXIT(lines 27 31) the Hoare annotation is: true [2020-07-08 16:23:27,120 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 33 36) the Hoare annotation is: (= ~p~0 |old(~p~0)|) [2020-07-08 16:23:27,120 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 33 36) the Hoare annotation is: true [2020-07-08 16:23:27,120 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 33 36) the Hoare annotation is: true [2020-07-08 16:23:27,121 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 12) the Hoare annotation is: true [2020-07-08 16:23:27,121 INFO L264 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (or (not (<= 1 ~p~0)) (= 0 |__VERIFIER_assert_#in~i|)) [2020-07-08 16:23:27,121 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 12) the Hoare annotation is: (or (not (<= 1 ~p~0)) (not (= 0 __VERIFIER_assert_~i)) (= 0 |__VERIFIER_assert_#in~i|)) [2020-07-08 16:23:27,121 INFO L264 CegarLoopResult]: At program point L8(lines 8 11) the Hoare annotation is: (or (not (<= 1 ~p~0)) (not (= 0 __VERIFIER_assert_~i)) (= 0 |__VERIFIER_assert_#in~i|)) [2020-07-08 16:23:27,122 INFO L264 CegarLoopResult]: At program point L8-2(lines 6 12) the Hoare annotation is: (or (not (<= 1 ~p~0)) (not (= 0 __VERIFIER_assert_~i)) (= 0 |__VERIFIER_assert_#in~i|)) [2020-07-08 16:23:27,122 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (or (not (<= 1 ~p~0)) (= 0 |__VERIFIER_assert_#in~i|)) [2020-07-08 16:23:27,139 INFO L163 areAnnotationChecker]: CFG has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 16:23:27,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 04:23:27 BoogieIcfgContainer [2020-07-08 16:23:27,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 16:23:27,157 INFO L168 Benchmark]: Toolchain (without parser) took 3203.49 ms. Allocated memory was 145.8 MB in the beginning and 245.4 MB in the end (delta: 99.6 MB). Free memory was 103.2 MB in the beginning and 168.2 MB in the end (delta: -65.0 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. [2020-07-08 16:23:27,158 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.8 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-08 16:23:27,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.72 ms. Allocated memory is still 145.8 MB. Free memory was 102.8 MB in the beginning and 93.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-08 16:23:27,160 INFO L168 Benchmark]: Boogie Preprocessor took 34.00 ms. Allocated memory is still 145.8 MB. Free memory was 93.4 MB in the beginning and 92.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2020-07-08 16:23:27,161 INFO L168 Benchmark]: RCFGBuilder took 436.12 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 92.0 MB in the beginning and 167.4 MB in the end (delta: -75.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 16:23:27,163 INFO L168 Benchmark]: TraceAbstraction took 2456.69 ms. Allocated memory was 203.4 MB in the beginning and 245.4 MB in the end (delta: 41.9 MB). Free memory was 167.4 MB in the beginning and 168.2 MB in the end (delta: -856.2 kB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. [2020-07-08 16:23:27,167 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.24 ms. Allocated memory is still 145.8 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 269.72 ms. Allocated memory is still 145.8 MB. Free memory was 102.8 MB in the beginning and 93.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 34.00 ms. Allocated memory is still 145.8 MB. Free memory was 93.4 MB in the beginning and 92.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 436.12 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 92.0 MB in the beginning and 167.4 MB in the end (delta: -75.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2456.69 ms. Allocated memory was 203.4 MB in the beginning and 245.4 MB in the end (delta: 41.9 MB). Free memory was 167.4 MB in the beginning and 168.2 MB in the end (delta: -856.2 kB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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: 16]: 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: 27]: Procedure Contract for firstFunction Derived contract for procedure firstFunction: 1 - ProcedureContractResult [Line: 33]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (!(1 <= p) || !(0 == i)) || 0 == \old(i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.9s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 29 SDtfs, 44 SDslu, 102 SDs, 0 SdLazy, 110 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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, 29 LocationsWithAnnotation, 35 PreInvPairs, 57 NumberOfFragments, 165 HoareAnnotationTreeSize, 35 FomulaSimplifications, 15 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.2s 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...