/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/recursive-simple/id2_i5_o5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:51:22,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:51:22,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:51:22,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:51:22,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:51:22,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:51:22,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:51:22,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:51:22,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:51:22,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:51:22,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:51:22,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:51:22,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:51:22,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:51:22,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:51:22,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:51:22,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:51:22,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:51:22,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:51:22,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:51:22,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:51:22,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:51:22,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:51:22,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:51:22,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:51:22,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:51:22,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:51:22,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:51:22,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:51:22,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:51:22,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:51:22,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:51:22,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:51:22,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:51:22,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:51:22,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:51:22,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:51:22,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:51:22,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:51:22,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:51:22,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:51:22,746 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 00:51:22,756 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:51:22,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:51:22,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:51:22,758 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:51:22,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:51:22,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:51:22,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:51:22,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:51:22,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:51:22,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:51:22,760 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:51:22,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:51:22,760 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:51:22,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:51:22,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:51:22,761 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:51:22,761 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:51:22,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:51:22,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:51:22,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:51:22,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:51:22,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:51:22,762 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 00:51:23,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:51:23,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:51:23,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:51:23,073 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:51:23,073 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:51:23,074 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2020-07-11 00:51:23,154 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a3356b0/04192e3cff70455c838926bbf82102fb/FLAGaf52ec553 [2020-07-11 00:51:23,631 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:51:23,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2020-07-11 00:51:23,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a3356b0/04192e3cff70455c838926bbf82102fb/FLAGaf52ec553 [2020-07-11 00:51:24,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a3356b0/04192e3cff70455c838926bbf82102fb [2020-07-11 00:51:24,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:51:24,045 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:51:24,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:51:24,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:51:24,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:51:24,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:24,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d25e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24, skipping insertion in model container [2020-07-11 00:51:24,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:24,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:51:24,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:51:24,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:51:24,263 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:51:24,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:51:24,292 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:51:24,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24 WrapperNode [2020-07-11 00:51:24,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:51:24,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:51:24,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:51:24,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:51:24,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:24,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:24,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:24,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:24,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:24,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:24,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:24,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:51:24,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:51:24,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:51:24,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:51:24,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:51:24,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:51:24,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:51:24,475 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-11 00:51:24,475 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-07-11 00:51:24,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:51:24,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:51:24,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:51:24,475 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-11 00:51:24,476 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-07-11 00:51:24,476 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:51:24,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:51:24,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:51:24,747 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:51:24,748 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:51:24,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:51:24 BoogieIcfgContainer [2020-07-11 00:51:24,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:51:24,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:51:24,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:51:24,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:51:24,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:51:24" (1/3) ... [2020-07-11 00:51:24,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69393107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:51:24, skipping insertion in model container [2020-07-11 00:51:24,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (2/3) ... [2020-07-11 00:51:24,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69393107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:51:24, skipping insertion in model container [2020-07-11 00:51:24,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:51:24" (3/3) ... [2020-07-11 00:51:24,763 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-1.c [2020-07-11 00:51:24,779 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:51:24,787 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:51:24,807 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:51:24,841 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:51:24,841 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:51:24,841 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:51:24,841 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:51:24,841 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:51:24,842 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:51:24,842 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:51:24,842 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:51:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-11 00:51:24,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-11 00:51:24,883 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:24,885 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:24,885 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:24,893 INFO L82 PathProgramCache]: Analyzing trace with hash -588914908, now seen corresponding path program 1 times [2020-07-11 00:51:24,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:24,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1833831840] [2020-07-11 00:51:24,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:25,146 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-11 00:51:25,147 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37#true} {37#true} #44#return; {37#true} is VALID [2020-07-11 00:51:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:25,201 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~x := #in~x; {47#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:25,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(= |id_#in~x| id_~x)} assume 0 == ~x; {48#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:25,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#(= 0 |id_#in~x|)} #res := 0; {48#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:25,206 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#(= 0 |id_#in~x|)} assume true; {48#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:25,209 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#(= 0 |id_#in~x|)} {41#(<= 5 main_~input~0)} #48#return; {38#false} is VALID [2020-07-11 00:51:25,210 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2020-07-11 00:51:25,211 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-11 00:51:25,211 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #44#return; {37#true} is VALID [2020-07-11 00:51:25,211 INFO L263 TraceCheckUtils]: 3: Hoare triple {37#true} call #t~ret3 := main(); {37#true} is VALID [2020-07-11 00:51:25,213 INFO L280 TraceCheckUtils]: 4: Hoare triple {37#true} ~input~0 := 5; {41#(<= 5 main_~input~0)} is VALID [2020-07-11 00:51:25,213 INFO L263 TraceCheckUtils]: 5: Hoare triple {41#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {37#true} is VALID [2020-07-11 00:51:25,215 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} ~x := #in~x; {47#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:25,218 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#(= |id_#in~x| id_~x)} assume 0 == ~x; {48#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:25,221 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#(= 0 |id_#in~x|)} #res := 0; {48#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:25,222 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#(= 0 |id_#in~x|)} assume true; {48#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:25,224 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#(= 0 |id_#in~x|)} {41#(<= 5 main_~input~0)} #48#return; {38#false} is VALID [2020-07-11 00:51:25,225 INFO L280 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {38#false} is VALID [2020-07-11 00:51:25,225 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} ~result~0 := #t~ret2; {38#false} is VALID [2020-07-11 00:51:25,226 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} havoc #t~ret2; {38#false} is VALID [2020-07-11 00:51:25,226 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} assume 5 == ~result~0; {38#false} is VALID [2020-07-11 00:51:25,227 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-11 00:51:25,229 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 00:51:25,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1833831840] [2020-07-11 00:51:25,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:51:25,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:51:25,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768237281] [2020-07-11 00:51:25,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-11 00:51:25,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:25,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:51:25,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:25,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:51:25,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:25,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:51:25,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:51:25,310 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2020-07-11 00:51:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:25,591 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-11 00:51:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:51:25,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-11 00:51:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-11 00:51:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-11 00:51:25,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-11 00:51:25,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:25,710 INFO L225 Difference]: With dead ends: 46 [2020-07-11 00:51:25,710 INFO L226 Difference]: Without dead ends: 32 [2020-07-11 00:51:25,714 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:51:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-11 00:51:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-11 00:51:25,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:25,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-11 00:51:25,813 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-11 00:51:25,814 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-11 00:51:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:25,821 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-11 00:51:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-11 00:51:25,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:25,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:25,822 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-11 00:51:25,823 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-11 00:51:25,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:25,828 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-11 00:51:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-11 00:51:25,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:25,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:25,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:25,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-11 00:51:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-11 00:51:25,835 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 16 [2020-07-11 00:51:25,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:25,836 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-11 00:51:25,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:51:25,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-11 00:51:25,884 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 00:51:25,884 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-11 00:51:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 00:51:25,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:25,886 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] [2020-07-11 00:51:25,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:51:25,887 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:25,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1852809946, now seen corresponding path program 1 times [2020-07-11 00:51:25,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:25,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [423705326] [2020-07-11 00:51:25,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:25,939 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} assume true; {273#true} is VALID [2020-07-11 00:51:25,939 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2020-07-11 00:51:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:26,024 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:26,025 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,027 INFO L280 TraceCheckUtils]: 3: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,028 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} ~x := #in~x; {291#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,030 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#(= |id_#in~x| id_~x)} assume !(0 == ~x); {291#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,031 INFO L263 TraceCheckUtils]: 2: Hoare triple {291#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {273#true} is VALID [2020-07-11 00:51:26,031 INFO L280 TraceCheckUtils]: 3: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:26,032 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,033 INFO L280 TraceCheckUtils]: 5: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,034 INFO L280 TraceCheckUtils]: 6: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,036 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,036 INFO L280 TraceCheckUtils]: 8: Hoare triple {297#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,037 INFO L280 TraceCheckUtils]: 9: Hoare triple {297#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,038 INFO L280 TraceCheckUtils]: 10: Hoare triple {297#(<= |id_#in~x| 1)} havoc #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,039 INFO L280 TraceCheckUtils]: 11: Hoare triple {297#(<= |id_#in~x| 1)} assume true; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,040 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {297#(<= |id_#in~x| 1)} {277#(<= 5 main_~input~0)} #48#return; {274#false} is VALID [2020-07-11 00:51:26,041 INFO L263 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2020-07-11 00:51:26,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {273#true} assume true; {273#true} is VALID [2020-07-11 00:51:26,042 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2020-07-11 00:51:26,042 INFO L263 TraceCheckUtils]: 3: Hoare triple {273#true} call #t~ret3 := main(); {273#true} is VALID [2020-07-11 00:51:26,043 INFO L280 TraceCheckUtils]: 4: Hoare triple {273#true} ~input~0 := 5; {277#(<= 5 main_~input~0)} is VALID [2020-07-11 00:51:26,044 INFO L263 TraceCheckUtils]: 5: Hoare triple {277#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {273#true} is VALID [2020-07-11 00:51:26,045 INFO L280 TraceCheckUtils]: 6: Hoare triple {273#true} ~x := #in~x; {291#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {291#(= |id_#in~x| id_~x)} assume !(0 == ~x); {291#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,046 INFO L263 TraceCheckUtils]: 8: Hoare triple {291#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {273#true} is VALID [2020-07-11 00:51:26,047 INFO L280 TraceCheckUtils]: 9: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:26,047 INFO L280 TraceCheckUtils]: 10: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,048 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,049 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,050 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,051 INFO L280 TraceCheckUtils]: 14: Hoare triple {297#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,052 INFO L280 TraceCheckUtils]: 15: Hoare triple {297#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,053 INFO L280 TraceCheckUtils]: 16: Hoare triple {297#(<= |id_#in~x| 1)} havoc #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,053 INFO L280 TraceCheckUtils]: 17: Hoare triple {297#(<= |id_#in~x| 1)} assume true; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,055 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {297#(<= |id_#in~x| 1)} {277#(<= 5 main_~input~0)} #48#return; {274#false} is VALID [2020-07-11 00:51:26,055 INFO L280 TraceCheckUtils]: 19: Hoare triple {274#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {274#false} is VALID [2020-07-11 00:51:26,056 INFO L280 TraceCheckUtils]: 20: Hoare triple {274#false} ~result~0 := #t~ret2; {274#false} is VALID [2020-07-11 00:51:26,056 INFO L280 TraceCheckUtils]: 21: Hoare triple {274#false} havoc #t~ret2; {274#false} is VALID [2020-07-11 00:51:26,056 INFO L280 TraceCheckUtils]: 22: Hoare triple {274#false} assume 5 == ~result~0; {274#false} is VALID [2020-07-11 00:51:26,056 INFO L280 TraceCheckUtils]: 23: Hoare triple {274#false} assume !false; {274#false} is VALID [2020-07-11 00:51:26,058 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 00:51:26,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [423705326] [2020-07-11 00:51:26,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:51:26,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 00:51:26,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851364303] [2020-07-11 00:51:26,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 00:51:26,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:26,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:51:26,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:26,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:51:26,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:26,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:51:26,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:51:26,094 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2020-07-11 00:51:26,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:26,402 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-11 00:51:26,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 00:51:26,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 00:51:26,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:51:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-11 00:51:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:51:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-11 00:51:26,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2020-07-11 00:51:26,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:26,475 INFO L225 Difference]: With dead ends: 45 [2020-07-11 00:51:26,475 INFO L226 Difference]: Without dead ends: 39 [2020-07-11 00:51:26,476 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-11 00:51:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-11 00:51:26,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-11 00:51:26,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:26,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2020-07-11 00:51:26,532 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2020-07-11 00:51:26,532 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2020-07-11 00:51:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:26,537 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-11 00:51:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-11 00:51:26,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:26,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:26,539 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2020-07-11 00:51:26,539 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2020-07-11 00:51:26,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:26,543 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-11 00:51:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-11 00:51:26,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:26,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:26,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:26,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-11 00:51:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-07-11 00:51:26,549 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2020-07-11 00:51:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:26,549 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-07-11 00:51:26,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:51:26,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2020-07-11 00:51:26,618 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 00:51:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-11 00:51:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-11 00:51:26,620 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:26,621 INFO L422 BasicCegarLoop]: trace histogram [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, 1] [2020-07-11 00:51:26,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:51:26,621 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:26,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:26,622 INFO L82 PathProgramCache]: Analyzing trace with hash -238705980, now seen corresponding path program 1 times [2020-07-11 00:51:26,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:26,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [738885434] [2020-07-11 00:51:26,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:26,714 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} assume true; {548#true} is VALID [2020-07-11 00:51:26,715 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {548#true} {548#true} #44#return; {548#true} is VALID [2020-07-11 00:51:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:26,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:26,889 INFO L280 TraceCheckUtils]: 2: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:26,889 INFO L280 TraceCheckUtils]: 3: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:26,891 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {596#(= 0 |id_#in~x|)} {589#(= id2_~x |id2_#in~x|)} #42#return; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,892 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} ~x := #in~x; {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:26,893 INFO L280 TraceCheckUtils]: 1: Hoare triple {589#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:26,893 INFO L263 TraceCheckUtils]: 2: Hoare triple {589#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {548#true} is VALID [2020-07-11 00:51:26,894 INFO L280 TraceCheckUtils]: 3: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,894 INFO L280 TraceCheckUtils]: 4: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:26,895 INFO L280 TraceCheckUtils]: 5: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:26,896 INFO L280 TraceCheckUtils]: 6: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:26,897 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {596#(= 0 |id_#in~x|)} {589#(= id2_~x |id2_#in~x|)} #42#return; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,898 INFO L280 TraceCheckUtils]: 8: Hoare triple {595#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,899 INFO L280 TraceCheckUtils]: 9: Hoare triple {595#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,900 INFO L280 TraceCheckUtils]: 10: Hoare triple {595#(<= |id2_#in~x| 1)} havoc #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,900 INFO L280 TraceCheckUtils]: 11: Hoare triple {595#(<= |id2_#in~x| 1)} assume true; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,902 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {595#(<= |id2_#in~x| 1)} {574#(= |id_#in~x| id_~x)} #50#return; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:26,903 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {574#(= |id_#in~x| id_~x)} assume !(0 == ~x); {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,904 INFO L263 TraceCheckUtils]: 2: Hoare triple {574#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {548#true} is VALID [2020-07-11 00:51:26,905 INFO L280 TraceCheckUtils]: 3: Hoare triple {548#true} ~x := #in~x; {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:26,906 INFO L280 TraceCheckUtils]: 4: Hoare triple {589#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:26,906 INFO L263 TraceCheckUtils]: 5: Hoare triple {589#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {548#true} is VALID [2020-07-11 00:51:26,907 INFO L280 TraceCheckUtils]: 6: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,907 INFO L280 TraceCheckUtils]: 7: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:26,908 INFO L280 TraceCheckUtils]: 8: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:26,909 INFO L280 TraceCheckUtils]: 9: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:26,910 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {596#(= 0 |id_#in~x|)} {589#(= id2_~x |id2_#in~x|)} #42#return; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,911 INFO L280 TraceCheckUtils]: 11: Hoare triple {595#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,912 INFO L280 TraceCheckUtils]: 12: Hoare triple {595#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,912 INFO L280 TraceCheckUtils]: 13: Hoare triple {595#(<= |id2_#in~x| 1)} havoc #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,913 INFO L280 TraceCheckUtils]: 14: Hoare triple {595#(<= |id2_#in~x| 1)} assume true; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,914 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {595#(<= |id2_#in~x| 1)} {574#(= |id_#in~x| id_~x)} #50#return; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:26,915 INFO L280 TraceCheckUtils]: 16: Hoare triple {588#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:26,916 INFO L280 TraceCheckUtils]: 17: Hoare triple {588#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:26,917 INFO L280 TraceCheckUtils]: 18: Hoare triple {588#(<= |id_#in~x| 2)} havoc #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:26,917 INFO L280 TraceCheckUtils]: 19: Hoare triple {588#(<= |id_#in~x| 2)} assume true; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:26,918 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {588#(<= |id_#in~x| 2)} {552#(<= 5 main_~input~0)} #48#return; {549#false} is VALID [2020-07-11 00:51:26,920 INFO L263 TraceCheckUtils]: 0: Hoare triple {548#true} call ULTIMATE.init(); {548#true} is VALID [2020-07-11 00:51:26,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {548#true} assume true; {548#true} is VALID [2020-07-11 00:51:26,920 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {548#true} {548#true} #44#return; {548#true} is VALID [2020-07-11 00:51:26,920 INFO L263 TraceCheckUtils]: 3: Hoare triple {548#true} call #t~ret3 := main(); {548#true} is VALID [2020-07-11 00:51:26,922 INFO L280 TraceCheckUtils]: 4: Hoare triple {548#true} ~input~0 := 5; {552#(<= 5 main_~input~0)} is VALID [2020-07-11 00:51:26,923 INFO L263 TraceCheckUtils]: 5: Hoare triple {552#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {548#true} is VALID [2020-07-11 00:51:26,924 INFO L280 TraceCheckUtils]: 6: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,924 INFO L280 TraceCheckUtils]: 7: Hoare triple {574#(= |id_#in~x| id_~x)} assume !(0 == ~x); {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,925 INFO L263 TraceCheckUtils]: 8: Hoare triple {574#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {548#true} is VALID [2020-07-11 00:51:26,925 INFO L280 TraceCheckUtils]: 9: Hoare triple {548#true} ~x := #in~x; {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:26,926 INFO L280 TraceCheckUtils]: 10: Hoare triple {589#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:26,926 INFO L263 TraceCheckUtils]: 11: Hoare triple {589#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {548#true} is VALID [2020-07-11 00:51:26,927 INFO L280 TraceCheckUtils]: 12: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,928 INFO L280 TraceCheckUtils]: 13: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:26,929 INFO L280 TraceCheckUtils]: 14: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:26,930 INFO L280 TraceCheckUtils]: 15: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:26,931 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {596#(= 0 |id_#in~x|)} {589#(= id2_~x |id2_#in~x|)} #42#return; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,932 INFO L280 TraceCheckUtils]: 17: Hoare triple {595#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,933 INFO L280 TraceCheckUtils]: 18: Hoare triple {595#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,933 INFO L280 TraceCheckUtils]: 19: Hoare triple {595#(<= |id2_#in~x| 1)} havoc #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,934 INFO L280 TraceCheckUtils]: 20: Hoare triple {595#(<= |id2_#in~x| 1)} assume true; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:26,935 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {595#(<= |id2_#in~x| 1)} {574#(= |id_#in~x| id_~x)} #50#return; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:26,936 INFO L280 TraceCheckUtils]: 22: Hoare triple {588#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:26,937 INFO L280 TraceCheckUtils]: 23: Hoare triple {588#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:26,937 INFO L280 TraceCheckUtils]: 24: Hoare triple {588#(<= |id_#in~x| 2)} havoc #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:26,938 INFO L280 TraceCheckUtils]: 25: Hoare triple {588#(<= |id_#in~x| 2)} assume true; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:26,939 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {588#(<= |id_#in~x| 2)} {552#(<= 5 main_~input~0)} #48#return; {549#false} is VALID [2020-07-11 00:51:26,939 INFO L280 TraceCheckUtils]: 27: Hoare triple {549#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {549#false} is VALID [2020-07-11 00:51:26,940 INFO L280 TraceCheckUtils]: 28: Hoare triple {549#false} ~result~0 := #t~ret2; {549#false} is VALID [2020-07-11 00:51:26,940 INFO L280 TraceCheckUtils]: 29: Hoare triple {549#false} havoc #t~ret2; {549#false} is VALID [2020-07-11 00:51:26,940 INFO L280 TraceCheckUtils]: 30: Hoare triple {549#false} assume 5 == ~result~0; {549#false} is VALID [2020-07-11 00:51:26,940 INFO L280 TraceCheckUtils]: 31: Hoare triple {549#false} assume !false; {549#false} is VALID [2020-07-11 00:51:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-11 00:51:26,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [738885434] [2020-07-11 00:51:26,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:26,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 00:51:26,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269694702] [2020-07-11 00:51:26,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-11 00:51:26,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:26,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:51:26,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:26,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:51:26,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:26,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:51:26,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:51:26,983 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 8 states. [2020-07-11 00:51:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:27,326 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-11 00:51:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 00:51:27,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-11 00:51:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:51:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-11 00:51:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:51:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-11 00:51:27,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2020-07-11 00:51:27,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:27,398 INFO L225 Difference]: With dead ends: 55 [2020-07-11 00:51:27,398 INFO L226 Difference]: Without dead ends: 49 [2020-07-11 00:51:27,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-11 00:51:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-11 00:51:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2020-07-11 00:51:27,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:27,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 42 states. [2020-07-11 00:51:27,452 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 42 states. [2020-07-11 00:51:27,452 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 42 states. [2020-07-11 00:51:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:27,456 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-11 00:51:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-11 00:51:27,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:27,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:27,458 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 49 states. [2020-07-11 00:51:27,458 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 49 states. [2020-07-11 00:51:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:27,461 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-11 00:51:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-11 00:51:27,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:27,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:27,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:27,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-11 00:51:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-11 00:51:27,465 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 32 [2020-07-11 00:51:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:27,466 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-11 00:51:27,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:51:27,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2020-07-11 00:51:27,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-11 00:51:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-11 00:51:27,520 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:27,520 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2020-07-11 00:51:27,521 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:51:27,521 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:27,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2006293766, now seen corresponding path program 1 times [2020-07-11 00:51:27,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:27,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [146658153] [2020-07-11 00:51:27,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:27,562 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} assume true; {897#true} is VALID [2020-07-11 00:51:27,563 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {897#true} {897#true} #44#return; {897#true} is VALID [2020-07-11 00:51:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:27,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,734 INFO L280 TraceCheckUtils]: 2: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,735 INFO L280 TraceCheckUtils]: 3: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,736 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,737 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,738 INFO L263 TraceCheckUtils]: 2: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-11 00:51:27,739 INFO L280 TraceCheckUtils]: 3: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,739 INFO L280 TraceCheckUtils]: 4: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,740 INFO L280 TraceCheckUtils]: 5: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,741 INFO L280 TraceCheckUtils]: 6: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,742 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,742 INFO L280 TraceCheckUtils]: 8: Hoare triple {974#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,743 INFO L280 TraceCheckUtils]: 9: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,743 INFO L280 TraceCheckUtils]: 10: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,744 INFO L280 TraceCheckUtils]: 11: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,746 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {974#(<= |id_#in~x| 1)} {954#(= id2_~x |id2_#in~x|)} #42#return; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,747 INFO L280 TraceCheckUtils]: 1: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,748 INFO L263 TraceCheckUtils]: 2: Hoare triple {954#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {897#true} is VALID [2020-07-11 00:51:27,748 INFO L280 TraceCheckUtils]: 3: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,749 INFO L280 TraceCheckUtils]: 4: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,749 INFO L263 TraceCheckUtils]: 5: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-11 00:51:27,750 INFO L280 TraceCheckUtils]: 6: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,750 INFO L280 TraceCheckUtils]: 7: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,751 INFO L280 TraceCheckUtils]: 8: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,752 INFO L280 TraceCheckUtils]: 9: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,753 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,753 INFO L280 TraceCheckUtils]: 11: Hoare triple {974#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,754 INFO L280 TraceCheckUtils]: 12: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,754 INFO L280 TraceCheckUtils]: 13: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,755 INFO L280 TraceCheckUtils]: 14: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,756 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {974#(<= |id_#in~x| 1)} {954#(= id2_~x |id2_#in~x|)} #42#return; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,757 INFO L280 TraceCheckUtils]: 16: Hoare triple {968#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,758 INFO L280 TraceCheckUtils]: 17: Hoare triple {968#(<= |id2_#in~x| 2)} #res := 1 + #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,758 INFO L280 TraceCheckUtils]: 18: Hoare triple {968#(<= |id2_#in~x| 2)} havoc #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,759 INFO L280 TraceCheckUtils]: 19: Hoare triple {968#(<= |id2_#in~x| 2)} assume true; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,760 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {968#(<= |id2_#in~x| 2)} {931#(= |id_#in~x| id_~x)} #50#return; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:27,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,762 INFO L263 TraceCheckUtils]: 2: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-11 00:51:27,763 INFO L280 TraceCheckUtils]: 3: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,764 INFO L280 TraceCheckUtils]: 4: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,764 INFO L263 TraceCheckUtils]: 5: Hoare triple {954#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {897#true} is VALID [2020-07-11 00:51:27,765 INFO L280 TraceCheckUtils]: 6: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,765 INFO L280 TraceCheckUtils]: 7: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,765 INFO L263 TraceCheckUtils]: 8: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-11 00:51:27,766 INFO L280 TraceCheckUtils]: 9: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,767 INFO L280 TraceCheckUtils]: 10: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,767 INFO L280 TraceCheckUtils]: 11: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,768 INFO L280 TraceCheckUtils]: 12: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,769 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,770 INFO L280 TraceCheckUtils]: 14: Hoare triple {974#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,770 INFO L280 TraceCheckUtils]: 15: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,771 INFO L280 TraceCheckUtils]: 16: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,771 INFO L280 TraceCheckUtils]: 17: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,773 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {974#(<= |id_#in~x| 1)} {954#(= id2_~x |id2_#in~x|)} #42#return; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,773 INFO L280 TraceCheckUtils]: 19: Hoare triple {968#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,774 INFO L280 TraceCheckUtils]: 20: Hoare triple {968#(<= |id2_#in~x| 2)} #res := 1 + #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,774 INFO L280 TraceCheckUtils]: 21: Hoare triple {968#(<= |id2_#in~x| 2)} havoc #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,775 INFO L280 TraceCheckUtils]: 22: Hoare triple {968#(<= |id2_#in~x| 2)} assume true; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,776 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {968#(<= |id2_#in~x| 2)} {931#(= |id_#in~x| id_~x)} #50#return; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:27,777 INFO L280 TraceCheckUtils]: 24: Hoare triple {953#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:27,778 INFO L280 TraceCheckUtils]: 25: Hoare triple {953#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:27,778 INFO L280 TraceCheckUtils]: 26: Hoare triple {953#(<= |id_#in~x| 3)} havoc #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:27,779 INFO L280 TraceCheckUtils]: 27: Hoare triple {953#(<= |id_#in~x| 3)} assume true; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:27,780 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {953#(<= |id_#in~x| 3)} {901#(<= 5 main_~input~0)} #48#return; {898#false} is VALID [2020-07-11 00:51:27,782 INFO L263 TraceCheckUtils]: 0: Hoare triple {897#true} call ULTIMATE.init(); {897#true} is VALID [2020-07-11 00:51:27,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {897#true} assume true; {897#true} is VALID [2020-07-11 00:51:27,782 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {897#true} {897#true} #44#return; {897#true} is VALID [2020-07-11 00:51:27,782 INFO L263 TraceCheckUtils]: 3: Hoare triple {897#true} call #t~ret3 := main(); {897#true} is VALID [2020-07-11 00:51:27,783 INFO L280 TraceCheckUtils]: 4: Hoare triple {897#true} ~input~0 := 5; {901#(<= 5 main_~input~0)} is VALID [2020-07-11 00:51:27,783 INFO L263 TraceCheckUtils]: 5: Hoare triple {901#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {897#true} is VALID [2020-07-11 00:51:27,784 INFO L280 TraceCheckUtils]: 6: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,785 INFO L280 TraceCheckUtils]: 7: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,785 INFO L263 TraceCheckUtils]: 8: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-11 00:51:27,785 INFO L280 TraceCheckUtils]: 9: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,786 INFO L280 TraceCheckUtils]: 10: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,786 INFO L263 TraceCheckUtils]: 11: Hoare triple {954#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {897#true} is VALID [2020-07-11 00:51:27,787 INFO L280 TraceCheckUtils]: 12: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,788 INFO L280 TraceCheckUtils]: 13: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,788 INFO L263 TraceCheckUtils]: 14: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-11 00:51:27,788 INFO L280 TraceCheckUtils]: 15: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,789 INFO L280 TraceCheckUtils]: 16: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,790 INFO L280 TraceCheckUtils]: 17: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,790 INFO L280 TraceCheckUtils]: 18: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:27,791 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,792 INFO L280 TraceCheckUtils]: 20: Hoare triple {974#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,793 INFO L280 TraceCheckUtils]: 21: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,793 INFO L280 TraceCheckUtils]: 22: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,794 INFO L280 TraceCheckUtils]: 23: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:27,795 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {974#(<= |id_#in~x| 1)} {954#(= id2_~x |id2_#in~x|)} #42#return; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,796 INFO L280 TraceCheckUtils]: 25: Hoare triple {968#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,796 INFO L280 TraceCheckUtils]: 26: Hoare triple {968#(<= |id2_#in~x| 2)} #res := 1 + #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,797 INFO L280 TraceCheckUtils]: 27: Hoare triple {968#(<= |id2_#in~x| 2)} havoc #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,797 INFO L280 TraceCheckUtils]: 28: Hoare triple {968#(<= |id2_#in~x| 2)} assume true; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:27,799 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {968#(<= |id2_#in~x| 2)} {931#(= |id_#in~x| id_~x)} #50#return; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:27,799 INFO L280 TraceCheckUtils]: 30: Hoare triple {953#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:27,800 INFO L280 TraceCheckUtils]: 31: Hoare triple {953#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:27,801 INFO L280 TraceCheckUtils]: 32: Hoare triple {953#(<= |id_#in~x| 3)} havoc #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:27,801 INFO L280 TraceCheckUtils]: 33: Hoare triple {953#(<= |id_#in~x| 3)} assume true; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:27,802 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {953#(<= |id_#in~x| 3)} {901#(<= 5 main_~input~0)} #48#return; {898#false} is VALID [2020-07-11 00:51:27,803 INFO L280 TraceCheckUtils]: 35: Hoare triple {898#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {898#false} is VALID [2020-07-11 00:51:27,803 INFO L280 TraceCheckUtils]: 36: Hoare triple {898#false} ~result~0 := #t~ret2; {898#false} is VALID [2020-07-11 00:51:27,803 INFO L280 TraceCheckUtils]: 37: Hoare triple {898#false} havoc #t~ret2; {898#false} is VALID [2020-07-11 00:51:27,803 INFO L280 TraceCheckUtils]: 38: Hoare triple {898#false} assume 5 == ~result~0; {898#false} is VALID [2020-07-11 00:51:27,804 INFO L280 TraceCheckUtils]: 39: Hoare triple {898#false} assume !false; {898#false} is VALID [2020-07-11 00:51:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-11 00:51:27,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [146658153] [2020-07-11 00:51:27,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:27,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-11 00:51:27,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430063947] [2020-07-11 00:51:27,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-07-11 00:51:27,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:27,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 00:51:27,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:27,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 00:51:27,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:27,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 00:51:27,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-11 00:51:27,848 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 9 states. [2020-07-11 00:51:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:28,232 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-07-11 00:51:28,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 00:51:28,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-07-11 00:51:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 00:51:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-11 00:51:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 00:51:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-11 00:51:28,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2020-07-11 00:51:28,300 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 00:51:28,302 INFO L225 Difference]: With dead ends: 65 [2020-07-11 00:51:28,303 INFO L226 Difference]: Without dead ends: 59 [2020-07-11 00:51:28,304 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-07-11 00:51:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-11 00:51:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-07-11 00:51:28,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:28,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 47 states. [2020-07-11 00:51:28,370 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 47 states. [2020-07-11 00:51:28,370 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 47 states. [2020-07-11 00:51:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:28,373 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-11 00:51:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-11 00:51:28,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:28,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:28,374 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 59 states. [2020-07-11 00:51:28,374 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 59 states. [2020-07-11 00:51:28,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:28,377 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-11 00:51:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-11 00:51:28,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:28,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:28,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:28,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-11 00:51:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2020-07-11 00:51:28,381 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 40 [2020-07-11 00:51:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:28,381 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2020-07-11 00:51:28,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 00:51:28,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2020-07-11 00:51:28,457 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 00:51:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-07-11 00:51:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-11 00:51:28,458 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:28,459 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:28,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:51:28,459 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash 940355172, now seen corresponding path program 2 times [2020-07-11 00:51:28,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:28,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [291388314] [2020-07-11 00:51:28,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:28,523 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} assume true; {1328#true} is VALID [2020-07-11 00:51:28,524 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1328#true} {1328#true} #44#return; {1328#true} is VALID [2020-07-11 00:51:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:28,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,680 INFO L280 TraceCheckUtils]: 2: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,681 INFO L280 TraceCheckUtils]: 3: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,682 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,684 INFO L280 TraceCheckUtils]: 1: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,684 INFO L263 TraceCheckUtils]: 2: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,685 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,685 INFO L280 TraceCheckUtils]: 4: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,686 INFO L280 TraceCheckUtils]: 5: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,686 INFO L280 TraceCheckUtils]: 6: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,687 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,688 INFO L280 TraceCheckUtils]: 8: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,689 INFO L280 TraceCheckUtils]: 9: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,689 INFO L280 TraceCheckUtils]: 10: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,690 INFO L280 TraceCheckUtils]: 11: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,691 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,693 INFO L263 TraceCheckUtils]: 2: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,693 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,694 INFO L280 TraceCheckUtils]: 4: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,694 INFO L263 TraceCheckUtils]: 5: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,695 INFO L280 TraceCheckUtils]: 7: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,696 INFO L280 TraceCheckUtils]: 8: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,697 INFO L280 TraceCheckUtils]: 9: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,698 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,699 INFO L280 TraceCheckUtils]: 11: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,699 INFO L280 TraceCheckUtils]: 12: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,700 INFO L280 TraceCheckUtils]: 13: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,700 INFO L280 TraceCheckUtils]: 14: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,701 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,702 INFO L280 TraceCheckUtils]: 16: Hoare triple {1437#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,702 INFO L280 TraceCheckUtils]: 17: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,705 INFO L280 TraceCheckUtils]: 18: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,706 INFO L280 TraceCheckUtils]: 19: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,707 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1437#(<= |id_#in~x| 2)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,716 INFO L263 TraceCheckUtils]: 2: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,717 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,717 INFO L280 TraceCheckUtils]: 4: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,717 INFO L263 TraceCheckUtils]: 5: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,718 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,719 INFO L280 TraceCheckUtils]: 7: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,719 INFO L263 TraceCheckUtils]: 8: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,719 INFO L280 TraceCheckUtils]: 9: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,720 INFO L280 TraceCheckUtils]: 10: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,721 INFO L280 TraceCheckUtils]: 11: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,721 INFO L280 TraceCheckUtils]: 12: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,722 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,723 INFO L280 TraceCheckUtils]: 14: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,724 INFO L280 TraceCheckUtils]: 15: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,724 INFO L280 TraceCheckUtils]: 16: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,725 INFO L280 TraceCheckUtils]: 17: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,726 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,727 INFO L280 TraceCheckUtils]: 19: Hoare triple {1437#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,728 INFO L280 TraceCheckUtils]: 20: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,728 INFO L280 TraceCheckUtils]: 21: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,729 INFO L280 TraceCheckUtils]: 22: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,730 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1437#(<= |id_#in~x| 2)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,731 INFO L280 TraceCheckUtils]: 24: Hoare triple {1423#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,731 INFO L280 TraceCheckUtils]: 25: Hoare triple {1423#(<= |id2_#in~x| 3)} #res := 1 + #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,732 INFO L280 TraceCheckUtils]: 26: Hoare triple {1423#(<= |id2_#in~x| 3)} havoc #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,733 INFO L280 TraceCheckUtils]: 27: Hoare triple {1423#(<= |id2_#in~x| 3)} assume true; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,734 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1423#(<= |id2_#in~x| 3)} {1370#(= |id_#in~x| id_~x)} #50#return; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:28,735 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,736 INFO L263 TraceCheckUtils]: 2: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,737 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,738 INFO L263 TraceCheckUtils]: 5: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,738 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,739 INFO L280 TraceCheckUtils]: 7: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,739 INFO L263 TraceCheckUtils]: 8: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,740 INFO L280 TraceCheckUtils]: 9: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,740 INFO L280 TraceCheckUtils]: 10: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,741 INFO L263 TraceCheckUtils]: 11: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,741 INFO L280 TraceCheckUtils]: 12: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,742 INFO L280 TraceCheckUtils]: 13: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,742 INFO L280 TraceCheckUtils]: 14: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,743 INFO L280 TraceCheckUtils]: 15: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,744 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,745 INFO L280 TraceCheckUtils]: 17: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,745 INFO L280 TraceCheckUtils]: 18: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,746 INFO L280 TraceCheckUtils]: 19: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,746 INFO L280 TraceCheckUtils]: 20: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,748 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,748 INFO L280 TraceCheckUtils]: 22: Hoare triple {1437#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,749 INFO L280 TraceCheckUtils]: 23: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,750 INFO L280 TraceCheckUtils]: 24: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,750 INFO L280 TraceCheckUtils]: 25: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,752 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1437#(<= |id_#in~x| 2)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,752 INFO L280 TraceCheckUtils]: 27: Hoare triple {1423#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,753 INFO L280 TraceCheckUtils]: 28: Hoare triple {1423#(<= |id2_#in~x| 3)} #res := 1 + #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,753 INFO L280 TraceCheckUtils]: 29: Hoare triple {1423#(<= |id2_#in~x| 3)} havoc #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,754 INFO L280 TraceCheckUtils]: 30: Hoare triple {1423#(<= |id2_#in~x| 3)} assume true; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,755 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1423#(<= |id2_#in~x| 3)} {1370#(= |id_#in~x| id_~x)} #50#return; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:28,756 INFO L280 TraceCheckUtils]: 32: Hoare triple {1400#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:28,757 INFO L280 TraceCheckUtils]: 33: Hoare triple {1400#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:28,757 INFO L280 TraceCheckUtils]: 34: Hoare triple {1400#(<= |id_#in~x| 4)} havoc #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:28,758 INFO L280 TraceCheckUtils]: 35: Hoare triple {1400#(<= |id_#in~x| 4)} assume true; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:28,760 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1400#(<= |id_#in~x| 4)} {1332#(<= 5 main_~input~0)} #48#return; {1329#false} is VALID [2020-07-11 00:51:28,762 INFO L263 TraceCheckUtils]: 0: Hoare triple {1328#true} call ULTIMATE.init(); {1328#true} is VALID [2020-07-11 00:51:28,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {1328#true} assume true; {1328#true} is VALID [2020-07-11 00:51:28,763 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1328#true} {1328#true} #44#return; {1328#true} is VALID [2020-07-11 00:51:28,763 INFO L263 TraceCheckUtils]: 3: Hoare triple {1328#true} call #t~ret3 := main(); {1328#true} is VALID [2020-07-11 00:51:28,766 INFO L280 TraceCheckUtils]: 4: Hoare triple {1328#true} ~input~0 := 5; {1332#(<= 5 main_~input~0)} is VALID [2020-07-11 00:51:28,767 INFO L263 TraceCheckUtils]: 5: Hoare triple {1332#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {1328#true} is VALID [2020-07-11 00:51:28,768 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,770 INFO L280 TraceCheckUtils]: 7: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,771 INFO L263 TraceCheckUtils]: 8: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,771 INFO L280 TraceCheckUtils]: 9: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,772 INFO L280 TraceCheckUtils]: 10: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,772 INFO L263 TraceCheckUtils]: 11: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,773 INFO L280 TraceCheckUtils]: 12: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,773 INFO L280 TraceCheckUtils]: 13: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,773 INFO L263 TraceCheckUtils]: 14: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,774 INFO L280 TraceCheckUtils]: 15: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,774 INFO L280 TraceCheckUtils]: 16: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,775 INFO L263 TraceCheckUtils]: 17: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:28,775 INFO L280 TraceCheckUtils]: 18: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,776 INFO L280 TraceCheckUtils]: 19: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,777 INFO L280 TraceCheckUtils]: 20: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,777 INFO L280 TraceCheckUtils]: 21: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:28,778 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,779 INFO L280 TraceCheckUtils]: 23: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,780 INFO L280 TraceCheckUtils]: 24: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,780 INFO L280 TraceCheckUtils]: 25: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,781 INFO L280 TraceCheckUtils]: 26: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:28,782 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,783 INFO L280 TraceCheckUtils]: 28: Hoare triple {1437#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,783 INFO L280 TraceCheckUtils]: 29: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,784 INFO L280 TraceCheckUtils]: 30: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,784 INFO L280 TraceCheckUtils]: 31: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:28,786 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1437#(<= |id_#in~x| 2)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,786 INFO L280 TraceCheckUtils]: 33: Hoare triple {1423#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,787 INFO L280 TraceCheckUtils]: 34: Hoare triple {1423#(<= |id2_#in~x| 3)} #res := 1 + #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,787 INFO L280 TraceCheckUtils]: 35: Hoare triple {1423#(<= |id2_#in~x| 3)} havoc #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,788 INFO L280 TraceCheckUtils]: 36: Hoare triple {1423#(<= |id2_#in~x| 3)} assume true; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:28,789 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1423#(<= |id2_#in~x| 3)} {1370#(= |id_#in~x| id_~x)} #50#return; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:28,790 INFO L280 TraceCheckUtils]: 38: Hoare triple {1400#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:28,790 INFO L280 TraceCheckUtils]: 39: Hoare triple {1400#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:28,791 INFO L280 TraceCheckUtils]: 40: Hoare triple {1400#(<= |id_#in~x| 4)} havoc #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:28,791 INFO L280 TraceCheckUtils]: 41: Hoare triple {1400#(<= |id_#in~x| 4)} assume true; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:28,793 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1400#(<= |id_#in~x| 4)} {1332#(<= 5 main_~input~0)} #48#return; {1329#false} is VALID [2020-07-11 00:51:28,793 INFO L280 TraceCheckUtils]: 43: Hoare triple {1329#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1329#false} is VALID [2020-07-11 00:51:28,793 INFO L280 TraceCheckUtils]: 44: Hoare triple {1329#false} ~result~0 := #t~ret2; {1329#false} is VALID [2020-07-11 00:51:28,793 INFO L280 TraceCheckUtils]: 45: Hoare triple {1329#false} havoc #t~ret2; {1329#false} is VALID [2020-07-11 00:51:28,793 INFO L280 TraceCheckUtils]: 46: Hoare triple {1329#false} assume 5 == ~result~0; {1329#false} is VALID [2020-07-11 00:51:28,794 INFO L280 TraceCheckUtils]: 47: Hoare triple {1329#false} assume !false; {1329#false} is VALID [2020-07-11 00:51:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-11 00:51:28,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [291388314] [2020-07-11 00:51:28,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:28,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 00:51:28,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566206482] [2020-07-11 00:51:28,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-07-11 00:51:28,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:28,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 00:51:28,844 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 00:51:28,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 00:51:28,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:28,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 00:51:28,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:51:28,845 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 10 states. [2020-07-11 00:51:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:29,323 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-07-11 00:51:29,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 00:51:29,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-07-11 00:51:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:51:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-11 00:51:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:51:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-11 00:51:29,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 60 transitions. [2020-07-11 00:51:29,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:29,417 INFO L225 Difference]: With dead ends: 75 [2020-07-11 00:51:29,418 INFO L226 Difference]: Without dead ends: 69 [2020-07-11 00:51:29,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-07-11 00:51:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-11 00:51:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2020-07-11 00:51:29,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:29,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 52 states. [2020-07-11 00:51:29,497 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 52 states. [2020-07-11 00:51:29,497 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 52 states. [2020-07-11 00:51:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:29,505 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-07-11 00:51:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-07-11 00:51:29,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:29,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:29,506 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 69 states. [2020-07-11 00:51:29,506 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 69 states. [2020-07-11 00:51:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:29,511 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-07-11 00:51:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-07-11 00:51:29,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:29,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:29,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:29,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-11 00:51:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-07-11 00:51:29,518 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2020-07-11 00:51:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:29,518 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-07-11 00:51:29,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 00:51:29,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2020-07-11 00:51:29,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-11 00:51:29,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-11 00:51:29,608 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:29,608 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:29,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:51:29,608 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:29,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:29,609 INFO L82 PathProgramCache]: Analyzing trace with hash 826985242, now seen corresponding path program 2 times [2020-07-11 00:51:29,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:29,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2116352401] [2020-07-11 00:51:29,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:51:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:51:29,675 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 00:51:29,675 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 00:51:29,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 00:51:29,721 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 00:51:29,722 WARN L170 areAnnotationChecker]: id2ENTRY has no Hoare annotation [2020-07-11 00:51:29,722 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:51:29,722 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:51:29,722 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 00:51:29,722 WARN L170 areAnnotationChecker]: idENTRY has no Hoare annotation [2020-07-11 00:51:29,722 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 00:51:29,722 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 00:51:29,722 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 00:51:29,722 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:51:29,723 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:51:29,723 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-11 00:51:29,723 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-11 00:51:29,723 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-11 00:51:29,723 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-11 00:51:29,723 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 00:51:29,723 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 00:51:29,724 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 00:51:29,724 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 00:51:29,724 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-11 00:51:29,724 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2020-07-11 00:51:29,724 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-11 00:51:29,724 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-11 00:51:29,724 WARN L170 areAnnotationChecker]: id2FINAL has no Hoare annotation [2020-07-11 00:51:29,725 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-11 00:51:29,725 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-11 00:51:29,725 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-11 00:51:29,725 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-11 00:51:29,725 WARN L170 areAnnotationChecker]: id2EXIT has no Hoare annotation [2020-07-11 00:51:29,725 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-11 00:51:29,725 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-11 00:51:29,725 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-11 00:51:29,725 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-11 00:51:29,725 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2020-07-11 00:51:29,726 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-11 00:51:29,726 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-11 00:51:29,726 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-11 00:51:29,726 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-11 00:51:29,726 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 00:51:29,726 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 00:51:29,726 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-11 00:51:29,726 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 00:51:29,727 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:51:29,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:51:29 BoogieIcfgContainer [2020-07-11 00:51:29,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:51:29,733 INFO L168 Benchmark]: Toolchain (without parser) took 5688.35 ms. Allocated memory was 145.2 MB in the beginning and 281.5 MB in the end (delta: 136.3 MB). Free memory was 103.3 MB in the beginning and 206.8 MB in the end (delta: -103.5 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:29,734 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-11 00:51:29,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.56 ms. Allocated memory is still 145.2 MB. Free memory was 103.1 MB in the beginning and 93.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:29,735 INFO L168 Benchmark]: Boogie Preprocessor took 114.53 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 93.0 MB in the beginning and 181.3 MB in the end (delta: -88.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:29,736 INFO L168 Benchmark]: RCFGBuilder took 346.33 ms. Allocated memory is still 202.4 MB. Free memory was 181.3 MB in the beginning and 163.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:29,737 INFO L168 Benchmark]: TraceAbstraction took 4974.62 ms. Allocated memory was 202.4 MB in the beginning and 281.5 MB in the end (delta: 79.2 MB). Free memory was 163.2 MB in the beginning and 206.8 MB in the end (delta: -43.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:29,740 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 246.56 ms. Allocated memory is still 145.2 MB. Free memory was 103.1 MB in the beginning and 93.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.53 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 93.0 MB in the beginning and 181.3 MB in the end (delta: -88.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 346.33 ms. Allocated memory is still 202.4 MB. Free memory was 181.3 MB in the beginning and 163.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4974.62 ms. Allocated memory was 202.4 MB in the beginning and 281.5 MB in the end (delta: 79.2 MB). Free memory was 163.2 MB in the beginning and 206.8 MB in the end (delta: -43.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 21]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L18] int input = 5; VAL [input=5] [L19] CALL, EXPR id(input) VAL [\old(x)=5] [L8] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=4] [L13] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L14] CALL, EXPR id(x-1) VAL [\old(x)=3] [L8] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=2] [L13] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L14] CALL, EXPR id(x-1) VAL [\old(x)=1] [L8] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=0] [L13] COND TRUE x==0 VAL [\old(x)=0, x=0] [L13] return 0; VAL [\old(x)=0, \result=0, x=0] [L9] RET, EXPR id2(x-1) VAL [\old(x)=1, id2(x-1)=0, x=1] [L9] return id2(x-1) + 1; VAL [\old(x)=1, \result=1, id2(x-1)=0, x=1] [L14] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L14] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L9] RET, EXPR id2(x-1) VAL [\old(x)=3, id2(x-1)=2, x=3] [L9] return id2(x-1) + 1; VAL [\old(x)=3, \result=3, id2(x-1)=2, x=3] [L14] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L14] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L9] RET, EXPR id2(x-1) VAL [\old(x)=5, id2(x-1)=4, x=5] [L9] return id2(x-1) + 1; VAL [\old(x)=5, \result=5, id2(x-1)=4, x=5] [L19] RET, EXPR id(input) VAL [id(input)=5, input=5] [L19] int result = id(input); VAL [id(input)=5, input=5, result=5] [L20] COND TRUE result == 5 VAL [input=5, result=5] [L21] __VERIFIER_error() VAL [input=5, result=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.8s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 132 SDtfs, 137 SDslu, 538 SDs, 0 SdLazy, 211 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 12455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 17/40 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 incorrect! Received shutdown request...