/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:32:20,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:32:20,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:32:20,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:32:20,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:32:20,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:32:20,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:32:20,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:32:20,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:32:20,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:32:20,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:32:20,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:32:20,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:32:20,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:32:20,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:32:20,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:32:20,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:32:20,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:32:20,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:32:20,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:32:20,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:32:20,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:32:20,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:32:20,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:32:20,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:32:20,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:32:20,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:32:20,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:32:20,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:32:20,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:32:20,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:32:20,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:32:20,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:32:20,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:32:20,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:32:20,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:32:20,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:32:20,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:32:20,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:32:20,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:32:20,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:32:20,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:32:20,913 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:32:20,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:32:20,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:32:20,915 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:32:20,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:32:20,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:32:20,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:32:20,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:32:20,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:32:20,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:32:20,916 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:32:20,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:32:20,917 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:32:20,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:32:20,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:32:20,918 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:32:20,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:32:20,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:32:20,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:32:20,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:32:20,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:32:20,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:32:20,919 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:32:21,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:32:21,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:32:21,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:32:21,201 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:32:21,201 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:32:21,202 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-11 02:32:21,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeebdca75/564c89cde1874831a0af6b8f5d3009d3/FLAGef5792fba [2020-07-11 02:32:21,674 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:32:21,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+lhb-reducer.c [2020-07-11 02:32:21,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeebdca75/564c89cde1874831a0af6b8f5d3009d3/FLAGef5792fba [2020-07-11 02:32:22,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeebdca75/564c89cde1874831a0af6b8f5d3009d3 [2020-07-11 02:32:22,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:32:22,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:32:22,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:32:22,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:32:22,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:32:22,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:32:22" (1/1) ... [2020-07-11 02:32:22,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59e526ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:22, skipping insertion in model container [2020-07-11 02:32:22,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:32:22" (1/1) ... [2020-07-11 02:32:22,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:32:22,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:32:22,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:32:22,301 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:32:22,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:32:22,337 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:32:22,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:22 WrapperNode [2020-07-11 02:32:22,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:32:22,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:32:22,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:32:22,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:32:22,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:22" (1/1) ... [2020-07-11 02:32:22,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:22" (1/1) ... [2020-07-11 02:32:22,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:22" (1/1) ... [2020-07-11 02:32:22,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:22" (1/1) ... [2020-07-11 02:32:22,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:22" (1/1) ... [2020-07-11 02:32:22,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:22" (1/1) ... [2020-07-11 02:32:22,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:22" (1/1) ... [2020-07-11 02:32:22,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:32:22,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:32:22,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:32:22,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:32:22,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:22" (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-11 02:32:22,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:32:22,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:32:22,530 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:32:22,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:32:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:32:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:32:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:32:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:32:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:32:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:32:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:32:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:32:22,993 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:32:22,993 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 02:32:22,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:32:22 BoogieIcfgContainer [2020-07-11 02:32:22,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:32:22,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:32:22,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:32:23,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:32:23,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:32:22" (1/3) ... [2020-07-11 02:32:23,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5229bc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:32:23, skipping insertion in model container [2020-07-11 02:32:23,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:22" (2/3) ... [2020-07-11 02:32:23,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5229bc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:32:23, skipping insertion in model container [2020-07-11 02:32:23,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:32:22" (3/3) ... [2020-07-11 02:32:23,006 INFO L109 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.v+lhb-reducer.c [2020-07-11 02:32:23,016 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:32:23,024 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:32:23,037 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:32:23,058 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:32:23,058 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:32:23,058 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:32:23,058 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:32:23,059 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:32:23,059 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:32:23,059 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:32:23,059 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:32:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-07-11 02:32:23,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-11 02:32:23,085 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:23,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:23,086 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:23,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:23,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1819653980, now seen corresponding path program 1 times [2020-07-11 02:32:23,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:23,102 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1799698944] [2020-07-11 02:32:23,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:23,454 INFO L280 TraceCheckUtils]: 0: Hoare triple {59#(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; {46#true} is VALID [2020-07-11 02:32:23,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} ~__tmp_55_0~0 := 0; {46#true} is VALID [2020-07-11 02:32:23,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#true} ~__return_65~0 := 0; {46#true} is VALID [2020-07-11 02:32:23,456 INFO L280 TraceCheckUtils]: 3: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-11 02:32:23,456 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {46#true} {46#true} #67#return; {46#true} is VALID [2020-07-11 02:32:23,460 INFO L263 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {59#(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-11 02:32:23,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#(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; {46#true} is VALID [2020-07-11 02:32:23,461 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#true} ~__tmp_55_0~0 := 0; {46#true} is VALID [2020-07-11 02:32:23,461 INFO L280 TraceCheckUtils]: 3: Hoare triple {46#true} ~__return_65~0 := 0; {46#true} is VALID [2020-07-11 02:32:23,462 INFO L280 TraceCheckUtils]: 4: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-11 02:32:23,462 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {46#true} {46#true} #67#return; {46#true} is VALID [2020-07-11 02:32:23,462 INFO L263 TraceCheckUtils]: 6: Hoare triple {46#true} call #t~ret1 := main(); {46#true} is VALID [2020-07-11 02:32:23,463 INFO L280 TraceCheckUtils]: 7: Hoare triple {46#true} havoc ~main__x~0; {46#true} is VALID [2020-07-11 02:32:23,463 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#true} havoc ~main__y~0; {46#true} is VALID [2020-07-11 02:32:23,465 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#true} ~main__x~0 := -50; {53#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:23,466 INFO L280 TraceCheckUtils]: 10: Hoare triple {53#(<= (+ main_~main__x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {53#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:23,467 INFO L280 TraceCheckUtils]: 11: Hoare triple {53#(<= (+ main_~main__x~0 50) 0)} ~main__y~0 := #t~nondet0; {53#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:23,468 INFO L280 TraceCheckUtils]: 12: Hoare triple {53#(<= (+ main_~main__x~0 50) 0)} havoc #t~nondet0; {53#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:23,469 INFO L280 TraceCheckUtils]: 13: Hoare triple {53#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {53#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:23,470 INFO L280 TraceCheckUtils]: 14: Hoare triple {53#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {53#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:23,471 INFO L280 TraceCheckUtils]: 15: Hoare triple {53#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0; {53#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:23,473 INFO L280 TraceCheckUtils]: 16: Hoare triple {53#(<= (+ main_~main__x~0 50) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {54#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-11 02:32:23,474 INFO L280 TraceCheckUtils]: 17: Hoare triple {54#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {54#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-11 02:32:23,475 INFO L280 TraceCheckUtils]: 18: Hoare triple {54#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {55#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-11 02:32:23,476 INFO L280 TraceCheckUtils]: 19: Hoare triple {55#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {55#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-11 02:32:23,477 INFO L280 TraceCheckUtils]: 20: Hoare triple {55#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {55#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-11 02:32:23,478 INFO L280 TraceCheckUtils]: 21: Hoare triple {55#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume !(~main__x~0 < 0); {56#(<= 51 main_~main__y~0)} is VALID [2020-07-11 02:32:23,479 INFO L280 TraceCheckUtils]: 22: Hoare triple {56#(<= 51 main_~main__y~0)} havoc ~__tmp_1~0; {56#(<= 51 main_~main__y~0)} is VALID [2020-07-11 02:32:23,481 INFO L280 TraceCheckUtils]: 23: Hoare triple {56#(<= 51 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {57#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-11 02:32:23,482 INFO L280 TraceCheckUtils]: 24: Hoare triple {57#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {57#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-11 02:32:23,483 INFO L280 TraceCheckUtils]: 25: Hoare triple {57#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {58#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-11 02:32:23,484 INFO L280 TraceCheckUtils]: 26: Hoare triple {58#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {47#false} is VALID [2020-07-11 02:32:23,484 INFO L280 TraceCheckUtils]: 27: Hoare triple {47#false} assume !false; {47#false} is VALID [2020-07-11 02:32:23,489 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-11 02:32:23,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1799698944] [2020-07-11 02:32:23,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:23,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-11 02:32:23,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584614000] [2020-07-11 02:32:23,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-11 02:32:23,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:23,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 02:32:23,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:23,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 02:32:23,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:23,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 02:32:23,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:32:23,568 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 9 states. [2020-07-11 02:32:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:24,385 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2020-07-11 02:32:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:32:24,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-11 02:32:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:32:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-11 02:32:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:32:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-11 02:32:24,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2020-07-11 02:32:24,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:24,511 INFO L225 Difference]: With dead ends: 65 [2020-07-11 02:32:24,511 INFO L226 Difference]: Without dead ends: 36 [2020-07-11 02:32:24,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2020-07-11 02:32:24,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-11 02:32:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-11 02:32:24,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:24,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2020-07-11 02:32:24,607 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2020-07-11 02:32:24,607 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2020-07-11 02:32:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:24,612 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-07-11 02:32:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-07-11 02:32:24,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:24,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:24,613 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2020-07-11 02:32:24,614 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2020-07-11 02:32:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:24,618 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-07-11 02:32:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-07-11 02:32:24,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:24,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:24,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:24,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-11 02:32:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2020-07-11 02:32:24,625 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 28 [2020-07-11 02:32:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:24,625 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2020-07-11 02:32:24,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 02:32:24,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2020-07-11 02:32:24,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-11 02:32:24,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 02:32:24,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:24,673 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:24,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:32:24,674 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:24,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:24,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1522824151, now seen corresponding path program 1 times [2020-07-11 02:32:24,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:24,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1976122402] [2020-07-11 02:32:24,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:24,876 INFO L280 TraceCheckUtils]: 0: Hoare triple {363#(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; {348#true} is VALID [2020-07-11 02:32:24,876 INFO L280 TraceCheckUtils]: 1: Hoare triple {348#true} ~__tmp_55_0~0 := 0; {348#true} is VALID [2020-07-11 02:32:24,876 INFO L280 TraceCheckUtils]: 2: Hoare triple {348#true} ~__return_65~0 := 0; {348#true} is VALID [2020-07-11 02:32:24,877 INFO L280 TraceCheckUtils]: 3: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-11 02:32:24,877 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {348#true} {348#true} #67#return; {348#true} is VALID [2020-07-11 02:32:24,878 INFO L263 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {363#(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-11 02:32:24,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#(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; {348#true} is VALID [2020-07-11 02:32:24,879 INFO L280 TraceCheckUtils]: 2: Hoare triple {348#true} ~__tmp_55_0~0 := 0; {348#true} is VALID [2020-07-11 02:32:24,879 INFO L280 TraceCheckUtils]: 3: Hoare triple {348#true} ~__return_65~0 := 0; {348#true} is VALID [2020-07-11 02:32:24,879 INFO L280 TraceCheckUtils]: 4: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-11 02:32:24,880 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {348#true} {348#true} #67#return; {348#true} is VALID [2020-07-11 02:32:24,880 INFO L263 TraceCheckUtils]: 6: Hoare triple {348#true} call #t~ret1 := main(); {348#true} is VALID [2020-07-11 02:32:24,880 INFO L280 TraceCheckUtils]: 7: Hoare triple {348#true} havoc ~main__x~0; {348#true} is VALID [2020-07-11 02:32:24,880 INFO L280 TraceCheckUtils]: 8: Hoare triple {348#true} havoc ~main__y~0; {348#true} is VALID [2020-07-11 02:32:24,881 INFO L280 TraceCheckUtils]: 9: Hoare triple {348#true} ~main__x~0 := -50; {355#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:24,882 INFO L280 TraceCheckUtils]: 10: Hoare triple {355#(<= (+ main_~main__x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {355#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:24,883 INFO L280 TraceCheckUtils]: 11: Hoare triple {355#(<= (+ main_~main__x~0 50) 0)} ~main__y~0 := #t~nondet0; {355#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:24,883 INFO L280 TraceCheckUtils]: 12: Hoare triple {355#(<= (+ main_~main__x~0 50) 0)} havoc #t~nondet0; {355#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:24,884 INFO L280 TraceCheckUtils]: 13: Hoare triple {355#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {355#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:24,885 INFO L280 TraceCheckUtils]: 14: Hoare triple {355#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {355#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:24,885 INFO L280 TraceCheckUtils]: 15: Hoare triple {355#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0; {355#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:24,886 INFO L280 TraceCheckUtils]: 16: Hoare triple {355#(<= (+ main_~main__x~0 50) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {356#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-11 02:32:24,887 INFO L280 TraceCheckUtils]: 17: Hoare triple {356#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {356#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-11 02:32:24,888 INFO L280 TraceCheckUtils]: 18: Hoare triple {356#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {357#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-11 02:32:24,889 INFO L280 TraceCheckUtils]: 19: Hoare triple {357#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {357#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-11 02:32:24,889 INFO L280 TraceCheckUtils]: 20: Hoare triple {357#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {357#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-11 02:32:24,890 INFO L280 TraceCheckUtils]: 21: Hoare triple {357#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0; {357#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-11 02:32:24,891 INFO L280 TraceCheckUtils]: 22: Hoare triple {357#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {358#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-11 02:32:24,892 INFO L280 TraceCheckUtils]: 23: Hoare triple {358#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~1 := ~main__y~0; {358#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-11 02:32:24,892 INFO L280 TraceCheckUtils]: 24: Hoare triple {358#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {359#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-11 02:32:24,893 INFO L280 TraceCheckUtils]: 25: Hoare triple {359#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} ~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {359#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-11 02:32:24,894 INFO L280 TraceCheckUtils]: 26: Hoare triple {359#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {359#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-11 02:32:24,895 INFO L280 TraceCheckUtils]: 27: Hoare triple {359#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume !(~main__x~0 < 0); {360#(<= 27 main_~main__y~0)} is VALID [2020-07-11 02:32:24,895 INFO L280 TraceCheckUtils]: 28: Hoare triple {360#(<= 27 main_~main__y~0)} havoc ~__tmp_1~0; {360#(<= 27 main_~main__y~0)} is VALID [2020-07-11 02:32:24,896 INFO L280 TraceCheckUtils]: 29: Hoare triple {360#(<= 27 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {361#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-11 02:32:24,897 INFO L280 TraceCheckUtils]: 30: Hoare triple {361#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {361#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-11 02:32:24,898 INFO L280 TraceCheckUtils]: 31: Hoare triple {361#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {362#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-11 02:32:24,898 INFO L280 TraceCheckUtils]: 32: Hoare triple {362#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {349#false} is VALID [2020-07-11 02:32:24,899 INFO L280 TraceCheckUtils]: 33: Hoare triple {349#false} assume !false; {349#false} is VALID [2020-07-11 02:32:24,901 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-11 02:32:24,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1976122402] [2020-07-11 02:32:24,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:24,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:32:24,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846605375] [2020-07-11 02:32:24,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2020-07-11 02:32:24,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:24,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:32:24,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:24,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:32:24,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:24,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:32:24,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:32:24,943 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 11 states. [2020-07-11 02:32:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:25,575 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-11 02:32:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:32:25,575 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2020-07-11 02:32:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:32:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2020-07-11 02:32:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:32:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2020-07-11 02:32:25,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 49 transitions. [2020-07-11 02:32:25,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:25,653 INFO L225 Difference]: With dead ends: 49 [2020-07-11 02:32:25,653 INFO L226 Difference]: Without dead ends: 42 [2020-07-11 02:32:25,654 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2020-07-11 02:32:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-11 02:32:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-11 02:32:25,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:25,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2020-07-11 02:32:25,718 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2020-07-11 02:32:25,718 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2020-07-11 02:32:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:25,721 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-11 02:32:25,721 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-11 02:32:25,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:25,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:25,722 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2020-07-11 02:32:25,722 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2020-07-11 02:32:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:25,725 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-11 02:32:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-11 02:32:25,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:25,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:25,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:25,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-11 02:32:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2020-07-11 02:32:25,729 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 34 [2020-07-11 02:32:25,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:25,729 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2020-07-11 02:32:25,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:32:25,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2020-07-11 02:32:25,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-11 02:32:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-11 02:32:25,777 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:25,778 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:25,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:32:25,778 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:25,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:25,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1421125650, now seen corresponding path program 2 times [2020-07-11 02:32:25,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:25,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [717431915] [2020-07-11 02:32:25,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:26,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {659#(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; {642#true} is VALID [2020-07-11 02:32:26,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#true} ~__tmp_55_0~0 := 0; {642#true} is VALID [2020-07-11 02:32:26,039 INFO L280 TraceCheckUtils]: 2: Hoare triple {642#true} ~__return_65~0 := 0; {642#true} is VALID [2020-07-11 02:32:26,039 INFO L280 TraceCheckUtils]: 3: Hoare triple {642#true} assume true; {642#true} is VALID [2020-07-11 02:32:26,039 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {642#true} {642#true} #67#return; {642#true} is VALID [2020-07-11 02:32:26,040 INFO L263 TraceCheckUtils]: 0: Hoare triple {642#true} call ULTIMATE.init(); {659#(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-11 02:32:26,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {659#(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; {642#true} is VALID [2020-07-11 02:32:26,041 INFO L280 TraceCheckUtils]: 2: Hoare triple {642#true} ~__tmp_55_0~0 := 0; {642#true} is VALID [2020-07-11 02:32:26,041 INFO L280 TraceCheckUtils]: 3: Hoare triple {642#true} ~__return_65~0 := 0; {642#true} is VALID [2020-07-11 02:32:26,041 INFO L280 TraceCheckUtils]: 4: Hoare triple {642#true} assume true; {642#true} is VALID [2020-07-11 02:32:26,041 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {642#true} {642#true} #67#return; {642#true} is VALID [2020-07-11 02:32:26,041 INFO L263 TraceCheckUtils]: 6: Hoare triple {642#true} call #t~ret1 := main(); {642#true} is VALID [2020-07-11 02:32:26,042 INFO L280 TraceCheckUtils]: 7: Hoare triple {642#true} havoc ~main__x~0; {642#true} is VALID [2020-07-11 02:32:26,042 INFO L280 TraceCheckUtils]: 8: Hoare triple {642#true} havoc ~main__y~0; {642#true} is VALID [2020-07-11 02:32:26,046 INFO L280 TraceCheckUtils]: 9: Hoare triple {642#true} ~main__x~0 := -50; {649#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:26,046 INFO L280 TraceCheckUtils]: 10: Hoare triple {649#(<= (+ main_~main__x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {649#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:26,047 INFO L280 TraceCheckUtils]: 11: Hoare triple {649#(<= (+ main_~main__x~0 50) 0)} ~main__y~0 := #t~nondet0; {649#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:26,047 INFO L280 TraceCheckUtils]: 12: Hoare triple {649#(<= (+ main_~main__x~0 50) 0)} havoc #t~nondet0; {649#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:26,048 INFO L280 TraceCheckUtils]: 13: Hoare triple {649#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {649#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:26,048 INFO L280 TraceCheckUtils]: 14: Hoare triple {649#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {649#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:26,056 INFO L280 TraceCheckUtils]: 15: Hoare triple {649#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0; {649#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-11 02:32:26,057 INFO L280 TraceCheckUtils]: 16: Hoare triple {649#(<= (+ main_~main__x~0 50) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {650#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-11 02:32:26,058 INFO L280 TraceCheckUtils]: 17: Hoare triple {650#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {650#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-11 02:32:26,058 INFO L280 TraceCheckUtils]: 18: Hoare triple {650#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {651#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-11 02:32:26,059 INFO L280 TraceCheckUtils]: 19: Hoare triple {651#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {651#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-11 02:32:26,059 INFO L280 TraceCheckUtils]: 20: Hoare triple {651#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {651#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-11 02:32:26,060 INFO L280 TraceCheckUtils]: 21: Hoare triple {651#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0; {651#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-11 02:32:26,060 INFO L280 TraceCheckUtils]: 22: Hoare triple {651#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {652#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-11 02:32:26,061 INFO L280 TraceCheckUtils]: 23: Hoare triple {652#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~1 := ~main__y~0; {652#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-11 02:32:26,061 INFO L280 TraceCheckUtils]: 24: Hoare triple {652#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {653#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-11 02:32:26,062 INFO L280 TraceCheckUtils]: 25: Hoare triple {653#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} ~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {653#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-11 02:32:26,062 INFO L280 TraceCheckUtils]: 26: Hoare triple {653#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {653#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-11 02:32:26,063 INFO L280 TraceCheckUtils]: 27: Hoare triple {653#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume ~main__x~0 < 0; {653#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-11 02:32:26,064 INFO L280 TraceCheckUtils]: 28: Hoare triple {653#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} ~main__x~0 := ~main__x~0 + ~main__y~0; {654#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} is VALID [2020-07-11 02:32:26,066 INFO L280 TraceCheckUtils]: 29: Hoare triple {654#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} ~main____CPAchecker_TMP_0~1 := ~main__y~0; {654#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} is VALID [2020-07-11 02:32:26,067 INFO L280 TraceCheckUtils]: 30: Hoare triple {654#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {655#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} is VALID [2020-07-11 02:32:26,068 INFO L280 TraceCheckUtils]: 31: Hoare triple {655#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} ~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {655#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} is VALID [2020-07-11 02:32:26,068 INFO L280 TraceCheckUtils]: 32: Hoare triple {655#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {655#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} is VALID [2020-07-11 02:32:26,069 INFO L280 TraceCheckUtils]: 33: Hoare triple {655#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} assume !(~main__x~0 < 0); {656#(<= 19 main_~main__y~0)} is VALID [2020-07-11 02:32:26,070 INFO L280 TraceCheckUtils]: 34: Hoare triple {656#(<= 19 main_~main__y~0)} havoc ~__tmp_1~0; {656#(<= 19 main_~main__y~0)} is VALID [2020-07-11 02:32:26,070 INFO L280 TraceCheckUtils]: 35: Hoare triple {656#(<= 19 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {657#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-11 02:32:26,071 INFO L280 TraceCheckUtils]: 36: Hoare triple {657#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {657#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-11 02:32:26,071 INFO L280 TraceCheckUtils]: 37: Hoare triple {657#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {658#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-11 02:32:26,072 INFO L280 TraceCheckUtils]: 38: Hoare triple {658#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {643#false} is VALID [2020-07-11 02:32:26,072 INFO L280 TraceCheckUtils]: 39: Hoare triple {643#false} assume !false; {643#false} is VALID [2020-07-11 02:32:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:32:26,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [717431915] [2020-07-11 02:32:26,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:26,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 02:32:26,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778480446] [2020-07-11 02:32:26,077 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-11 02:32:26,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:26,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 02:32:26,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:26,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 02:32:26,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:26,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 02:32:26,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:32:26,122 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 13 states. [2020-07-11 02:32:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:26,836 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-07-11 02:32:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-11 02:32:26,836 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-11 02:32:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:32:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2020-07-11 02:32:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:32:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2020-07-11 02:32:26,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 55 transitions. [2020-07-11 02:32:26,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:26,915 INFO L225 Difference]: With dead ends: 55 [2020-07-11 02:32:26,916 INFO L226 Difference]: Without dead ends: 48 [2020-07-11 02:32:26,916 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2020-07-11 02:32:26,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-11 02:32:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-11 02:32:26,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:26,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-11 02:32:26,971 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-11 02:32:26,972 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-11 02:32:26,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:26,975 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-11 02:32:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-11 02:32:26,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:26,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:26,976 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-11 02:32:26,977 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-11 02:32:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:26,979 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-11 02:32:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-11 02:32:26,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:26,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:26,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:26,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-11 02:32:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2020-07-11 02:32:26,983 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 40 [2020-07-11 02:32:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:26,983 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2020-07-11 02:32:26,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 02:32:26,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2020-07-11 02:32:27,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-07-11 02:32:27,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-11 02:32:27,038 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:27,038 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:27,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:32:27,038 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:27,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:27,039 INFO L82 PathProgramCache]: Analyzing trace with hash -264078349, now seen corresponding path program 3 times [2020-07-11 02:32:27,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:27,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1325994199] [2020-07-11 02:32:27,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:27,181 INFO L280 TraceCheckUtils]: 0: Hoare triple {987#(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; {974#true} is VALID [2020-07-11 02:32:27,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {974#true} ~__tmp_55_0~0 := 0; {974#true} is VALID [2020-07-11 02:32:27,182 INFO L280 TraceCheckUtils]: 2: Hoare triple {974#true} ~__return_65~0 := 0; {974#true} is VALID [2020-07-11 02:32:27,182 INFO L280 TraceCheckUtils]: 3: Hoare triple {974#true} assume true; {974#true} is VALID [2020-07-11 02:32:27,182 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {974#true} {974#true} #67#return; {974#true} is VALID [2020-07-11 02:32:27,199 INFO L263 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {987#(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-11 02:32:27,199 INFO L280 TraceCheckUtils]: 1: Hoare triple {987#(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; {974#true} is VALID [2020-07-11 02:32:27,199 INFO L280 TraceCheckUtils]: 2: Hoare triple {974#true} ~__tmp_55_0~0 := 0; {974#true} is VALID [2020-07-11 02:32:27,200 INFO L280 TraceCheckUtils]: 3: Hoare triple {974#true} ~__return_65~0 := 0; {974#true} is VALID [2020-07-11 02:32:27,200 INFO L280 TraceCheckUtils]: 4: Hoare triple {974#true} assume true; {974#true} is VALID [2020-07-11 02:32:27,200 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {974#true} {974#true} #67#return; {974#true} is VALID [2020-07-11 02:32:27,200 INFO L263 TraceCheckUtils]: 6: Hoare triple {974#true} call #t~ret1 := main(); {974#true} is VALID [2020-07-11 02:32:27,200 INFO L280 TraceCheckUtils]: 7: Hoare triple {974#true} havoc ~main__x~0; {974#true} is VALID [2020-07-11 02:32:27,201 INFO L280 TraceCheckUtils]: 8: Hoare triple {974#true} havoc ~main__y~0; {974#true} is VALID [2020-07-11 02:32:27,201 INFO L280 TraceCheckUtils]: 9: Hoare triple {974#true} ~main__x~0 := -50; {974#true} is VALID [2020-07-11 02:32:27,201 INFO L280 TraceCheckUtils]: 10: Hoare triple {974#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {974#true} is VALID [2020-07-11 02:32:27,201 INFO L280 TraceCheckUtils]: 11: Hoare triple {974#true} ~main__y~0 := #t~nondet0; {974#true} is VALID [2020-07-11 02:32:27,201 INFO L280 TraceCheckUtils]: 12: Hoare triple {974#true} havoc #t~nondet0; {974#true} is VALID [2020-07-11 02:32:27,202 INFO L280 TraceCheckUtils]: 13: Hoare triple {974#true} assume !!(-1000 < ~main__y~0); {974#true} is VALID [2020-07-11 02:32:27,202 INFO L280 TraceCheckUtils]: 14: Hoare triple {974#true} assume !!(~main__y~0 < 1000000); {974#true} is VALID [2020-07-11 02:32:27,202 INFO L280 TraceCheckUtils]: 15: Hoare triple {974#true} assume ~main__x~0 < 0; {974#true} is VALID [2020-07-11 02:32:27,202 INFO L280 TraceCheckUtils]: 16: Hoare triple {974#true} ~main__x~0 := ~main__x~0 + ~main__y~0; {974#true} is VALID [2020-07-11 02:32:27,202 INFO L280 TraceCheckUtils]: 17: Hoare triple {974#true} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {974#true} is VALID [2020-07-11 02:32:27,202 INFO L280 TraceCheckUtils]: 18: Hoare triple {974#true} ~main__y~0 := 1 + ~main__y~0; {974#true} is VALID [2020-07-11 02:32:27,203 INFO L280 TraceCheckUtils]: 19: Hoare triple {974#true} ~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {974#true} is VALID [2020-07-11 02:32:27,203 INFO L280 TraceCheckUtils]: 20: Hoare triple {974#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {974#true} is VALID [2020-07-11 02:32:27,203 INFO L280 TraceCheckUtils]: 21: Hoare triple {974#true} assume ~main__x~0 < 0; {974#true} is VALID [2020-07-11 02:32:27,203 INFO L280 TraceCheckUtils]: 22: Hoare triple {974#true} ~main__x~0 := ~main__x~0 + ~main__y~0; {974#true} is VALID [2020-07-11 02:32:27,203 INFO L280 TraceCheckUtils]: 23: Hoare triple {974#true} ~main____CPAchecker_TMP_0~1 := ~main__y~0; {974#true} is VALID [2020-07-11 02:32:27,204 INFO L280 TraceCheckUtils]: 24: Hoare triple {974#true} ~main__y~0 := 1 + ~main__y~0; {974#true} is VALID [2020-07-11 02:32:27,204 INFO L280 TraceCheckUtils]: 25: Hoare triple {974#true} ~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {974#true} is VALID [2020-07-11 02:32:27,204 INFO L280 TraceCheckUtils]: 26: Hoare triple {974#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {974#true} is VALID [2020-07-11 02:32:27,204 INFO L280 TraceCheckUtils]: 27: Hoare triple {974#true} assume ~main__x~0 < 0; {974#true} is VALID [2020-07-11 02:32:27,205 INFO L280 TraceCheckUtils]: 28: Hoare triple {974#true} ~main__x~0 := ~main__x~0 + ~main__y~0; {974#true} is VALID [2020-07-11 02:32:27,205 INFO L280 TraceCheckUtils]: 29: Hoare triple {974#true} ~main____CPAchecker_TMP_0~1 := ~main__y~0; {974#true} is VALID [2020-07-11 02:32:27,205 INFO L280 TraceCheckUtils]: 30: Hoare triple {974#true} ~main__y~0 := 1 + ~main__y~0; {974#true} is VALID [2020-07-11 02:32:27,206 INFO L280 TraceCheckUtils]: 31: Hoare triple {974#true} ~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {974#true} is VALID [2020-07-11 02:32:27,206 INFO L280 TraceCheckUtils]: 32: Hoare triple {974#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {974#true} is VALID [2020-07-11 02:32:27,207 INFO L280 TraceCheckUtils]: 33: Hoare triple {974#true} assume ~main__x~0 < 0; {981#(<= (+ main_~main__x~0 1) 0)} is VALID [2020-07-11 02:32:27,207 INFO L280 TraceCheckUtils]: 34: Hoare triple {981#(<= (+ main_~main__x~0 1) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {982#(<= (+ main_~main__x~0 1) main_~main__y~0)} is VALID [2020-07-11 02:32:27,208 INFO L280 TraceCheckUtils]: 35: Hoare triple {982#(<= (+ main_~main__x~0 1) main_~main__y~0)} ~main____CPAchecker_TMP_0~1 := ~main__y~0; {982#(<= (+ main_~main__x~0 1) main_~main__y~0)} is VALID [2020-07-11 02:32:27,209 INFO L280 TraceCheckUtils]: 36: Hoare triple {982#(<= (+ main_~main__x~0 1) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {983#(<= (+ main_~main__x~0 2) main_~main__y~0)} is VALID [2020-07-11 02:32:27,209 INFO L280 TraceCheckUtils]: 37: Hoare triple {983#(<= (+ main_~main__x~0 2) main_~main__y~0)} ~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {983#(<= (+ main_~main__x~0 2) main_~main__y~0)} is VALID [2020-07-11 02:32:27,210 INFO L280 TraceCheckUtils]: 38: Hoare triple {983#(<= (+ main_~main__x~0 2) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {983#(<= (+ main_~main__x~0 2) main_~main__y~0)} is VALID [2020-07-11 02:32:27,210 INFO L280 TraceCheckUtils]: 39: Hoare triple {983#(<= (+ main_~main__x~0 2) main_~main__y~0)} assume !(~main__x~0 < 0); {984#(<= 2 main_~main__y~0)} is VALID [2020-07-11 02:32:27,211 INFO L280 TraceCheckUtils]: 40: Hoare triple {984#(<= 2 main_~main__y~0)} havoc ~__tmp_1~0; {984#(<= 2 main_~main__y~0)} is VALID [2020-07-11 02:32:27,211 INFO L280 TraceCheckUtils]: 41: Hoare triple {984#(<= 2 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {985#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-11 02:32:27,212 INFO L280 TraceCheckUtils]: 42: Hoare triple {985#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {985#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-11 02:32:27,212 INFO L280 TraceCheckUtils]: 43: Hoare triple {985#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {986#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-11 02:32:27,212 INFO L280 TraceCheckUtils]: 44: Hoare triple {986#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {975#false} is VALID [2020-07-11 02:32:27,213 INFO L280 TraceCheckUtils]: 45: Hoare triple {975#false} assume !false; {975#false} is VALID [2020-07-11 02:32:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-11 02:32:27,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1325994199] [2020-07-11 02:32:27,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:27,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-11 02:32:27,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486647323] [2020-07-11 02:32:27,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2020-07-11 02:32:27,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:27,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 02:32:27,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:27,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 02:32:27,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:27,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 02:32:27,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:32:27,258 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 9 states. [2020-07-11 02:32:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:27,744 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2020-07-11 02:32:27,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:32:27,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2020-07-11 02:32:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:32:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2020-07-11 02:32:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:32:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2020-07-11 02:32:27,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 33 transitions. [2020-07-11 02:32:27,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:27,787 INFO L225 Difference]: With dead ends: 47 [2020-07-11 02:32:27,788 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:32:27,789 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-07-11 02:32:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:32:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:32:27,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:27,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:27,790 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:27,790 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:27,791 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:27,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:27,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:27,791 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:27,791 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:27,792 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:27,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:27,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:27,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:27,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:32:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:32:27,793 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2020-07-11 02:32:27,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:27,793 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:32:27,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 02:32:27,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:32:27,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-11 02:32:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:27,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:27,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:32:27,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:32:28,420 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:28,420 INFO L271 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-07-11 02:32:28,421 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-11 02:32:28,421 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-11 02:32:28,421 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:28,421 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:28,421 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:32:28,421 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:32:28,422 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:28,422 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-11 02:32:28,422 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-11 02:32:28,422 INFO L268 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2020-07-11 02:32:28,422 INFO L268 CegarLoopResult]: For program point L5-3(lines 4 6) no Hoare annotation was computed. [2020-07-11 02:32:28,422 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-11 02:32:28,423 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (and (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0) (<= (+ main_~main__x~0 50) main_~main__y~0)) [2020-07-11 02:32:28,423 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (not (= 0 main_~__VERIFIER_assert__cond~0)) [2020-07-11 02:32:28,423 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 12 72) the Hoare annotation is: (or (not (= 0 main_~__VERIFIER_assert__cond~0)) (and (<= (+ main_~main__x~0 50) 0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0))) [2020-07-11 02:32:28,423 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: false [2020-07-11 02:32:28,423 INFO L264 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (let ((.cse0 (not (= 0 main_~__tmp_1~0)))) (or (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0 (<= 2 main_~main__y~0)) (and (<= 19 main_~main__y~0) (<= (+ main_~main__x~0 56) (* 3 main_~main__y~0)) .cse0))) [2020-07-11 02:32:28,423 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (or (and (<= 19 main_~main__y~0) (<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))) (and (<= (+ main_~main__x~0 2) main_~main__y~0) (<= 2 main_~main__y~0))) [2020-07-11 02:32:28,424 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-11 02:32:28,424 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-11 02:32:28,424 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-11 02:32:28,424 INFO L264 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-11 02:32:28,424 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 12 72) the Hoare annotation is: (or (not (= 0 main_~__VERIFIER_assert__cond~0)) (and (<= (+ main_~main__x~0 50) 0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0))) [2020-07-11 02:32:28,424 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-11 02:32:28,424 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (<= (+ main_~main__x~0 1) main_~main__y~0) [2020-07-11 02:32:28,425 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~main__x~0 1) 0) (<= (+ main_~main__x~0 2) main_~main__y~0)) [2020-07-11 02:32:28,425 INFO L264 CegarLoopResult]: At program point L38(lines 38 64) the Hoare annotation is: (<= (+ main_~main__x~0 2) main_~main__y~0) [2020-07-11 02:32:28,425 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0) (<= (+ main_~main__x~0 50) main_~main__y~0)) [2020-07-11 02:32:28,425 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-11 02:32:28,425 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 55) the Hoare annotation is: false [2020-07-11 02:32:28,425 INFO L264 CegarLoopResult]: At program point L30(lines 30 69) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-11 02:32:28,426 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-11 02:32:28,426 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (not (= 0 main_~__VERIFIER_assert__cond~0)) [2020-07-11 02:32:28,426 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0) (<= 51 main_~main__y~0)) [2020-07-11 02:32:28,426 INFO L264 CegarLoopResult]: At program point L24(lines 24 70) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-11 02:32:28,426 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: false [2020-07-11 02:32:28,426 INFO L264 CegarLoopResult]: At program point L53(lines 53 62) the Hoare annotation is: (let ((.cse0 (not (= 0 main_~__VERIFIER_assert__cond~0))) (.cse1 (not (= 0 main_~__tmp_1~0)))) (or (and (<= 19 main_~main__y~0) .cse0 (<= (+ main_~main__x~0 56) (* 3 main_~main__y~0)) .cse1) (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0 .cse1 (<= 2 main_~main__y~0)))) [2020-07-11 02:32:28,426 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-11 02:32:28,426 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (not (= 0 main_~__tmp_1~0)))) (or (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0 (<= 2 main_~main__y~0)) (and (<= 19 main_~main__y~0) (<= (+ main_~main__x~0 56) (* 3 main_~main__y~0)) .cse0))) [2020-07-11 02:32:28,427 INFO L264 CegarLoopResult]: At program point L18(lines 18 71) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-11 02:32:28,427 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (or (and (<= 19 main_~main__y~0) (<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))) (and (<= (+ main_~main__x~0 2) main_~main__y~0) (<= 2 main_~main__y~0))) [2020-07-11 02:32:28,427 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0)) [2020-07-11 02:32:28,427 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (<= (+ main_~main__x~0 2) main_~main__y~0) [2020-07-11 02:32:28,427 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (<= (+ main_~main__x~0 1) main_~main__y~0) [2020-07-11 02:32:28,427 INFO L264 CegarLoopResult]: At program point L68(line 68) the Hoare annotation is: false [2020-07-11 02:32:28,427 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |old(~__return_65~0)| ~__return_65~0) (<= (+ main_~main__x~0 51) main_~main__y~0)) [2020-07-11 02:32:28,432 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:32:28,433 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:32:28,434 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:32:28,435 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2020-07-11 02:32:28,436 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2020-07-11 02:32:28,457 INFO L163 areAnnotationChecker]: CFG has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:32:28,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:32:28 BoogieIcfgContainer [2020-07-11 02:32:28,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:32:28,473 INFO L168 Benchmark]: Toolchain (without parser) took 6373.53 ms. Allocated memory was 137.9 MB in the beginning and 298.3 MB in the end (delta: 160.4 MB). Free memory was 103.0 MB in the beginning and 261.1 MB in the end (delta: -158.1 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:28,474 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 02:32:28,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.50 ms. Allocated memory is still 137.9 MB. Free memory was 102.8 MB in the beginning and 92.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:28,475 INFO L168 Benchmark]: Boogie Preprocessor took 130.27 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 92.6 MB in the beginning and 180.7 MB in the end (delta: -88.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:28,476 INFO L168 Benchmark]: RCFGBuilder took 529.48 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 158.9 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:28,477 INFO L168 Benchmark]: TraceAbstraction took 5471.05 ms. Allocated memory was 201.9 MB in the beginning and 298.3 MB in the end (delta: 96.5 MB). Free memory was 158.2 MB in the beginning and 261.1 MB in the end (delta: -102.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 02:32:28,481 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.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 237.50 ms. Allocated memory is still 137.9 MB. Free memory was 102.8 MB in the beginning and 92.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.27 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 92.6 MB in the beginning and 180.7 MB in the end (delta: -88.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 529.48 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 158.9 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5471.05 ms. Allocated memory was 201.9 MB in the beginning and 298.3 MB in the end (delta: 96.5 MB). Free memory was 158.2 MB in the beginning and 261.1 MB in the end (delta: -102.9 MB). There was no memory consumed. 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 - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: !(0 == __VERIFIER_assert__cond) || ((main__x + 50 <= 0 && __tmp_55_0 == \old(__tmp_55_0)) && \old(__return_65) == __return_65) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.7s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 103 SDtfs, 169 SDslu, 351 SDs, 0 SdLazy, 612 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 43 PreInvPairs, 84 NumberOfFragments, 405 HoareAnnotationTreeSize, 43 FomulaSimplifications, 262 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 43 FomulaSimplificationsInter, 269 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 18216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 24/36 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...