/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:51:58,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:51:58,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:51:58,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:51:58,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:51:58,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:51:58,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:51:58,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:51:58,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:51:58,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:51:58,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:51:58,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:51:58,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:51:58,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:51:58,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:51:58,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:51:58,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:51:58,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:51:58,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:51:58,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:51:58,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:51:58,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:51:58,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:51:58,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:51:58,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:51:58,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:51:58,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:51:58,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:51:58,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:51:58,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:51:58,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:51:58,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:51:58,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:51:58,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:51:58,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:51:58,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:51:58,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:51:58,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:51:58,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:51:58,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:51:58,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:51:58,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:51:58,873 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:51:58,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:51:58,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:51:58,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:51:58,874 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:51:58,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:51:58,875 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:51:58,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:51:58,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:51:58,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:51:58,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:51:58,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:51:58,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:51:58,876 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:51:58,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:51:58,876 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:51:58,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:51:58,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:51:58,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:51:58,877 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:51:58,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:51:58,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:58,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:51:58,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:51:58,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:51:58,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:51:58,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:51:58,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:51:58,879 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:51:58,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:51:59,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:51:59,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:51:59,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:51:59,149 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:51:59,150 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:51:59,150 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+lhb-reducer.c [2020-07-17 22:51:59,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fef4fc33/e9e3cc317f314ff4b6e8c6723ac24e09/FLAGc31337ac7 [2020-07-17 22:51:59,664 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:51:59,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+lhb-reducer.c [2020-07-17 22:51:59,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fef4fc33/e9e3cc317f314ff4b6e8c6723ac24e09/FLAGc31337ac7 [2020-07-17 22:52:00,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fef4fc33/e9e3cc317f314ff4b6e8c6723ac24e09 [2020-07-17 22:52:00,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:52:00,040 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:52:00,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:00,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:52:00,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:52:00,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:00" (1/1) ... [2020-07-17 22:52:00,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc01980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:00, skipping insertion in model container [2020-07-17 22:52:00,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:00" (1/1) ... [2020-07-17 22:52:00,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:52:00,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:52:00,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:00,238 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:52:00,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:00,274 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:52:00,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:00 WrapperNode [2020-07-17 22:52:00,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:00,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:52:00,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:52:00,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:52:00,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:00" (1/1) ... [2020-07-17 22:52:00,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:00" (1/1) ... [2020-07-17 22:52:00,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:00" (1/1) ... [2020-07-17 22:52:00,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:00" (1/1) ... [2020-07-17 22:52:00,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:00" (1/1) ... [2020-07-17 22:52:00,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:00" (1/1) ... [2020-07-17 22:52:00,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:00" (1/1) ... [2020-07-17 22:52:00,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:52:00,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:52:00,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:52:00,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:52:00,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:00" (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-17 22:52:00,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:52:00,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:52:00,449 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:52:00,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:52:00,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:52:00,450 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:52:00,450 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:52:00,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:52:00,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:52:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:52:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:52:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:52:00,719 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:52:00,719 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:52:00,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:00 BoogieIcfgContainer [2020-07-17 22:52:00,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:52:00,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:52:00,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:52:00,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:52:00,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:52:00" (1/3) ... [2020-07-17 22:52:00,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc64aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:00, skipping insertion in model container [2020-07-17 22:52:00,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:00" (2/3) ... [2020-07-17 22:52:00,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc64aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:00, skipping insertion in model container [2020-07-17 22:52:00,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:00" (3/3) ... [2020-07-17 22:52:00,733 INFO L109 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.v+lhb-reducer.c [2020-07-17 22:52:00,747 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:52:00,754 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:52:00,769 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:52:00,794 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:52:00,794 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:52:00,794 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:52:00,794 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:52:00,795 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:52:00,795 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:52:00,795 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:52:00,795 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:52:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-07-17 22:52:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:52:00,821 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:00,822 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:00,822 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:00,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:00,828 INFO L82 PathProgramCache]: Analyzing trace with hash 489049782, now seen corresponding path program 1 times [2020-07-17 22:52:00,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:00,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694841153] [2020-07-17 22:52:00,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:01,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {21#true} is VALID [2020-07-17 22:52:01,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-17 22:52:01,138 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #41#return; {21#true} is VALID [2020-07-17 22:52:01,142 INFO L263 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {29#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} is VALID [2020-07-17 22:52:01,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {21#true} is VALID [2020-07-17 22:52:01,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-17 22:52:01,143 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #41#return; {21#true} is VALID [2020-07-17 22:52:01,143 INFO L263 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2020-07-17 22:52:01,145 INFO L280 TraceCheckUtils]: 5: Hoare triple {21#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {26#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-17 22:52:01,147 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {26#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-17 22:52:01,149 INFO L280 TraceCheckUtils]: 7: Hoare triple {26#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {26#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-17 22:52:01,151 INFO L280 TraceCheckUtils]: 8: Hoare triple {26#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {27#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-17 22:52:01,153 INFO L280 TraceCheckUtils]: 9: Hoare triple {27#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {27#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-17 22:52:01,155 INFO L280 TraceCheckUtils]: 10: Hoare triple {27#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {28#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-17 22:52:01,157 INFO L280 TraceCheckUtils]: 11: Hoare triple {28#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {22#false} is VALID [2020-07-17 22:52:01,157 INFO L280 TraceCheckUtils]: 12: Hoare triple {22#false} assume !false; {22#false} is VALID [2020-07-17 22:52:01,159 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-17 22:52:01,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694841153] [2020-07-17 22:52:01,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:01,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:52:01,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706767151] [2020-07-17 22:52:01,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-17 22:52:01,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:01,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:52:01,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:01,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:52:01,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:01,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:52:01,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:52:01,221 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 6 states. [2020-07-17 22:52:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:01,549 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-17 22:52:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:52:01,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-17 22:52:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:52:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2020-07-17 22:52:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:52:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2020-07-17 22:52:01,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2020-07-17 22:52:01,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:01,642 INFO L225 Difference]: With dead ends: 33 [2020-07-17 22:52:01,642 INFO L226 Difference]: Without dead ends: 16 [2020-07-17 22:52:01,647 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:52:01,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-17 22:52:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-17 22:52:01,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:01,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-17 22:52:01,700 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-17 22:52:01,701 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-17 22:52:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:01,704 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-17 22:52:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-17 22:52:01,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:01,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:01,705 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-17 22:52:01,706 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-17 22:52:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:01,709 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-17 22:52:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-17 22:52:01,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:01,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:01,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:01,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:52:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-17 22:52:01,714 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2020-07-17 22:52:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:01,715 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-17 22:52:01,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:52:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-17 22:52:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-17 22:52:01,716 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:01,716 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:01,717 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:52:01,717 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:01,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1823317113, now seen corresponding path program 1 times [2020-07-17 22:52:01,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:01,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309169282] [2020-07-17 22:52:01,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:01,847 INFO L280 TraceCheckUtils]: 0: Hoare triple {140#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {131#true} is VALID [2020-07-17 22:52:01,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {131#true} assume true; {131#true} is VALID [2020-07-17 22:52:01,848 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {131#true} {131#true} #41#return; {131#true} is VALID [2020-07-17 22:52:01,849 INFO L263 TraceCheckUtils]: 0: Hoare triple {131#true} call ULTIMATE.init(); {140#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} is VALID [2020-07-17 22:52:01,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {140#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {131#true} is VALID [2020-07-17 22:52:01,850 INFO L280 TraceCheckUtils]: 2: Hoare triple {131#true} assume true; {131#true} is VALID [2020-07-17 22:52:01,850 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} #41#return; {131#true} is VALID [2020-07-17 22:52:01,850 INFO L263 TraceCheckUtils]: 4: Hoare triple {131#true} call #t~ret1 := main(); {131#true} is VALID [2020-07-17 22:52:01,851 INFO L280 TraceCheckUtils]: 5: Hoare triple {131#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {136#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-17 22:52:01,852 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {136#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-17 22:52:01,853 INFO L280 TraceCheckUtils]: 7: Hoare triple {136#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {136#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-17 22:52:01,854 INFO L280 TraceCheckUtils]: 8: Hoare triple {136#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {137#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-17 22:52:01,855 INFO L280 TraceCheckUtils]: 9: Hoare triple {137#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {137#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-17 22:52:01,856 INFO L280 TraceCheckUtils]: 10: Hoare triple {137#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {138#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-17 22:52:01,857 INFO L280 TraceCheckUtils]: 11: Hoare triple {138#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {138#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-17 22:52:01,858 INFO L280 TraceCheckUtils]: 12: Hoare triple {138#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {139#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-17 22:52:01,859 INFO L280 TraceCheckUtils]: 13: Hoare triple {139#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {132#false} is VALID [2020-07-17 22:52:01,859 INFO L280 TraceCheckUtils]: 14: Hoare triple {132#false} assume !false; {132#false} is VALID [2020-07-17 22:52:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:01,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309169282] [2020-07-17 22:52:01,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076249504] [2020-07-17 22:52:01,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:01,907 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-17 22:52:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:01,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:02,058 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:52:02,072 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:52:02,106 INFO L263 TraceCheckUtils]: 0: Hoare triple {131#true} call ULTIMATE.init(); {131#true} is VALID [2020-07-17 22:52:02,107 INFO L280 TraceCheckUtils]: 1: Hoare triple {131#true} ~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {131#true} is VALID [2020-07-17 22:52:02,107 INFO L280 TraceCheckUtils]: 2: Hoare triple {131#true} assume true; {131#true} is VALID [2020-07-17 22:52:02,108 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} #41#return; {131#true} is VALID [2020-07-17 22:52:02,108 INFO L263 TraceCheckUtils]: 4: Hoare triple {131#true} call #t~ret1 := main(); {131#true} is VALID [2020-07-17 22:52:02,109 INFO L280 TraceCheckUtils]: 5: Hoare triple {131#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {136#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-17 22:52:02,110 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {136#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-17 22:52:02,110 INFO L280 TraceCheckUtils]: 7: Hoare triple {136#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {136#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-17 22:52:02,112 INFO L280 TraceCheckUtils]: 8: Hoare triple {136#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {137#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-17 22:52:02,113 INFO L280 TraceCheckUtils]: 9: Hoare triple {137#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {137#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-17 22:52:02,114 INFO L280 TraceCheckUtils]: 10: Hoare triple {137#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {138#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-17 22:52:02,115 INFO L280 TraceCheckUtils]: 11: Hoare triple {138#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {138#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-17 22:52:02,116 INFO L280 TraceCheckUtils]: 12: Hoare triple {138#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {180#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2020-07-17 22:52:02,117 INFO L280 TraceCheckUtils]: 13: Hoare triple {180#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {132#false} is VALID [2020-07-17 22:52:02,117 INFO L280 TraceCheckUtils]: 14: Hoare triple {132#false} assume !false; {132#false} is VALID [2020-07-17 22:52:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:02,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:52:02,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-17 22:52:02,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181864683] [2020-07-17 22:52:02,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-17 22:52:02,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:02,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:52:02,146 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-17 22:52:02,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:52:02,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:02,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:52:02,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:52:02,147 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 8 states. [2020-07-17 22:52:02,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:02,334 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-17 22:52:02,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:52:02,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-17 22:52:02,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:52:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2020-07-17 22:52:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:52:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2020-07-17 22:52:02,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2020-07-17 22:52:02,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:02,366 INFO L225 Difference]: With dead ends: 21 [2020-07-17 22:52:02,366 INFO L226 Difference]: Without dead ends: 18 [2020-07-17 22:52:02,368 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:52:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-17 22:52:02,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-17 22:52:02,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:02,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-17 22:52:02,379 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:52:02,380 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:52:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:02,381 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-17 22:52:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-17 22:52:02,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:02,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:02,383 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:52:02,383 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:52:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:02,385 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-17 22:52:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-17 22:52:02,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:02,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:02,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:02,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:52:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2020-07-17 22:52:02,388 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2020-07-17 22:52:02,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:02,389 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2020-07-17 22:52:02,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:52:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-17 22:52:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:52:02,390 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:02,390 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:02,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:52:02,605 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:02,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:02,607 INFO L82 PathProgramCache]: Analyzing trace with hash -140999300, now seen corresponding path program 2 times [2020-07-17 22:52:02,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:02,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432730954] [2020-07-17 22:52:02,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:02,726 INFO L280 TraceCheckUtils]: 0: Hoare triple {286#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {279#true} is VALID [2020-07-17 22:52:02,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:52:02,727 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #41#return; {279#true} is VALID [2020-07-17 22:52:02,731 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {286#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} is VALID [2020-07-17 22:52:02,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {286#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {279#true} is VALID [2020-07-17 22:52:02,732 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:52:02,732 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #41#return; {279#true} is VALID [2020-07-17 22:52:02,732 INFO L263 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret1 := main(); {279#true} is VALID [2020-07-17 22:52:02,733 INFO L280 TraceCheckUtils]: 5: Hoare triple {279#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {279#true} is VALID [2020-07-17 22:52:02,733 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} assume !!(-1000 < ~main__y~0); {279#true} is VALID [2020-07-17 22:52:02,733 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !!(~main__y~0 < 1000000); {279#true} is VALID [2020-07-17 22:52:02,734 INFO L280 TraceCheckUtils]: 8: Hoare triple {279#true} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {279#true} is VALID [2020-07-17 22:52:02,734 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {279#true} is VALID [2020-07-17 22:52:02,734 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {279#true} is VALID [2020-07-17 22:52:02,735 INFO L280 TraceCheckUtils]: 11: Hoare triple {279#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {279#true} is VALID [2020-07-17 22:52:02,736 INFO L280 TraceCheckUtils]: 12: Hoare triple {279#true} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {284#(<= (+ main_~main__x~0 2) main_~main__y~0)} is VALID [2020-07-17 22:52:02,738 INFO L280 TraceCheckUtils]: 13: Hoare triple {284#(<= (+ main_~main__x~0 2) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {284#(<= (+ main_~main__x~0 2) main_~main__y~0)} is VALID [2020-07-17 22:52:02,739 INFO L280 TraceCheckUtils]: 14: Hoare triple {284#(<= (+ main_~main__x~0 2) main_~main__y~0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {285#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-17 22:52:02,740 INFO L280 TraceCheckUtils]: 15: Hoare triple {285#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {280#false} is VALID [2020-07-17 22:52:02,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-17 22:52:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:52:02,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432730954] [2020-07-17 22:52:02,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:02,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:52:02,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086530434] [2020-07-17 22:52:02,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 22:52:02,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:02,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:52:02,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:02,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:52:02,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:02,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:52:02,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:52:02,769 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2020-07-17 22:52:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:02,849 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-17 22:52:02,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:52:02,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 22:52:02,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:52:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-07-17 22:52:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:52:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-07-17 22:52:02,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 14 transitions. [2020-07-17 22:52:02,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:02,885 INFO L225 Difference]: With dead ends: 18 [2020-07-17 22:52:02,885 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:52:02,886 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:52:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:52:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:52:02,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:02,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:02,887 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:02,887 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:02,887 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:52:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:02,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:02,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:02,888 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:02,888 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:02,889 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:52:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:02,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:02,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:02,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:02,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:52:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:52:02,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-07-17 22:52:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:02,890 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:52:02,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:52:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:02,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:02,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:52:02,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:52:02,940 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:52:02,940 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= ~__return_65~0 |old(~__return_65~0)|)) [2020-07-17 22:52:02,940 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:52:02,940 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:52:02,941 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:52:02,941 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:52:02,941 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:52:02,941 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:52:02,941 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-17 22:52:02,941 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:52:02,941 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:52:02,941 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 55) no Hoare annotation was computed. [2020-07-17 22:52:02,942 INFO L268 CegarLoopResult]: For program point L30(lines 30 69) no Hoare annotation was computed. [2020-07-17 22:52:02,942 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 12 72) the Hoare annotation is: (and (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-17 22:52:02,942 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 12 72) no Hoare annotation was computed. [2020-07-17 22:52:02,942 INFO L268 CegarLoopResult]: For program point L24(lines 24 70) no Hoare annotation was computed. [2020-07-17 22:52:02,942 INFO L268 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2020-07-17 22:52:02,942 INFO L268 CegarLoopResult]: For program point L53(lines 53 62) no Hoare annotation was computed. [2020-07-17 22:52:02,942 INFO L268 CegarLoopResult]: For program point L18(lines 18 71) no Hoare annotation was computed. [2020-07-17 22:52:02,942 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 12 72) no Hoare annotation was computed. [2020-07-17 22:52:02,943 INFO L264 CegarLoopResult]: At program point L44(lines 31 65) the Hoare annotation is: (<= (+ main_~main__x~0 2) main_~main__y~0) [2020-07-17 22:52:02,943 INFO L268 CegarLoopResult]: For program point L38(lines 38 64) no Hoare annotation was computed. [2020-07-17 22:52:02,947 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:52:02,948 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:52:02,948 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:52:02,948 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:52:02,948 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:52:02,949 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:52:02,949 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:52:02,950 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:52:02,950 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:52:02,950 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:52:02,950 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:52:02,950 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-17 22:52:02,950 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:52:02,950 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:52:02,950 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:52:02,951 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:52:02,951 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:52:02,951 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:52:02,951 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:52:02,951 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:52:02,951 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:52:02,951 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-17 22:52:02,951 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-17 22:52:02,952 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-17 22:52:02,952 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-17 22:52:02,952 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:52:02,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:52:02 BoogieIcfgContainer [2020-07-17 22:52:02,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:52:02,965 INFO L168 Benchmark]: Toolchain (without parser) took 2926.14 ms. Allocated memory was 141.0 MB in the beginning and 246.9 MB in the end (delta: 105.9 MB). Free memory was 103.0 MB in the beginning and 207.3 MB in the end (delta: -104.3 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:02,966 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 141.0 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-17 22:52:02,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.70 ms. Allocated memory is still 141.0 MB. Free memory was 102.5 MB in the beginning and 92.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:02,968 INFO L168 Benchmark]: Boogie Preprocessor took 30.23 ms. Allocated memory is still 141.0 MB. Free memory was 92.5 MB in the beginning and 90.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:02,969 INFO L168 Benchmark]: RCFGBuilder took 417.66 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 90.9 MB in the beginning and 164.1 MB in the end (delta: -73.1 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:02,970 INFO L168 Benchmark]: TraceAbstraction took 2237.26 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 164.1 MB in the beginning and 207.3 MB in the end (delta: -43.2 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:02,973 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 141.0 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 234.70 ms. Allocated memory is still 141.0 MB. Free memory was 102.5 MB in the beginning and 92.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.23 ms. Allocated memory is still 141.0 MB. Free memory was 92.5 MB in the beginning and 90.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 417.66 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 90.9 MB in the beginning and 164.1 MB in the end (delta: -73.1 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2237.26 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 164.1 MB in the beginning and 207.3 MB in the end (delta: -43.2 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 55]: 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 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: main__x + 2 <= main__y - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 40 SDtfs, 24 SDslu, 98 SDs, 0 SdLazy, 99 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 7 NumberOfFragments, 24 HoareAnnotationTreeSize, 5 FomulaSimplifications, 25 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 2588 SizeOfPredicates, 4 NumberOfNonLiveVariables, 70 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 6/10 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...