/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/id_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 04:58:35,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:58:35,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:58:35,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:58:35,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:58:35,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:58:35,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:58:35,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:58:35,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:58:35,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:58:35,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:58:35,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:58:35,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:58:35,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:58:35,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:58:35,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:58:35,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:58:35,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:58:35,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:58:35,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:58:35,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:58:35,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:58:35,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:58:35,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:58:35,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:58:35,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:58:35,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:58:35,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:58:35,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:58:35,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:58:35,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:58:35,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:58:35,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:58:35,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:58:35,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:58:35,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:58:35,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:58:35,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:58:35,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:58:35,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:58:35,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:58:35,788 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 04:58:35,816 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:58:35,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:58:35,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:58:35,819 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:58:35,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:58:35,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:58:35,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:58:35,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:58:35,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:58:35,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:58:35,820 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:58:35,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:58:35,820 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:58:35,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:58:35,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:58:35,821 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:58:35,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:58:35,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:58:35,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:58:35,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:58:35,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:58:35,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:58:35,824 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-18 04:58:36,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:58:36,112 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:58:36,117 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:58:36,118 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:58:36,119 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:58:36,119 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c [2020-07-18 04:58:36,185 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20adc5eb9/e8236caed9e34aa1b972a5bc55665bae/FLAG7cd7fe54a [2020-07-18 04:58:36,550 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:58:36,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c [2020-07-18 04:58:36,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20adc5eb9/e8236caed9e34aa1b972a5bc55665bae/FLAG7cd7fe54a [2020-07-18 04:58:36,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20adc5eb9/e8236caed9e34aa1b972a5bc55665bae [2020-07-18 04:58:36,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:58:36,951 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:58:36,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:58:36,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:58:36,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:58:36,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:58:36" (1/1) ... [2020-07-18 04:58:36,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdaa858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:36, skipping insertion in model container [2020-07-18 04:58:36,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:58:36" (1/1) ... [2020-07-18 04:58:36,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:58:36,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:58:37,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:58:37,138 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:58:37,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:58:37,170 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:58:37,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:37 WrapperNode [2020-07-18 04:58:37,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:58:37,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:58:37,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:58:37,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:58:37,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:37" (1/1) ... [2020-07-18 04:58:37,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:37" (1/1) ... [2020-07-18 04:58:37,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:37" (1/1) ... [2020-07-18 04:58:37,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:37" (1/1) ... [2020-07-18 04:58:37,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:37" (1/1) ... [2020-07-18 04:58:37,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:37" (1/1) ... [2020-07-18 04:58:37,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:37" (1/1) ... [2020-07-18 04:58:37,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:58:37,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:58:37,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:58:37,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:58:37,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:37" (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-18 04:58:37,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:58:37,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:58:37,345 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-18 04:58:37,345 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:58:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 04:58:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:58:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-18 04:58:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:58:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:58:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:58:37,572 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:58:37,573 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 04:58:37,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:58:37 BoogieIcfgContainer [2020-07-18 04:58:37,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:58:37,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:58:37,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:58:37,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:58:37,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:58:36" (1/3) ... [2020-07-18 04:58:37,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46970475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:58:37, skipping insertion in model container [2020-07-18 04:58:37,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:37" (2/3) ... [2020-07-18 04:58:37,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46970475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:58:37, skipping insertion in model container [2020-07-18 04:58:37,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:58:37" (3/3) ... [2020-07-18 04:58:37,591 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i5_o5-2.c [2020-07-18 04:58:37,604 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:58:37,611 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:58:37,647 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:58:37,688 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:58:37,688 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:58:37,688 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:58:37,688 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:58:37,688 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:58:37,689 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:58:37,689 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:58:37,689 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:58:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-18 04:58:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-18 04:58:37,712 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:58:37,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:58:37,713 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:58:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:58:37,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-07-18 04:58:37,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:58:37,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854996572] [2020-07-18 04:58:37,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:58:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:37,903 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-18 04:58:37,905 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {28#true} {28#true} #31#return; {28#true} is VALID [2020-07-18 04:58:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:37,955 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:37,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x; {39#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,957 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#(= 0 |id_#in~x|)} #res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,958 INFO L280 TraceCheckUtils]: 3: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,960 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {39#(= 0 |id_#in~x|)} {32#(<= 5 main_~input~0)} #35#return; {29#false} is VALID [2020-07-18 04:58:37,961 INFO L263 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2020-07-18 04:58:37,961 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-18 04:58:37,961 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #31#return; {28#true} is VALID [2020-07-18 04:58:37,962 INFO L263 TraceCheckUtils]: 3: Hoare triple {28#true} call #t~ret2 := main(); {28#true} is VALID [2020-07-18 04:58:37,963 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#true} ~input~0 := 5; {32#(<= 5 main_~input~0)} is VALID [2020-07-18 04:58:37,963 INFO L263 TraceCheckUtils]: 5: Hoare triple {32#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {28#true} is VALID [2020-07-18 04:58:37,965 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:37,965 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x; {39#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,966 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#(= 0 |id_#in~x|)} #res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,967 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,969 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {39#(= 0 |id_#in~x|)} {32#(<= 5 main_~input~0)} #35#return; {29#false} is VALID [2020-07-18 04:58:37,970 INFO L280 TraceCheckUtils]: 11: Hoare triple {29#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {29#false} is VALID [2020-07-18 04:58:37,970 INFO L280 TraceCheckUtils]: 12: Hoare triple {29#false} ~result~0 := #t~ret1; {29#false} is VALID [2020-07-18 04:58:37,971 INFO L280 TraceCheckUtils]: 13: Hoare triple {29#false} havoc #t~ret1; {29#false} is VALID [2020-07-18 04:58:37,971 INFO L280 TraceCheckUtils]: 14: Hoare triple {29#false} assume 5 != ~result~0; {29#false} is VALID [2020-07-18 04:58:37,972 INFO L280 TraceCheckUtils]: 15: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-18 04:58:37,974 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-18 04:58:37,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [854996572] [2020-07-18 04:58:37,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:58:37,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:58:37,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561928928] [2020-07-18 04:58:37,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-18 04:58:37,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:58:37,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:58:38,030 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-18 04:58:38,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:58:38,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:58:38,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:58:38,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:58:38,043 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-07-18 04:58:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:38,279 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-18 04:58:38,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 04:58:38,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-18 04:58:38,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:58:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:58:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-18 04:58:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:58:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-18 04:58:38,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-18 04:58:38,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:38,371 INFO L225 Difference]: With dead ends: 37 [2020-07-18 04:58:38,371 INFO L226 Difference]: Without dead ends: 23 [2020-07-18 04:58:38,375 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-18 04:58:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-18 04:58:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-18 04:58:38,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:58:38,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-18 04:58:38,445 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-18 04:58:38,445 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-18 04:58:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:38,451 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-18 04:58:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-18 04:58:38,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:38,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:38,453 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-18 04:58:38,453 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-18 04:58:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:38,458 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-18 04:58:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-18 04:58:38,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:38,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:38,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:58:38,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:58:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-18 04:58:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-18 04:58:38,465 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-07-18 04:58:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:58:38,466 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-18 04:58:38,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:58:38,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2020-07-18 04:58:38,505 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-18 04:58:38,506 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-18 04:58:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-18 04:58:38,507 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:58:38,507 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] [2020-07-18 04:58:38,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:58:38,508 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:58:38,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:58:38,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-07-18 04:58:38,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:58:38,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2108187922] [2020-07-18 04:58:38,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:58:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:38,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-18 04:58:38,574 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {210#true} {210#true} #31#return; {210#true} is VALID [2020-07-18 04:58:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:38,648 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,649 INFO L280 TraceCheckUtils]: 2: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,650 INFO L280 TraceCheckUtils]: 3: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,651 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {235#(= 0 |id_#in~x|)} {228#(= |id_#in~x| id_~x)} #37#return; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,652 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,653 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#(= |id_#in~x| id_~x)} assume !(0 == ~x); {228#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,654 INFO L263 TraceCheckUtils]: 2: Hoare triple {228#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {210#true} is VALID [2020-07-18 04:58:38,654 INFO L280 TraceCheckUtils]: 3: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,655 INFO L280 TraceCheckUtils]: 4: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,656 INFO L280 TraceCheckUtils]: 5: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,657 INFO L280 TraceCheckUtils]: 6: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,658 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {235#(= 0 |id_#in~x|)} {228#(= |id_#in~x| id_~x)} #37#return; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,659 INFO L280 TraceCheckUtils]: 8: Hoare triple {234#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,659 INFO L280 TraceCheckUtils]: 9: Hoare triple {234#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,660 INFO L280 TraceCheckUtils]: 10: Hoare triple {234#(<= |id_#in~x| 1)} havoc #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,661 INFO L280 TraceCheckUtils]: 11: Hoare triple {234#(<= |id_#in~x| 1)} assume true; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,662 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {234#(<= |id_#in~x| 1)} {214#(<= 5 main_~input~0)} #35#return; {211#false} is VALID [2020-07-18 04:58:38,663 INFO L263 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2020-07-18 04:58:38,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-18 04:58:38,664 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #31#return; {210#true} is VALID [2020-07-18 04:58:38,664 INFO L263 TraceCheckUtils]: 3: Hoare triple {210#true} call #t~ret2 := main(); {210#true} is VALID [2020-07-18 04:58:38,665 INFO L280 TraceCheckUtils]: 4: Hoare triple {210#true} ~input~0 := 5; {214#(<= 5 main_~input~0)} is VALID [2020-07-18 04:58:38,665 INFO L263 TraceCheckUtils]: 5: Hoare triple {214#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {210#true} is VALID [2020-07-18 04:58:38,666 INFO L280 TraceCheckUtils]: 6: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,667 INFO L280 TraceCheckUtils]: 7: Hoare triple {228#(= |id_#in~x| id_~x)} assume !(0 == ~x); {228#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,667 INFO L263 TraceCheckUtils]: 8: Hoare triple {228#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {210#true} is VALID [2020-07-18 04:58:38,668 INFO L280 TraceCheckUtils]: 9: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,669 INFO L280 TraceCheckUtils]: 10: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,669 INFO L280 TraceCheckUtils]: 11: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,670 INFO L280 TraceCheckUtils]: 12: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,671 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {235#(= 0 |id_#in~x|)} {228#(= |id_#in~x| id_~x)} #37#return; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,672 INFO L280 TraceCheckUtils]: 14: Hoare triple {234#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,673 INFO L280 TraceCheckUtils]: 15: Hoare triple {234#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,674 INFO L280 TraceCheckUtils]: 16: Hoare triple {234#(<= |id_#in~x| 1)} havoc #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,674 INFO L280 TraceCheckUtils]: 17: Hoare triple {234#(<= |id_#in~x| 1)} assume true; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,676 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {234#(<= |id_#in~x| 1)} {214#(<= 5 main_~input~0)} #35#return; {211#false} is VALID [2020-07-18 04:58:38,676 INFO L280 TraceCheckUtils]: 19: Hoare triple {211#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {211#false} is VALID [2020-07-18 04:58:38,676 INFO L280 TraceCheckUtils]: 20: Hoare triple {211#false} ~result~0 := #t~ret1; {211#false} is VALID [2020-07-18 04:58:38,677 INFO L280 TraceCheckUtils]: 21: Hoare triple {211#false} havoc #t~ret1; {211#false} is VALID [2020-07-18 04:58:38,677 INFO L280 TraceCheckUtils]: 22: Hoare triple {211#false} assume 5 != ~result~0; {211#false} is VALID [2020-07-18 04:58:38,677 INFO L280 TraceCheckUtils]: 23: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-18 04:58:38,679 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-18 04:58:38,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2108187922] [2020-07-18 04:58:38,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:58:38,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-18 04:58:38,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394876407] [2020-07-18 04:58:38,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-18 04:58:38,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:58:38,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 04:58:38,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:38,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 04:58:38,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:58:38,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 04:58:38,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:58:38,711 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-07-18 04:58:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:38,870 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-18 04:58:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:58:38,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-18 04:58:38,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:58:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:58:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-18 04:58:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:58:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-18 04:58:38,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2020-07-18 04:58:38,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:38,925 INFO L225 Difference]: With dead ends: 34 [2020-07-18 04:58:38,925 INFO L226 Difference]: Without dead ends: 28 [2020-07-18 04:58:38,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:58:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-18 04:58:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-18 04:58:38,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:58:38,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-18 04:58:38,963 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 04:58:38,963 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 04:58:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:38,966 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-18 04:58:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-18 04:58:38,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:38,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:38,968 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 04:58:38,968 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 04:58:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:38,971 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-18 04:58:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-18 04:58:38,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:38,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:38,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:58:38,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:58:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 04:58:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-18 04:58:38,976 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-07-18 04:58:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:58:38,976 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-18 04:58:38,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 04:58:38,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2020-07-18 04:58:39,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-18 04:58:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-18 04:58:39,015 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:58:39,015 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:58:39,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:58:39,015 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:58:39,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:58:39,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-07-18 04:58:39,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:58:39,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1565026516] [2020-07-18 04:58:39,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:58:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,081 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-18 04:58:39,081 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {422#true} {422#true} #31#return; {422#true} is VALID [2020-07-18 04:58:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,222 INFO L280 TraceCheckUtils]: 2: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,223 INFO L280 TraceCheckUtils]: 3: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,224 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {469#(= 0 |id_#in~x|)} {448#(= |id_#in~x| id_~x)} #37#return; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,225 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,226 INFO L263 TraceCheckUtils]: 2: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-18 04:58:39,227 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,228 INFO L280 TraceCheckUtils]: 4: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,229 INFO L280 TraceCheckUtils]: 5: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,229 INFO L280 TraceCheckUtils]: 6: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,231 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {469#(= 0 |id_#in~x|)} {448#(= |id_#in~x| id_~x)} #37#return; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,234 INFO L280 TraceCheckUtils]: 8: Hoare triple {468#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,235 INFO L280 TraceCheckUtils]: 9: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,236 INFO L280 TraceCheckUtils]: 10: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,237 INFO L280 TraceCheckUtils]: 11: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,239 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {468#(<= |id_#in~x| 1)} {448#(= |id_#in~x| id_~x)} #37#return; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,241 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,249 INFO L263 TraceCheckUtils]: 2: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-18 04:58:39,251 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,252 INFO L280 TraceCheckUtils]: 4: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,252 INFO L263 TraceCheckUtils]: 5: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-18 04:58:39,254 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,255 INFO L280 TraceCheckUtils]: 7: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,255 INFO L280 TraceCheckUtils]: 8: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,256 INFO L280 TraceCheckUtils]: 9: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,258 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {469#(= 0 |id_#in~x|)} {448#(= |id_#in~x| id_~x)} #37#return; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,259 INFO L280 TraceCheckUtils]: 11: Hoare triple {468#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,259 INFO L280 TraceCheckUtils]: 12: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,260 INFO L280 TraceCheckUtils]: 13: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,261 INFO L280 TraceCheckUtils]: 14: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,263 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {468#(<= |id_#in~x| 1)} {448#(= |id_#in~x| id_~x)} #37#return; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,267 INFO L280 TraceCheckUtils]: 16: Hoare triple {462#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,268 INFO L280 TraceCheckUtils]: 17: Hoare triple {462#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,269 INFO L280 TraceCheckUtils]: 18: Hoare triple {462#(<= |id_#in~x| 2)} havoc #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,270 INFO L280 TraceCheckUtils]: 19: Hoare triple {462#(<= |id_#in~x| 2)} assume true; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,271 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {462#(<= |id_#in~x| 2)} {426#(<= 5 main_~input~0)} #35#return; {423#false} is VALID [2020-07-18 04:58:39,274 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-18 04:58:39,274 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-18 04:58:39,274 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #31#return; {422#true} is VALID [2020-07-18 04:58:39,274 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret2 := main(); {422#true} is VALID [2020-07-18 04:58:39,276 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} ~input~0 := 5; {426#(<= 5 main_~input~0)} is VALID [2020-07-18 04:58:39,276 INFO L263 TraceCheckUtils]: 5: Hoare triple {426#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {422#true} is VALID [2020-07-18 04:58:39,277 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,277 INFO L280 TraceCheckUtils]: 7: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,278 INFO L263 TraceCheckUtils]: 8: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-18 04:58:39,279 INFO L280 TraceCheckUtils]: 9: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,279 INFO L280 TraceCheckUtils]: 10: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,280 INFO L263 TraceCheckUtils]: 11: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-18 04:58:39,281 INFO L280 TraceCheckUtils]: 12: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,292 INFO L280 TraceCheckUtils]: 13: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,293 INFO L280 TraceCheckUtils]: 14: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,293 INFO L280 TraceCheckUtils]: 15: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,295 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {469#(= 0 |id_#in~x|)} {448#(= |id_#in~x| id_~x)} #37#return; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,296 INFO L280 TraceCheckUtils]: 17: Hoare triple {468#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,297 INFO L280 TraceCheckUtils]: 18: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,297 INFO L280 TraceCheckUtils]: 19: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,300 INFO L280 TraceCheckUtils]: 20: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,302 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {468#(<= |id_#in~x| 1)} {448#(= |id_#in~x| id_~x)} #37#return; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,303 INFO L280 TraceCheckUtils]: 22: Hoare triple {462#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,303 INFO L280 TraceCheckUtils]: 23: Hoare triple {462#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,304 INFO L280 TraceCheckUtils]: 24: Hoare triple {462#(<= |id_#in~x| 2)} havoc #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,305 INFO L280 TraceCheckUtils]: 25: Hoare triple {462#(<= |id_#in~x| 2)} assume true; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,306 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {462#(<= |id_#in~x| 2)} {426#(<= 5 main_~input~0)} #35#return; {423#false} is VALID [2020-07-18 04:58:39,307 INFO L280 TraceCheckUtils]: 27: Hoare triple {423#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {423#false} is VALID [2020-07-18 04:58:39,307 INFO L280 TraceCheckUtils]: 28: Hoare triple {423#false} ~result~0 := #t~ret1; {423#false} is VALID [2020-07-18 04:58:39,307 INFO L280 TraceCheckUtils]: 29: Hoare triple {423#false} havoc #t~ret1; {423#false} is VALID [2020-07-18 04:58:39,307 INFO L280 TraceCheckUtils]: 30: Hoare triple {423#false} assume 5 != ~result~0; {423#false} is VALID [2020-07-18 04:58:39,308 INFO L280 TraceCheckUtils]: 31: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-18 04:58:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-18 04:58:39,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1565026516] [2020-07-18 04:58:39,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:58:39,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 04:58:39,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800616592] [2020-07-18 04:58:39,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-18 04:58:39,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:58:39,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 04:58:39,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:39,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 04:58:39,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:58:39,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 04:58:39,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:58:39,349 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-07-18 04:58:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:39,573 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-18 04:58:39,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 04:58:39,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-18 04:58:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:58:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:58:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2020-07-18 04:58:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:58:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2020-07-18 04:58:39,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2020-07-18 04:58:39,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:39,631 INFO L225 Difference]: With dead ends: 39 [2020-07-18 04:58:39,631 INFO L226 Difference]: Without dead ends: 33 [2020-07-18 04:58:39,632 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-18 04:58:39,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-18 04:58:39,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-18 04:58:39,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:58:39,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-18 04:58:39,669 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-18 04:58:39,669 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-18 04:58:39,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:39,672 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-18 04:58:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-18 04:58:39,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:39,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:39,673 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-18 04:58:39,673 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-18 04:58:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:39,676 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-18 04:58:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-18 04:58:39,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:39,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:39,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:58:39,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:58:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-18 04:58:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-18 04:58:39,680 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-07-18 04:58:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:58:39,681 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-18 04:58:39,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 04:58:39,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2020-07-18 04:58:39,722 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-18 04:58:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-18 04:58:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-18 04:58:39,724 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:58:39,724 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:58:39,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 04:58:39,724 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:58:39,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:58:39,725 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-07-18 04:58:39,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:58:39,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [680895370] [2020-07-18 04:58:39,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:58:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,767 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} assume true; {688#true} is VALID [2020-07-18 04:58:39,769 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {688#true} {688#true} #31#return; {688#true} is VALID [2020-07-18 04:58:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,918 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,920 INFO L280 TraceCheckUtils]: 3: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,921 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,924 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,924 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,925 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:39,925 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,926 INFO L280 TraceCheckUtils]: 4: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,927 INFO L280 TraceCheckUtils]: 5: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,927 INFO L280 TraceCheckUtils]: 6: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,928 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,929 INFO L280 TraceCheckUtils]: 8: Hoare triple {764#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,930 INFO L280 TraceCheckUtils]: 9: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,930 INFO L280 TraceCheckUtils]: 10: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,931 INFO L280 TraceCheckUtils]: 11: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,932 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {764#(<= |id_#in~x| 1)} {722#(= |id_#in~x| id_~x)} #37#return; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,933 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,934 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:39,934 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,935 INFO L280 TraceCheckUtils]: 4: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,935 INFO L263 TraceCheckUtils]: 5: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:39,936 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,937 INFO L280 TraceCheckUtils]: 7: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,937 INFO L280 TraceCheckUtils]: 8: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,938 INFO L280 TraceCheckUtils]: 9: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,939 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,939 INFO L280 TraceCheckUtils]: 11: Hoare triple {764#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,940 INFO L280 TraceCheckUtils]: 12: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,941 INFO L280 TraceCheckUtils]: 13: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,941 INFO L280 TraceCheckUtils]: 14: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,943 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {764#(<= |id_#in~x| 1)} {722#(= |id_#in~x| id_~x)} #37#return; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,943 INFO L280 TraceCheckUtils]: 16: Hoare triple {758#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,944 INFO L280 TraceCheckUtils]: 17: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,944 INFO L280 TraceCheckUtils]: 18: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,945 INFO L280 TraceCheckUtils]: 19: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,946 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {758#(<= |id_#in~x| 2)} {722#(= |id_#in~x| id_~x)} #37#return; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,947 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,948 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:39,949 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,949 INFO L280 TraceCheckUtils]: 4: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,950 INFO L263 TraceCheckUtils]: 5: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:39,950 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,951 INFO L280 TraceCheckUtils]: 7: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,951 INFO L263 TraceCheckUtils]: 8: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:39,952 INFO L280 TraceCheckUtils]: 9: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,952 INFO L280 TraceCheckUtils]: 10: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,953 INFO L280 TraceCheckUtils]: 11: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,954 INFO L280 TraceCheckUtils]: 12: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,954 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,955 INFO L280 TraceCheckUtils]: 14: Hoare triple {764#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,955 INFO L280 TraceCheckUtils]: 15: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,956 INFO L280 TraceCheckUtils]: 16: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,956 INFO L280 TraceCheckUtils]: 17: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,957 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {764#(<= |id_#in~x| 1)} {722#(= |id_#in~x| id_~x)} #37#return; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,960 INFO L280 TraceCheckUtils]: 19: Hoare triple {758#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,960 INFO L280 TraceCheckUtils]: 20: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,961 INFO L280 TraceCheckUtils]: 21: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,961 INFO L280 TraceCheckUtils]: 22: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,962 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {758#(<= |id_#in~x| 2)} {722#(= |id_#in~x| id_~x)} #37#return; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,963 INFO L280 TraceCheckUtils]: 24: Hoare triple {744#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,965 INFO L280 TraceCheckUtils]: 25: Hoare triple {744#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,966 INFO L280 TraceCheckUtils]: 26: Hoare triple {744#(<= |id_#in~x| 3)} havoc #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,967 INFO L280 TraceCheckUtils]: 27: Hoare triple {744#(<= |id_#in~x| 3)} assume true; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,968 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {744#(<= |id_#in~x| 3)} {692#(<= 5 main_~input~0)} #35#return; {689#false} is VALID [2020-07-18 04:58:39,970 INFO L263 TraceCheckUtils]: 0: Hoare triple {688#true} call ULTIMATE.init(); {688#true} is VALID [2020-07-18 04:58:39,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {688#true} assume true; {688#true} is VALID [2020-07-18 04:58:39,970 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {688#true} {688#true} #31#return; {688#true} is VALID [2020-07-18 04:58:39,970 INFO L263 TraceCheckUtils]: 3: Hoare triple {688#true} call #t~ret2 := main(); {688#true} is VALID [2020-07-18 04:58:39,971 INFO L280 TraceCheckUtils]: 4: Hoare triple {688#true} ~input~0 := 5; {692#(<= 5 main_~input~0)} is VALID [2020-07-18 04:58:39,971 INFO L263 TraceCheckUtils]: 5: Hoare triple {692#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {688#true} is VALID [2020-07-18 04:58:39,973 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,974 INFO L280 TraceCheckUtils]: 7: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,975 INFO L263 TraceCheckUtils]: 8: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:39,978 INFO L280 TraceCheckUtils]: 9: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,978 INFO L280 TraceCheckUtils]: 10: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,978 INFO L263 TraceCheckUtils]: 11: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:39,979 INFO L280 TraceCheckUtils]: 12: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,980 INFO L280 TraceCheckUtils]: 13: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,980 INFO L263 TraceCheckUtils]: 14: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:39,980 INFO L280 TraceCheckUtils]: 15: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,981 INFO L280 TraceCheckUtils]: 16: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,982 INFO L280 TraceCheckUtils]: 17: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,982 INFO L280 TraceCheckUtils]: 18: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,984 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,984 INFO L280 TraceCheckUtils]: 20: Hoare triple {764#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,986 INFO L280 TraceCheckUtils]: 21: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,986 INFO L280 TraceCheckUtils]: 22: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,987 INFO L280 TraceCheckUtils]: 23: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,988 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {764#(<= |id_#in~x| 1)} {722#(= |id_#in~x| id_~x)} #37#return; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,988 INFO L280 TraceCheckUtils]: 25: Hoare triple {758#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,989 INFO L280 TraceCheckUtils]: 26: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,990 INFO L280 TraceCheckUtils]: 27: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,990 INFO L280 TraceCheckUtils]: 28: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,991 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {758#(<= |id_#in~x| 2)} {722#(= |id_#in~x| id_~x)} #37#return; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,994 INFO L280 TraceCheckUtils]: 30: Hoare triple {744#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,995 INFO L280 TraceCheckUtils]: 31: Hoare triple {744#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,996 INFO L280 TraceCheckUtils]: 32: Hoare triple {744#(<= |id_#in~x| 3)} havoc #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,997 INFO L280 TraceCheckUtils]: 33: Hoare triple {744#(<= |id_#in~x| 3)} assume true; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,998 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {744#(<= |id_#in~x| 3)} {692#(<= 5 main_~input~0)} #35#return; {689#false} is VALID [2020-07-18 04:58:39,998 INFO L280 TraceCheckUtils]: 35: Hoare triple {689#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {689#false} is VALID [2020-07-18 04:58:39,999 INFO L280 TraceCheckUtils]: 36: Hoare triple {689#false} ~result~0 := #t~ret1; {689#false} is VALID [2020-07-18 04:58:39,999 INFO L280 TraceCheckUtils]: 37: Hoare triple {689#false} havoc #t~ret1; {689#false} is VALID [2020-07-18 04:58:39,999 INFO L280 TraceCheckUtils]: 38: Hoare triple {689#false} assume 5 != ~result~0; {689#false} is VALID [2020-07-18 04:58:39,999 INFO L280 TraceCheckUtils]: 39: Hoare triple {689#false} assume !false; {689#false} is VALID [2020-07-18 04:58:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-18 04:58:40,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [680895370] [2020-07-18 04:58:40,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:58:40,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-18 04:58:40,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510956526] [2020-07-18 04:58:40,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-18 04:58:40,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:58:40,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 04:58:40,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:40,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 04:58:40,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:58:40,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 04:58:40,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:58:40,043 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-07-18 04:58:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:40,293 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-18 04:58:40,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 04:58:40,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-18 04:58:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:58:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:58:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2020-07-18 04:58:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:58:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2020-07-18 04:58:40,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2020-07-18 04:58:40,366 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-18 04:58:40,369 INFO L225 Difference]: With dead ends: 44 [2020-07-18 04:58:40,369 INFO L226 Difference]: Without dead ends: 38 [2020-07-18 04:58:40,370 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-18 04:58:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-18 04:58:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-18 04:58:40,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:58:40,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-18 04:58:40,423 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-18 04:58:40,424 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-18 04:58:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:40,427 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-18 04:58:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-18 04:58:40,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:40,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:40,429 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-18 04:58:40,429 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-18 04:58:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:40,435 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-18 04:58:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-18 04:58:40,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:40,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:40,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:58:40,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:58:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-18 04:58:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-07-18 04:58:40,442 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-07-18 04:58:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:58:40,442 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-07-18 04:58:40,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 04:58:40,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 39 transitions. [2020-07-18 04:58:40,496 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-18 04:58:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-18 04:58:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 04:58:40,498 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:58:40,498 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:58:40,498 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 04:58:40,499 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:58:40,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:58:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-07-18 04:58:40,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:58:40,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1702347215] [2020-07-18 04:58:40,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:58:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:40,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} assume true; {1016#true} is VALID [2020-07-18 04:58:40,537 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1016#true} {1016#true} #31#return; {1016#true} is VALID [2020-07-18 04:58:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:40,694 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,695 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,697 INFO L280 TraceCheckUtils]: 2: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,698 INFO L280 TraceCheckUtils]: 3: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,700 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,705 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,705 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,706 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,707 INFO L280 TraceCheckUtils]: 5: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,708 INFO L280 TraceCheckUtils]: 6: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,709 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,710 INFO L280 TraceCheckUtils]: 8: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,710 INFO L280 TraceCheckUtils]: 9: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,711 INFO L280 TraceCheckUtils]: 10: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,711 INFO L280 TraceCheckUtils]: 11: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,713 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,714 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,715 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,715 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,716 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,716 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,717 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,717 INFO L280 TraceCheckUtils]: 8: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,718 INFO L280 TraceCheckUtils]: 9: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,719 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,720 INFO L280 TraceCheckUtils]: 11: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,720 INFO L280 TraceCheckUtils]: 12: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,721 INFO L280 TraceCheckUtils]: 13: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,721 INFO L280 TraceCheckUtils]: 14: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,722 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,723 INFO L280 TraceCheckUtils]: 16: Hoare triple {1124#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,724 INFO L280 TraceCheckUtils]: 17: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,724 INFO L280 TraceCheckUtils]: 18: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,725 INFO L280 TraceCheckUtils]: 19: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,726 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1124#(<= |id_#in~x| 2)} {1058#(= |id_#in~x| id_~x)} #37#return; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,727 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,728 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,728 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,728 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,729 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,729 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,730 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,730 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,731 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,731 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,732 INFO L280 TraceCheckUtils]: 10: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,732 INFO L280 TraceCheckUtils]: 11: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,733 INFO L280 TraceCheckUtils]: 12: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,734 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,734 INFO L280 TraceCheckUtils]: 14: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,735 INFO L280 TraceCheckUtils]: 15: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,735 INFO L280 TraceCheckUtils]: 16: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,736 INFO L280 TraceCheckUtils]: 17: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,737 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,738 INFO L280 TraceCheckUtils]: 19: Hoare triple {1124#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,739 INFO L280 TraceCheckUtils]: 20: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,739 INFO L280 TraceCheckUtils]: 21: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,740 INFO L280 TraceCheckUtils]: 22: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,741 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1124#(<= |id_#in~x| 2)} {1058#(= |id_#in~x| id_~x)} #37#return; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,742 INFO L280 TraceCheckUtils]: 24: Hoare triple {1110#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,742 INFO L280 TraceCheckUtils]: 25: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,743 INFO L280 TraceCheckUtils]: 26: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,743 INFO L280 TraceCheckUtils]: 27: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,744 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1110#(<= |id_#in~x| 3)} {1058#(= |id_#in~x| id_~x)} #37#return; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:40,746 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,747 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,747 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,748 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,748 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,749 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,749 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,750 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,750 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,751 INFO L280 TraceCheckUtils]: 10: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,751 INFO L263 TraceCheckUtils]: 11: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,752 INFO L280 TraceCheckUtils]: 12: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,752 INFO L280 TraceCheckUtils]: 13: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,753 INFO L280 TraceCheckUtils]: 14: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,753 INFO L280 TraceCheckUtils]: 15: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,754 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,755 INFO L280 TraceCheckUtils]: 17: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,755 INFO L280 TraceCheckUtils]: 18: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,756 INFO L280 TraceCheckUtils]: 19: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,756 INFO L280 TraceCheckUtils]: 20: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,758 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,758 INFO L280 TraceCheckUtils]: 22: Hoare triple {1124#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,759 INFO L280 TraceCheckUtils]: 23: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,760 INFO L280 TraceCheckUtils]: 24: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,760 INFO L280 TraceCheckUtils]: 25: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,761 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1124#(<= |id_#in~x| 2)} {1058#(= |id_#in~x| id_~x)} #37#return; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,762 INFO L280 TraceCheckUtils]: 27: Hoare triple {1110#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,762 INFO L280 TraceCheckUtils]: 28: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,763 INFO L280 TraceCheckUtils]: 29: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,763 INFO L280 TraceCheckUtils]: 30: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,764 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1110#(<= |id_#in~x| 3)} {1058#(= |id_#in~x| id_~x)} #37#return; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:40,765 INFO L280 TraceCheckUtils]: 32: Hoare triple {1088#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:40,765 INFO L280 TraceCheckUtils]: 33: Hoare triple {1088#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:40,766 INFO L280 TraceCheckUtils]: 34: Hoare triple {1088#(<= |id_#in~x| 4)} havoc #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:40,766 INFO L280 TraceCheckUtils]: 35: Hoare triple {1088#(<= |id_#in~x| 4)} assume true; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:40,767 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1088#(<= |id_#in~x| 4)} {1020#(<= 5 main_~input~0)} #35#return; {1017#false} is VALID [2020-07-18 04:58:40,769 INFO L263 TraceCheckUtils]: 0: Hoare triple {1016#true} call ULTIMATE.init(); {1016#true} is VALID [2020-07-18 04:58:40,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {1016#true} assume true; {1016#true} is VALID [2020-07-18 04:58:40,769 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1016#true} {1016#true} #31#return; {1016#true} is VALID [2020-07-18 04:58:40,769 INFO L263 TraceCheckUtils]: 3: Hoare triple {1016#true} call #t~ret2 := main(); {1016#true} is VALID [2020-07-18 04:58:40,770 INFO L280 TraceCheckUtils]: 4: Hoare triple {1016#true} ~input~0 := 5; {1020#(<= 5 main_~input~0)} is VALID [2020-07-18 04:58:40,771 INFO L263 TraceCheckUtils]: 5: Hoare triple {1020#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {1016#true} is VALID [2020-07-18 04:58:40,772 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,774 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,775 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,776 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,778 INFO L280 TraceCheckUtils]: 10: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,779 INFO L263 TraceCheckUtils]: 11: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,779 INFO L280 TraceCheckUtils]: 12: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,780 INFO L280 TraceCheckUtils]: 13: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,780 INFO L263 TraceCheckUtils]: 14: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,781 INFO L280 TraceCheckUtils]: 15: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,781 INFO L280 TraceCheckUtils]: 16: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,781 INFO L263 TraceCheckUtils]: 17: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:40,782 INFO L280 TraceCheckUtils]: 18: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:40,782 INFO L280 TraceCheckUtils]: 19: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,783 INFO L280 TraceCheckUtils]: 20: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,784 INFO L280 TraceCheckUtils]: 21: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:40,785 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,785 INFO L280 TraceCheckUtils]: 23: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,786 INFO L280 TraceCheckUtils]: 24: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,786 INFO L280 TraceCheckUtils]: 25: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,787 INFO L280 TraceCheckUtils]: 26: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:40,788 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,789 INFO L280 TraceCheckUtils]: 28: Hoare triple {1124#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,789 INFO L280 TraceCheckUtils]: 29: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,790 INFO L280 TraceCheckUtils]: 30: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,791 INFO L280 TraceCheckUtils]: 31: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:40,792 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1124#(<= |id_#in~x| 2)} {1058#(= |id_#in~x| id_~x)} #37#return; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,792 INFO L280 TraceCheckUtils]: 33: Hoare triple {1110#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,793 INFO L280 TraceCheckUtils]: 34: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,793 INFO L280 TraceCheckUtils]: 35: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,794 INFO L280 TraceCheckUtils]: 36: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:40,795 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1110#(<= |id_#in~x| 3)} {1058#(= |id_#in~x| id_~x)} #37#return; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:40,796 INFO L280 TraceCheckUtils]: 38: Hoare triple {1088#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:40,796 INFO L280 TraceCheckUtils]: 39: Hoare triple {1088#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:40,797 INFO L280 TraceCheckUtils]: 40: Hoare triple {1088#(<= |id_#in~x| 4)} havoc #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:40,797 INFO L280 TraceCheckUtils]: 41: Hoare triple {1088#(<= |id_#in~x| 4)} assume true; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:40,798 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1088#(<= |id_#in~x| 4)} {1020#(<= 5 main_~input~0)} #35#return; {1017#false} is VALID [2020-07-18 04:58:40,799 INFO L280 TraceCheckUtils]: 43: Hoare triple {1017#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1017#false} is VALID [2020-07-18 04:58:40,799 INFO L280 TraceCheckUtils]: 44: Hoare triple {1017#false} ~result~0 := #t~ret1; {1017#false} is VALID [2020-07-18 04:58:40,799 INFO L280 TraceCheckUtils]: 45: Hoare triple {1017#false} havoc #t~ret1; {1017#false} is VALID [2020-07-18 04:58:40,799 INFO L280 TraceCheckUtils]: 46: Hoare triple {1017#false} assume 5 != ~result~0; {1017#false} is VALID [2020-07-18 04:58:40,799 INFO L280 TraceCheckUtils]: 47: Hoare triple {1017#false} assume !false; {1017#false} is VALID [2020-07-18 04:58:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-18 04:58:40,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1702347215] [2020-07-18 04:58:40,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:58:40,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-18 04:58:40,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608448300] [2020-07-18 04:58:40,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-18 04:58:40,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:58:40,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 04:58:40,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:40,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 04:58:40,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:58:40,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 04:58:40,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-18 04:58:40,844 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-07-18 04:58:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:41,077 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-07-18 04:58:41,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 04:58:41,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-18 04:58:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:58:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 04:58:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-18 04:58:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 04:58:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-18 04:58:41,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2020-07-18 04:58:41,148 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-18 04:58:41,150 INFO L225 Difference]: With dead ends: 49 [2020-07-18 04:58:41,151 INFO L226 Difference]: Without dead ends: 43 [2020-07-18 04:58:41,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-07-18 04:58:41,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-18 04:58:41,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-18 04:58:41,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:58:41,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-18 04:58:41,197 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-18 04:58:41,198 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-18 04:58:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:41,200 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-18 04:58:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-18 04:58:41,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:41,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:41,201 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-18 04:58:41,202 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-18 04:58:41,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:41,204 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-18 04:58:41,204 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-18 04:58:41,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:41,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:41,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:58:41,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:58:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-18 04:58:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-07-18 04:58:41,207 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-07-18 04:58:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:58:41,208 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-07-18 04:58:41,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 04:58:41,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 44 transitions. [2020-07-18 04:58:41,270 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-18 04:58:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-18 04:58:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-18 04:58:41,272 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:58:41,272 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:58:41,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 04:58:41,273 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:58:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:58:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-07-18 04:58:41,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:58:41,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [907337458] [2020-07-18 04:58:41,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:58:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:41,343 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} assume true; {1414#true} is VALID [2020-07-18 04:58:41,344 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1414#true} {1414#true} #31#return; {1414#true} is VALID [2020-07-18 04:58:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:41,650 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,651 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-18 04:58:41,651 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,652 INFO L280 TraceCheckUtils]: 3: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,653 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:58:41,653 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,654 INFO L263 TraceCheckUtils]: 2: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,654 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,655 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-18 04:58:41,655 INFO L280 TraceCheckUtils]: 5: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,656 INFO L280 TraceCheckUtils]: 6: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,657 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:58:41,657 INFO L280 TraceCheckUtils]: 8: Hoare triple {1578#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:58:41,658 INFO L280 TraceCheckUtils]: 9: Hoare triple {1578#(= 0 |id_#t~ret0|)} #res := 1 + #t~ret0; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,659 INFO L280 TraceCheckUtils]: 10: Hoare triple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} havoc #t~ret0; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,660 INFO L280 TraceCheckUtils]: 11: Hoare triple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,661 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1414#true} #37#return; {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,662 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,662 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,663 INFO L263 TraceCheckUtils]: 2: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,663 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,663 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,663 INFO L263 TraceCheckUtils]: 5: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,664 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,664 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-18 04:58:41,665 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,665 INFO L280 TraceCheckUtils]: 9: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,667 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:58:41,667 INFO L280 TraceCheckUtils]: 11: Hoare triple {1578#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:58:41,668 INFO L280 TraceCheckUtils]: 12: Hoare triple {1578#(= 0 |id_#t~ret0|)} #res := 1 + #t~ret0; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,669 INFO L280 TraceCheckUtils]: 13: Hoare triple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} havoc #t~ret0; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,670 INFO L280 TraceCheckUtils]: 14: Hoare triple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,671 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1414#true} #37#return; {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,672 INFO L280 TraceCheckUtils]: 16: Hoare triple {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,673 INFO L280 TraceCheckUtils]: 17: Hoare triple {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} #res := 1 + #t~ret0; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,674 INFO L280 TraceCheckUtils]: 18: Hoare triple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} havoc #t~ret0; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,674 INFO L280 TraceCheckUtils]: 19: Hoare triple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,675 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1414#true} #37#return; {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,676 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,677 INFO L263 TraceCheckUtils]: 2: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,677 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,677 INFO L263 TraceCheckUtils]: 5: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,678 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,678 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,678 INFO L263 TraceCheckUtils]: 8: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,678 INFO L280 TraceCheckUtils]: 9: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,678 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-18 04:58:41,679 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,680 INFO L280 TraceCheckUtils]: 12: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,681 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:58:41,682 INFO L280 TraceCheckUtils]: 14: Hoare triple {1578#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:58:41,682 INFO L280 TraceCheckUtils]: 15: Hoare triple {1578#(= 0 |id_#t~ret0|)} #res := 1 + #t~ret0; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,683 INFO L280 TraceCheckUtils]: 16: Hoare triple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} havoc #t~ret0; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,684 INFO L280 TraceCheckUtils]: 17: Hoare triple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,685 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1414#true} #37#return; {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,685 INFO L280 TraceCheckUtils]: 19: Hoare triple {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,686 INFO L280 TraceCheckUtils]: 20: Hoare triple {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} #res := 1 + #t~ret0; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,687 INFO L280 TraceCheckUtils]: 21: Hoare triple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} havoc #t~ret0; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,688 INFO L280 TraceCheckUtils]: 22: Hoare triple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,689 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1414#true} #37#return; {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,689 INFO L280 TraceCheckUtils]: 24: Hoare triple {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,690 INFO L280 TraceCheckUtils]: 25: Hoare triple {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} #res := 1 + #t~ret0; {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-18 04:58:41,691 INFO L280 TraceCheckUtils]: 26: Hoare triple {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} havoc #t~ret0; {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-18 04:58:41,692 INFO L280 TraceCheckUtils]: 27: Hoare triple {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-18 04:58:41,693 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1414#true} #37#return; {1533#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,694 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,694 INFO L263 TraceCheckUtils]: 2: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,695 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,695 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,695 INFO L263 TraceCheckUtils]: 5: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,695 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,696 INFO L263 TraceCheckUtils]: 8: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,696 INFO L280 TraceCheckUtils]: 9: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,696 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,696 INFO L263 TraceCheckUtils]: 11: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,696 INFO L280 TraceCheckUtils]: 12: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,697 INFO L280 TraceCheckUtils]: 13: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-18 04:58:41,697 INFO L280 TraceCheckUtils]: 14: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,698 INFO L280 TraceCheckUtils]: 15: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,699 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:58:41,699 INFO L280 TraceCheckUtils]: 17: Hoare triple {1578#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:58:41,700 INFO L280 TraceCheckUtils]: 18: Hoare triple {1578#(= 0 |id_#t~ret0|)} #res := 1 + #t~ret0; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,701 INFO L280 TraceCheckUtils]: 19: Hoare triple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} havoc #t~ret0; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,701 INFO L280 TraceCheckUtils]: 20: Hoare triple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,702 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1414#true} #37#return; {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,703 INFO L280 TraceCheckUtils]: 22: Hoare triple {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,704 INFO L280 TraceCheckUtils]: 23: Hoare triple {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} #res := 1 + #t~ret0; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,705 INFO L280 TraceCheckUtils]: 24: Hoare triple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} havoc #t~ret0; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,705 INFO L280 TraceCheckUtils]: 25: Hoare triple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,707 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1414#true} #37#return; {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,707 INFO L280 TraceCheckUtils]: 27: Hoare triple {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,708 INFO L280 TraceCheckUtils]: 28: Hoare triple {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} #res := 1 + #t~ret0; {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-18 04:58:41,709 INFO L280 TraceCheckUtils]: 29: Hoare triple {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} havoc #t~ret0; {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-18 04:58:41,710 INFO L280 TraceCheckUtils]: 30: Hoare triple {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-18 04:58:41,711 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1414#true} #37#return; {1533#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,712 INFO L280 TraceCheckUtils]: 32: Hoare triple {1533#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1533#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,713 INFO L280 TraceCheckUtils]: 33: Hoare triple {1533#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} #res := 1 + #t~ret0; {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-18 04:58:41,714 INFO L280 TraceCheckUtils]: 34: Hoare triple {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} havoc #t~ret0; {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-18 04:58:41,714 INFO L280 TraceCheckUtils]: 35: Hoare triple {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-18 04:58:41,716 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1414#true} #37#return; {1502#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-18 04:58:41,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,719 INFO L263 TraceCheckUtils]: 2: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,720 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,720 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,720 INFO L263 TraceCheckUtils]: 5: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,720 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,720 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,721 INFO L263 TraceCheckUtils]: 8: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,721 INFO L280 TraceCheckUtils]: 9: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,721 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,721 INFO L263 TraceCheckUtils]: 11: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,722 INFO L280 TraceCheckUtils]: 12: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,722 INFO L280 TraceCheckUtils]: 13: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,722 INFO L263 TraceCheckUtils]: 14: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,722 INFO L280 TraceCheckUtils]: 15: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,723 INFO L280 TraceCheckUtils]: 16: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-18 04:58:41,723 INFO L280 TraceCheckUtils]: 17: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,724 INFO L280 TraceCheckUtils]: 18: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,725 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:58:41,726 INFO L280 TraceCheckUtils]: 20: Hoare triple {1578#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:58:41,727 INFO L280 TraceCheckUtils]: 21: Hoare triple {1578#(= 0 |id_#t~ret0|)} #res := 1 + #t~ret0; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,727 INFO L280 TraceCheckUtils]: 22: Hoare triple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} havoc #t~ret0; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,728 INFO L280 TraceCheckUtils]: 23: Hoare triple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,729 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1414#true} #37#return; {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,730 INFO L280 TraceCheckUtils]: 25: Hoare triple {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,731 INFO L280 TraceCheckUtils]: 26: Hoare triple {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} #res := 1 + #t~ret0; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,732 INFO L280 TraceCheckUtils]: 27: Hoare triple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} havoc #t~ret0; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,732 INFO L280 TraceCheckUtils]: 28: Hoare triple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,734 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1414#true} #37#return; {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,734 INFO L280 TraceCheckUtils]: 30: Hoare triple {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,735 INFO L280 TraceCheckUtils]: 31: Hoare triple {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} #res := 1 + #t~ret0; {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-18 04:58:41,736 INFO L280 TraceCheckUtils]: 32: Hoare triple {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} havoc #t~ret0; {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-18 04:58:41,737 INFO L280 TraceCheckUtils]: 33: Hoare triple {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-18 04:58:41,738 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1414#true} #37#return; {1533#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,739 INFO L280 TraceCheckUtils]: 35: Hoare triple {1533#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1533#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,739 INFO L280 TraceCheckUtils]: 36: Hoare triple {1533#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} #res := 1 + #t~ret0; {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-18 04:58:41,740 INFO L280 TraceCheckUtils]: 37: Hoare triple {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} havoc #t~ret0; {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-18 04:58:41,741 INFO L280 TraceCheckUtils]: 38: Hoare triple {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-18 04:58:41,749 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1414#true} #37#return; {1502#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-18 04:58:41,752 INFO L280 TraceCheckUtils]: 40: Hoare triple {1502#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1502#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-18 04:58:41,753 INFO L280 TraceCheckUtils]: 41: Hoare triple {1502#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} #res := 1 + #t~ret0; {1503#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-18 04:58:41,753 INFO L280 TraceCheckUtils]: 42: Hoare triple {1503#(and (<= 5 |id_#res|) (<= |id_#res| 5))} havoc #t~ret0; {1503#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-18 04:58:41,754 INFO L280 TraceCheckUtils]: 43: Hoare triple {1503#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1503#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-18 04:58:41,755 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1503#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1414#true} #35#return; {1463#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} is VALID [2020-07-18 04:58:41,758 INFO L263 TraceCheckUtils]: 0: Hoare triple {1414#true} call ULTIMATE.init(); {1414#true} is VALID [2020-07-18 04:58:41,758 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume true; {1414#true} is VALID [2020-07-18 04:58:41,759 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1414#true} {1414#true} #31#return; {1414#true} is VALID [2020-07-18 04:58:41,759 INFO L263 TraceCheckUtils]: 3: Hoare triple {1414#true} call #t~ret2 := main(); {1414#true} is VALID [2020-07-18 04:58:41,759 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} ~input~0 := 5; {1414#true} is VALID [2020-07-18 04:58:41,759 INFO L263 TraceCheckUtils]: 5: Hoare triple {1414#true} call #t~ret1 := id(~input~0); {1414#true} is VALID [2020-07-18 04:58:41,759 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,760 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,760 INFO L263 TraceCheckUtils]: 8: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,760 INFO L280 TraceCheckUtils]: 9: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,760 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,760 INFO L263 TraceCheckUtils]: 11: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,760 INFO L280 TraceCheckUtils]: 12: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,761 INFO L280 TraceCheckUtils]: 13: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,761 INFO L263 TraceCheckUtils]: 14: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,761 INFO L280 TraceCheckUtils]: 15: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,761 INFO L280 TraceCheckUtils]: 16: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,761 INFO L263 TraceCheckUtils]: 17: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,761 INFO L280 TraceCheckUtils]: 18: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,762 INFO L280 TraceCheckUtils]: 19: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-18 04:58:41,762 INFO L263 TraceCheckUtils]: 20: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-18 04:58:41,762 INFO L280 TraceCheckUtils]: 21: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-18 04:58:41,762 INFO L280 TraceCheckUtils]: 22: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-18 04:58:41,763 INFO L280 TraceCheckUtils]: 23: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,763 INFO L280 TraceCheckUtils]: 24: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-18 04:58:41,764 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:58:41,765 INFO L280 TraceCheckUtils]: 26: Hoare triple {1578#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:58:41,765 INFO L280 TraceCheckUtils]: 27: Hoare triple {1578#(= 0 |id_#t~ret0|)} #res := 1 + #t~ret0; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,766 INFO L280 TraceCheckUtils]: 28: Hoare triple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} havoc #t~ret0; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,767 INFO L280 TraceCheckUtils]: 29: Hoare triple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-18 04:58:41,768 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1579#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1414#true} #37#return; {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,768 INFO L280 TraceCheckUtils]: 31: Hoare triple {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,769 INFO L280 TraceCheckUtils]: 32: Hoare triple {1571#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} #res := 1 + #t~ret0; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,770 INFO L280 TraceCheckUtils]: 33: Hoare triple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} havoc #t~ret0; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,770 INFO L280 TraceCheckUtils]: 34: Hoare triple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-18 04:58:41,771 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1572#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1414#true} #37#return; {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,772 INFO L280 TraceCheckUtils]: 36: Hoare triple {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,773 INFO L280 TraceCheckUtils]: 37: Hoare triple {1556#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} #res := 1 + #t~ret0; {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-18 04:58:41,773 INFO L280 TraceCheckUtils]: 38: Hoare triple {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} havoc #t~ret0; {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-18 04:58:41,774 INFO L280 TraceCheckUtils]: 39: Hoare triple {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-18 04:58:41,775 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1557#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1414#true} #37#return; {1533#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,779 INFO L280 TraceCheckUtils]: 41: Hoare triple {1533#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1533#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-18 04:58:41,780 INFO L280 TraceCheckUtils]: 42: Hoare triple {1533#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} #res := 1 + #t~ret0; {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-18 04:58:41,781 INFO L280 TraceCheckUtils]: 43: Hoare triple {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} havoc #t~ret0; {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-18 04:58:41,781 INFO L280 TraceCheckUtils]: 44: Hoare triple {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-18 04:58:41,782 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1534#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1414#true} #37#return; {1502#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-18 04:58:41,783 INFO L280 TraceCheckUtils]: 46: Hoare triple {1502#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1502#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-18 04:58:41,784 INFO L280 TraceCheckUtils]: 47: Hoare triple {1502#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} #res := 1 + #t~ret0; {1503#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-18 04:58:41,784 INFO L280 TraceCheckUtils]: 48: Hoare triple {1503#(and (<= 5 |id_#res|) (<= |id_#res| 5))} havoc #t~ret0; {1503#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-18 04:58:41,785 INFO L280 TraceCheckUtils]: 49: Hoare triple {1503#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1503#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-18 04:58:41,786 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1503#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1414#true} #35#return; {1463#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} is VALID [2020-07-18 04:58:41,787 INFO L280 TraceCheckUtils]: 51: Hoare triple {1463#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1463#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} is VALID [2020-07-18 04:58:41,787 INFO L280 TraceCheckUtils]: 52: Hoare triple {1463#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} ~result~0 := #t~ret1; {1464#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-18 04:58:41,788 INFO L280 TraceCheckUtils]: 53: Hoare triple {1464#(and (< 4 main_~result~0) (<= main_~result~0 5))} havoc #t~ret1; {1464#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-18 04:58:41,789 INFO L280 TraceCheckUtils]: 54: Hoare triple {1464#(and (< 4 main_~result~0) (<= main_~result~0 5))} assume 5 != ~result~0; {1415#false} is VALID [2020-07-18 04:58:41,789 INFO L280 TraceCheckUtils]: 55: Hoare triple {1415#false} assume !false; {1415#false} is VALID [2020-07-18 04:58:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-18 04:58:41,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [907337458] [2020-07-18 04:58:41,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:58:41,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-18 04:58:41,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022472659] [2020-07-18 04:58:41,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-07-18 04:58:41,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:58:41,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 04:58:41,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:41,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 04:58:41,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:58:41,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 04:58:41,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-18 04:58:41,843 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 15 states. [2020-07-18 04:58:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:42,763 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-18 04:58:42,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-18 04:58:42,763 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-07-18 04:58:42,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:58:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 04:58:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 55 transitions. [2020-07-18 04:58:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 04:58:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 55 transitions. [2020-07-18 04:58:42,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 55 transitions. [2020-07-18 04:58:42,828 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-18 04:58:42,831 INFO L225 Difference]: With dead ends: 54 [2020-07-18 04:58:42,831 INFO L226 Difference]: Without dead ends: 48 [2020-07-18 04:58:42,832 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2020-07-18 04:58:42,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-18 04:58:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-18 04:58:42,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:58:42,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2020-07-18 04:58:42,895 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-18 04:58:42,895 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-18 04:58:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:42,897 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2020-07-18 04:58:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-18 04:58:42,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:42,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:42,897 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-18 04:58:42,898 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-18 04:58:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:42,900 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2020-07-18 04:58:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-18 04:58:42,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:42,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:42,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:58:42,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:58:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-18 04:58:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-07-18 04:58:42,903 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-07-18 04:58:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:58:42,903 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-07-18 04:58:42,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 04:58:42,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 49 transitions. [2020-07-18 04:58:42,958 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-18 04:58:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-18 04:58:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-18 04:58:42,959 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:58:42,959 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:58:42,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 04:58:42,960 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:58:42,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:58:42,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-07-18 04:58:42,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:58:42,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1857739824] [2020-07-18 04:58:42,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:58:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:43,019 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} assume true; {1895#true} is VALID [2020-07-18 04:58:43,020 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1895#true} {1895#true} #31#return; {1895#true} is VALID [2020-07-18 04:58:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:43,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,261 INFO L280 TraceCheckUtils]: 3: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,262 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2110#(= 0 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,263 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,264 INFO L263 TraceCheckUtils]: 2: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,264 INFO L280 TraceCheckUtils]: 3: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,265 INFO L280 TraceCheckUtils]: 4: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,266 INFO L280 TraceCheckUtils]: 5: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,266 INFO L280 TraceCheckUtils]: 6: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,267 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2110#(= 0 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,268 INFO L280 TraceCheckUtils]: 8: Hoare triple {2109#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,268 INFO L280 TraceCheckUtils]: 9: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,269 INFO L280 TraceCheckUtils]: 10: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,269 INFO L280 TraceCheckUtils]: 11: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,270 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2109#(<= 1 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,272 INFO L263 TraceCheckUtils]: 2: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,273 INFO L280 TraceCheckUtils]: 3: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,273 INFO L280 TraceCheckUtils]: 4: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,273 INFO L263 TraceCheckUtils]: 5: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,274 INFO L280 TraceCheckUtils]: 6: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,275 INFO L280 TraceCheckUtils]: 7: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,275 INFO L280 TraceCheckUtils]: 8: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,276 INFO L280 TraceCheckUtils]: 9: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,277 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2110#(= 0 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,277 INFO L280 TraceCheckUtils]: 11: Hoare triple {2109#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,278 INFO L280 TraceCheckUtils]: 12: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,279 INFO L280 TraceCheckUtils]: 13: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,279 INFO L280 TraceCheckUtils]: 14: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,280 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2109#(<= 1 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,281 INFO L280 TraceCheckUtils]: 16: Hoare triple {2103#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,281 INFO L280 TraceCheckUtils]: 17: Hoare triple {2103#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,282 INFO L280 TraceCheckUtils]: 18: Hoare triple {2103#(<= 2 |id_#in~x|)} havoc #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,282 INFO L280 TraceCheckUtils]: 19: Hoare triple {2103#(<= 2 |id_#in~x|)} assume true; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,283 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2103#(<= 2 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,300 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,302 INFO L280 TraceCheckUtils]: 1: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,303 INFO L263 TraceCheckUtils]: 2: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,307 INFO L280 TraceCheckUtils]: 3: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,308 INFO L280 TraceCheckUtils]: 4: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,308 INFO L263 TraceCheckUtils]: 5: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,309 INFO L280 TraceCheckUtils]: 6: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,309 INFO L280 TraceCheckUtils]: 7: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,309 INFO L263 TraceCheckUtils]: 8: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,310 INFO L280 TraceCheckUtils]: 9: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,310 INFO L280 TraceCheckUtils]: 10: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,310 INFO L280 TraceCheckUtils]: 11: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,311 INFO L280 TraceCheckUtils]: 12: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,311 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2110#(= 0 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,312 INFO L280 TraceCheckUtils]: 14: Hoare triple {2109#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,312 INFO L280 TraceCheckUtils]: 15: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,313 INFO L280 TraceCheckUtils]: 16: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,313 INFO L280 TraceCheckUtils]: 17: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,314 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2109#(<= 1 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,314 INFO L280 TraceCheckUtils]: 19: Hoare triple {2103#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,315 INFO L280 TraceCheckUtils]: 20: Hoare triple {2103#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,315 INFO L280 TraceCheckUtils]: 21: Hoare triple {2103#(<= 2 |id_#in~x|)} havoc #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,316 INFO L280 TraceCheckUtils]: 22: Hoare triple {2103#(<= 2 |id_#in~x|)} assume true; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,317 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2103#(<= 2 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,317 INFO L280 TraceCheckUtils]: 24: Hoare triple {2089#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,317 INFO L280 TraceCheckUtils]: 25: Hoare triple {2089#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,318 INFO L280 TraceCheckUtils]: 26: Hoare triple {2089#(<= 3 |id_#in~x|)} havoc #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,318 INFO L280 TraceCheckUtils]: 27: Hoare triple {2089#(<= 3 |id_#in~x|)} assume true; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,319 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2089#(<= 3 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,321 INFO L280 TraceCheckUtils]: 1: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,322 INFO L263 TraceCheckUtils]: 2: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,322 INFO L280 TraceCheckUtils]: 3: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,322 INFO L280 TraceCheckUtils]: 4: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,323 INFO L263 TraceCheckUtils]: 5: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,323 INFO L280 TraceCheckUtils]: 6: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,323 INFO L280 TraceCheckUtils]: 7: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,323 INFO L263 TraceCheckUtils]: 8: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,324 INFO L280 TraceCheckUtils]: 9: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,324 INFO L280 TraceCheckUtils]: 10: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,324 INFO L263 TraceCheckUtils]: 11: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,325 INFO L280 TraceCheckUtils]: 12: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,325 INFO L280 TraceCheckUtils]: 13: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,326 INFO L280 TraceCheckUtils]: 14: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,326 INFO L280 TraceCheckUtils]: 15: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,327 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2110#(= 0 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,327 INFO L280 TraceCheckUtils]: 17: Hoare triple {2109#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,328 INFO L280 TraceCheckUtils]: 18: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,328 INFO L280 TraceCheckUtils]: 19: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,329 INFO L280 TraceCheckUtils]: 20: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,330 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2109#(<= 1 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,330 INFO L280 TraceCheckUtils]: 22: Hoare triple {2103#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,331 INFO L280 TraceCheckUtils]: 23: Hoare triple {2103#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,331 INFO L280 TraceCheckUtils]: 24: Hoare triple {2103#(<= 2 |id_#in~x|)} havoc #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,331 INFO L280 TraceCheckUtils]: 25: Hoare triple {2103#(<= 2 |id_#in~x|)} assume true; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,332 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2103#(<= 2 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,333 INFO L280 TraceCheckUtils]: 27: Hoare triple {2089#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,336 INFO L280 TraceCheckUtils]: 28: Hoare triple {2089#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,338 INFO L280 TraceCheckUtils]: 29: Hoare triple {2089#(<= 3 |id_#in~x|)} havoc #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,339 INFO L280 TraceCheckUtils]: 30: Hoare triple {2089#(<= 3 |id_#in~x|)} assume true; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,340 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2089#(<= 3 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,340 INFO L280 TraceCheckUtils]: 32: Hoare triple {2067#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,341 INFO L280 TraceCheckUtils]: 33: Hoare triple {2067#(<= 4 |id_#in~x|)} #res := 1 + #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,341 INFO L280 TraceCheckUtils]: 34: Hoare triple {2067#(<= 4 |id_#in~x|)} havoc #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,342 INFO L280 TraceCheckUtils]: 35: Hoare triple {2067#(<= 4 |id_#in~x|)} assume true; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,343 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2067#(<= 4 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,346 INFO L263 TraceCheckUtils]: 2: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,348 INFO L280 TraceCheckUtils]: 4: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,348 INFO L263 TraceCheckUtils]: 5: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,349 INFO L280 TraceCheckUtils]: 6: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,349 INFO L280 TraceCheckUtils]: 7: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,349 INFO L263 TraceCheckUtils]: 8: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,350 INFO L280 TraceCheckUtils]: 9: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,350 INFO L280 TraceCheckUtils]: 10: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,350 INFO L263 TraceCheckUtils]: 11: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,351 INFO L280 TraceCheckUtils]: 12: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,352 INFO L280 TraceCheckUtils]: 13: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,352 INFO L263 TraceCheckUtils]: 14: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,352 INFO L280 TraceCheckUtils]: 15: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,353 INFO L280 TraceCheckUtils]: 16: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,353 INFO L280 TraceCheckUtils]: 17: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,354 INFO L280 TraceCheckUtils]: 18: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,355 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2110#(= 0 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,355 INFO L280 TraceCheckUtils]: 20: Hoare triple {2109#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,356 INFO L280 TraceCheckUtils]: 21: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,356 INFO L280 TraceCheckUtils]: 22: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,357 INFO L280 TraceCheckUtils]: 23: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,358 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2109#(<= 1 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,359 INFO L280 TraceCheckUtils]: 25: Hoare triple {2103#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,359 INFO L280 TraceCheckUtils]: 26: Hoare triple {2103#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,360 INFO L280 TraceCheckUtils]: 27: Hoare triple {2103#(<= 2 |id_#in~x|)} havoc #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,360 INFO L280 TraceCheckUtils]: 28: Hoare triple {2103#(<= 2 |id_#in~x|)} assume true; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,361 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2103#(<= 2 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,362 INFO L280 TraceCheckUtils]: 30: Hoare triple {2089#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,362 INFO L280 TraceCheckUtils]: 31: Hoare triple {2089#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,363 INFO L280 TraceCheckUtils]: 32: Hoare triple {2089#(<= 3 |id_#in~x|)} havoc #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,363 INFO L280 TraceCheckUtils]: 33: Hoare triple {2089#(<= 3 |id_#in~x|)} assume true; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,364 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2089#(<= 3 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,365 INFO L280 TraceCheckUtils]: 35: Hoare triple {2067#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,365 INFO L280 TraceCheckUtils]: 36: Hoare triple {2067#(<= 4 |id_#in~x|)} #res := 1 + #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,366 INFO L280 TraceCheckUtils]: 37: Hoare triple {2067#(<= 4 |id_#in~x|)} havoc #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,366 INFO L280 TraceCheckUtils]: 38: Hoare triple {2067#(<= 4 |id_#in~x|)} assume true; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,367 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2067#(<= 4 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,368 INFO L280 TraceCheckUtils]: 40: Hoare triple {2037#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,368 INFO L280 TraceCheckUtils]: 41: Hoare triple {2037#(<= 5 |id_#in~x|)} #res := 1 + #t~ret0; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,369 INFO L280 TraceCheckUtils]: 42: Hoare triple {2037#(<= 5 |id_#in~x|)} havoc #t~ret0; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,369 INFO L280 TraceCheckUtils]: 43: Hoare triple {2037#(<= 5 |id_#in~x|)} assume true; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,370 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2037#(<= 5 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-18 04:58:43,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,374 INFO L263 TraceCheckUtils]: 2: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,374 INFO L280 TraceCheckUtils]: 3: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,375 INFO L280 TraceCheckUtils]: 4: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,375 INFO L263 TraceCheckUtils]: 5: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,375 INFO L280 TraceCheckUtils]: 6: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,376 INFO L280 TraceCheckUtils]: 7: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,376 INFO L263 TraceCheckUtils]: 8: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,377 INFO L280 TraceCheckUtils]: 9: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,377 INFO L280 TraceCheckUtils]: 10: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,377 INFO L263 TraceCheckUtils]: 11: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,378 INFO L280 TraceCheckUtils]: 12: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,378 INFO L280 TraceCheckUtils]: 13: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,379 INFO L263 TraceCheckUtils]: 14: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,379 INFO L280 TraceCheckUtils]: 15: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,380 INFO L280 TraceCheckUtils]: 16: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,380 INFO L263 TraceCheckUtils]: 17: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,380 INFO L280 TraceCheckUtils]: 18: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,381 INFO L280 TraceCheckUtils]: 19: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,381 INFO L280 TraceCheckUtils]: 20: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,382 INFO L280 TraceCheckUtils]: 21: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,383 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2110#(= 0 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,384 INFO L280 TraceCheckUtils]: 23: Hoare triple {2109#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,384 INFO L280 TraceCheckUtils]: 24: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,385 INFO L280 TraceCheckUtils]: 25: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,385 INFO L280 TraceCheckUtils]: 26: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,386 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2109#(<= 1 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,387 INFO L280 TraceCheckUtils]: 28: Hoare triple {2103#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,387 INFO L280 TraceCheckUtils]: 29: Hoare triple {2103#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,388 INFO L280 TraceCheckUtils]: 30: Hoare triple {2103#(<= 2 |id_#in~x|)} havoc #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,389 INFO L280 TraceCheckUtils]: 31: Hoare triple {2103#(<= 2 |id_#in~x|)} assume true; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,390 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2103#(<= 2 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,390 INFO L280 TraceCheckUtils]: 33: Hoare triple {2089#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,391 INFO L280 TraceCheckUtils]: 34: Hoare triple {2089#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,392 INFO L280 TraceCheckUtils]: 35: Hoare triple {2089#(<= 3 |id_#in~x|)} havoc #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,392 INFO L280 TraceCheckUtils]: 36: Hoare triple {2089#(<= 3 |id_#in~x|)} assume true; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,393 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2089#(<= 3 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,394 INFO L280 TraceCheckUtils]: 38: Hoare triple {2067#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,394 INFO L280 TraceCheckUtils]: 39: Hoare triple {2067#(<= 4 |id_#in~x|)} #res := 1 + #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,395 INFO L280 TraceCheckUtils]: 40: Hoare triple {2067#(<= 4 |id_#in~x|)} havoc #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,396 INFO L280 TraceCheckUtils]: 41: Hoare triple {2067#(<= 4 |id_#in~x|)} assume true; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,397 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2067#(<= 4 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,398 INFO L280 TraceCheckUtils]: 43: Hoare triple {2037#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,398 INFO L280 TraceCheckUtils]: 44: Hoare triple {2037#(<= 5 |id_#in~x|)} #res := 1 + #t~ret0; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,399 INFO L280 TraceCheckUtils]: 45: Hoare triple {2037#(<= 5 |id_#in~x|)} havoc #t~ret0; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,399 INFO L280 TraceCheckUtils]: 46: Hoare triple {2037#(<= 5 |id_#in~x|)} assume true; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,401 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2037#(<= 5 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-18 04:58:43,402 INFO L280 TraceCheckUtils]: 48: Hoare triple {1999#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-18 04:58:43,404 INFO L280 TraceCheckUtils]: 49: Hoare triple {1999#(<= 6 |id_#in~x|)} #res := 1 + #t~ret0; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-18 04:58:43,405 INFO L280 TraceCheckUtils]: 50: Hoare triple {1999#(<= 6 |id_#in~x|)} havoc #t~ret0; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-18 04:58:43,406 INFO L280 TraceCheckUtils]: 51: Hoare triple {1999#(<= 6 |id_#in~x|)} assume true; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-18 04:58:43,407 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1999#(<= 6 |id_#in~x|)} {1899#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #35#return; {1896#false} is VALID [2020-07-18 04:58:43,411 INFO L263 TraceCheckUtils]: 0: Hoare triple {1895#true} call ULTIMATE.init(); {1895#true} is VALID [2020-07-18 04:58:43,412 INFO L280 TraceCheckUtils]: 1: Hoare triple {1895#true} assume true; {1895#true} is VALID [2020-07-18 04:58:43,412 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1895#true} {1895#true} #31#return; {1895#true} is VALID [2020-07-18 04:58:43,412 INFO L263 TraceCheckUtils]: 3: Hoare triple {1895#true} call #t~ret2 := main(); {1895#true} is VALID [2020-07-18 04:58:43,413 INFO L280 TraceCheckUtils]: 4: Hoare triple {1895#true} ~input~0 := 5; {1899#(and (<= main_~input~0 5) (<= 5 main_~input~0))} is VALID [2020-07-18 04:58:43,413 INFO L263 TraceCheckUtils]: 5: Hoare triple {1899#(and (<= main_~input~0 5) (<= 5 main_~input~0))} call #t~ret1 := id(~input~0); {1895#true} is VALID [2020-07-18 04:58:43,414 INFO L280 TraceCheckUtils]: 6: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,414 INFO L280 TraceCheckUtils]: 7: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,415 INFO L263 TraceCheckUtils]: 8: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,415 INFO L280 TraceCheckUtils]: 9: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,416 INFO L280 TraceCheckUtils]: 10: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,416 INFO L263 TraceCheckUtils]: 11: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,417 INFO L280 TraceCheckUtils]: 12: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,417 INFO L280 TraceCheckUtils]: 13: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,418 INFO L263 TraceCheckUtils]: 14: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,418 INFO L280 TraceCheckUtils]: 15: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,419 INFO L280 TraceCheckUtils]: 16: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,419 INFO L263 TraceCheckUtils]: 17: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,419 INFO L280 TraceCheckUtils]: 18: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,420 INFO L280 TraceCheckUtils]: 19: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,420 INFO L263 TraceCheckUtils]: 20: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,421 INFO L280 TraceCheckUtils]: 21: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,421 INFO L280 TraceCheckUtils]: 22: Hoare triple {1953#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,421 INFO L263 TraceCheckUtils]: 23: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-18 04:58:43,422 INFO L280 TraceCheckUtils]: 24: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:43,422 INFO L280 TraceCheckUtils]: 25: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,423 INFO L280 TraceCheckUtils]: 26: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,423 INFO L280 TraceCheckUtils]: 27: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:43,424 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2110#(= 0 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,426 INFO L280 TraceCheckUtils]: 29: Hoare triple {2109#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,427 INFO L280 TraceCheckUtils]: 30: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,429 INFO L280 TraceCheckUtils]: 31: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,431 INFO L280 TraceCheckUtils]: 32: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-18 04:58:43,433 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2109#(<= 1 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,433 INFO L280 TraceCheckUtils]: 34: Hoare triple {2103#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,434 INFO L280 TraceCheckUtils]: 35: Hoare triple {2103#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,434 INFO L280 TraceCheckUtils]: 36: Hoare triple {2103#(<= 2 |id_#in~x|)} havoc #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,435 INFO L280 TraceCheckUtils]: 37: Hoare triple {2103#(<= 2 |id_#in~x|)} assume true; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-18 04:58:43,436 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2103#(<= 2 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,437 INFO L280 TraceCheckUtils]: 39: Hoare triple {2089#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,437 INFO L280 TraceCheckUtils]: 40: Hoare triple {2089#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,438 INFO L280 TraceCheckUtils]: 41: Hoare triple {2089#(<= 3 |id_#in~x|)} havoc #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,439 INFO L280 TraceCheckUtils]: 42: Hoare triple {2089#(<= 3 |id_#in~x|)} assume true; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-18 04:58:43,451 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2089#(<= 3 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,452 INFO L280 TraceCheckUtils]: 44: Hoare triple {2067#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,453 INFO L280 TraceCheckUtils]: 45: Hoare triple {2067#(<= 4 |id_#in~x|)} #res := 1 + #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,453 INFO L280 TraceCheckUtils]: 46: Hoare triple {2067#(<= 4 |id_#in~x|)} havoc #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,453 INFO L280 TraceCheckUtils]: 47: Hoare triple {2067#(<= 4 |id_#in~x|)} assume true; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-18 04:58:43,454 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2067#(<= 4 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,454 INFO L280 TraceCheckUtils]: 49: Hoare triple {2037#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,455 INFO L280 TraceCheckUtils]: 50: Hoare triple {2037#(<= 5 |id_#in~x|)} #res := 1 + #t~ret0; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,455 INFO L280 TraceCheckUtils]: 51: Hoare triple {2037#(<= 5 |id_#in~x|)} havoc #t~ret0; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,456 INFO L280 TraceCheckUtils]: 52: Hoare triple {2037#(<= 5 |id_#in~x|)} assume true; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-18 04:58:43,456 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2037#(<= 5 |id_#in~x|)} {1953#(= |id_#in~x| id_~x)} #37#return; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-18 04:58:43,457 INFO L280 TraceCheckUtils]: 54: Hoare triple {1999#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-18 04:58:43,457 INFO L280 TraceCheckUtils]: 55: Hoare triple {1999#(<= 6 |id_#in~x|)} #res := 1 + #t~ret0; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-18 04:58:43,457 INFO L280 TraceCheckUtils]: 56: Hoare triple {1999#(<= 6 |id_#in~x|)} havoc #t~ret0; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-18 04:58:43,458 INFO L280 TraceCheckUtils]: 57: Hoare triple {1999#(<= 6 |id_#in~x|)} assume true; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-18 04:58:43,458 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {1999#(<= 6 |id_#in~x|)} {1899#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #35#return; {1896#false} is VALID [2020-07-18 04:58:43,458 INFO L280 TraceCheckUtils]: 59: Hoare triple {1896#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1896#false} is VALID [2020-07-18 04:58:43,459 INFO L280 TraceCheckUtils]: 60: Hoare triple {1896#false} ~result~0 := #t~ret1; {1896#false} is VALID [2020-07-18 04:58:43,459 INFO L280 TraceCheckUtils]: 61: Hoare triple {1896#false} havoc #t~ret1; {1896#false} is VALID [2020-07-18 04:58:43,459 INFO L280 TraceCheckUtils]: 62: Hoare triple {1896#false} assume 5 != ~result~0; {1896#false} is VALID [2020-07-18 04:58:43,459 INFO L280 TraceCheckUtils]: 63: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2020-07-18 04:58:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 75 proven. 12 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-07-18 04:58:43,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1857739824] [2020-07-18 04:58:43,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:58:43,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-18 04:58:43,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794720464] [2020-07-18 04:58:43,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-07-18 04:58:43,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:58:43,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 04:58:43,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:43,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 04:58:43,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:58:43,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 04:58:43,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-07-18 04:58:43,523 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-07-18 04:58:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:44,335 INFO L93 Difference]: Finished difference Result 86 states and 122 transitions. [2020-07-18 04:58:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 04:58:44,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-07-18 04:58:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:58:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 04:58:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2020-07-18 04:58:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 04:58:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2020-07-18 04:58:44,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 103 transitions. [2020-07-18 04:58:44,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:44,452 INFO L225 Difference]: With dead ends: 86 [2020-07-18 04:58:44,452 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 04:58:44,455 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2020-07-18 04:58:44,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 04:58:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 04:58:44,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:58:44,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 04:58:44,455 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:58:44,456 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:58:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:44,456 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:58:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:58:44,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:44,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:44,456 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:58:44,457 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:58:44,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:44,457 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:58:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:58:44,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:44,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:44,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:58:44,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:58:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 04:58:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 04:58:44,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2020-07-18 04:58:44,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:58:44,458 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 04:58:44,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 04:58:44,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 04:58:44,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:44,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:58:44,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:44,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 04:58:44,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 04:58:44,882 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2020-07-18 04:58:45,078 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2020-07-18 04:58:45,302 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2020-07-18 04:58:45,501 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2020-07-18 04:58:45,638 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2020-07-18 04:58:45,648 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:58:45,648 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:58:45,649 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:58:45,649 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 04:58:45,649 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 04:58:45,649 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:58:45,649 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) the Hoare annotation is: false [2020-07-18 04:58:45,649 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-07-18 04:58:45,649 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 9 15) the Hoare annotation is: (<= 5 main_~input~0) [2020-07-18 04:58:45,650 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: false [2020-07-18 04:58:45,650 INFO L264 CegarLoopResult]: At program point L12(lines 12 14) the Hoare annotation is: (and (<= 5 main_~input~0) (< 4 main_~result~0) (<= main_~result~0 5)) [2020-07-18 04:58:45,650 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-07-18 04:58:45,650 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (and (<= 5 main_~input~0) (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5)) [2020-07-18 04:58:45,650 INFO L264 CegarLoopResult]: At program point L12-2(lines 9 15) the Hoare annotation is: (<= 5 main_~input~0) [2020-07-18 04:58:45,650 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (and (<= 5 main_~input~0) (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5)) [2020-07-18 04:58:45,650 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (and (<= 5 main_~input~0) (< 4 main_~result~0) (<= 5 |main_#t~ret1|) (<= main_~result~0 5) (<= |main_#t~ret1| 5)) [2020-07-18 04:58:45,650 INFO L264 CegarLoopResult]: At program point idFINAL(lines 4 7) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and .cse0 (<= 6 |id_#in~x|)) (and (<= |id_#res| 4) (<= 4 |id_#in~x|) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4)) (and (<= |id_#res| 3) (<= |id_#in~x| 3) (<= 3 |id_#in~x|) (<= 3 |id_#res|) .cse0) (and (= 0 |id_#in~x|) .cse0 (= 0 |id_#res|)) (and (<= 5 |id_#res|) (<= |id_#res| 5) (<= 5 |id_#in~x|) .cse0) (and (<= 1 |id_#res|) (<= 1 |id_#in~x|) (<= |id_#res| 1) (<= |id_#in~x| 1) .cse0) (and (<= |id_#res| 2) (<= 2 |id_#res|) (<= |id_#in~x| 2) .cse0 (<= 2 |id_#in~x|)))) [2020-07-18 04:58:45,651 INFO L264 CegarLoopResult]: At program point idEXIT(lines 4 7) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and .cse0 (<= 6 |id_#in~x|)) (and (<= |id_#res| 4) (<= 4 |id_#in~x|) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4)) (and (<= |id_#res| 3) (<= |id_#in~x| 3) (<= 3 |id_#in~x|) (<= 3 |id_#res|) .cse0) (and (= 0 |id_#in~x|) .cse0 (= 0 |id_#res|)) (and (<= 5 |id_#res|) (<= |id_#res| 5) (<= 5 |id_#in~x|) .cse0) (and (<= 1 |id_#res|) (<= 1 |id_#in~x|) (<= |id_#res| 1) (<= |id_#in~x| 1) .cse0) (and (<= |id_#res| 2) (<= 2 |id_#res|) (<= |id_#in~x| 2) .cse0 (<= 2 |id_#in~x|)))) [2020-07-18 04:58:45,651 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-07-18 04:58:45,651 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-18 04:58:45,651 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-18 04:58:45,652 INFO L264 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4) (<= 5 |id_#in~x|) .cse0) (and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|) (<= |id_#in~x| 2) .cse0 (<= 2 |id_#in~x|)) (and .cse0 (<= 6 |id_#in~x|)) (and (= 0 |id_#t~ret0|) (<= 1 |id_#in~x|) (<= |id_#in~x| 1) .cse0) (and (<= |id_#in~x| 3) (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|) .cse0) (and (<= 4 |id_#in~x|) (<= |id_#t~ret0| 3) .cse0 (<= 3 |id_#t~ret0|) (<= |id_#in~x| 4)))) [2020-07-18 04:58:45,652 INFO L264 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: (and (= 0 |id_#in~x|) (= |id_#in~x| id_~x)) [2020-07-18 04:58:45,653 INFO L264 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4) (<= 5 |id_#in~x|) .cse0) (and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|) (<= |id_#in~x| 2) .cse0 (<= 2 |id_#in~x|)) (and .cse0 (<= 6 |id_#in~x|)) (and (= 0 |id_#t~ret0|) (<= 1 |id_#in~x|) (<= |id_#in~x| 1) .cse0) (and (<= |id_#in~x| 3) (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|) .cse0) (and (<= 4 |id_#in~x|) (<= |id_#t~ret0| 3) .cse0 (<= 3 |id_#t~ret0|) (<= |id_#in~x| 4)))) [2020-07-18 04:58:45,653 INFO L264 CegarLoopResult]: At program point L6-3(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= |id_#res| 2) (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|) (<= 2 |id_#res|) (<= |id_#in~x| 2) .cse0 (<= 2 |id_#in~x|)) (and .cse0 (<= 6 |id_#in~x|)) (and (= 0 |id_#t~ret0|) (<= 1 |id_#res|) (<= 1 |id_#in~x|) (<= |id_#res| 1) (<= |id_#in~x| 1) .cse0) (and (<= |id_#res| 3) (<= |id_#in~x| 3) (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) (<= 3 |id_#res|) (<= 2 |id_#t~ret0|) .cse0) (and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4) (<= 5 |id_#res|) (<= |id_#res| 5) (<= 5 |id_#in~x|) .cse0) (and (<= |id_#res| 4) (<= 4 |id_#in~x|) (<= 4 |id_#res|) (<= |id_#t~ret0| 3) .cse0 (<= 3 |id_#t~ret0|) (<= |id_#in~x| 4)))) [2020-07-18 04:58:45,670 INFO L163 areAnnotationChecker]: CFG has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 04:58:45,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 04:58:45 BoogieIcfgContainer [2020-07-18 04:58:45,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 04:58:45,689 INFO L168 Benchmark]: Toolchain (without parser) took 8738.66 ms. Allocated memory was 146.3 MB in the beginning and 308.3 MB in the end (delta: 162.0 MB). Free memory was 104.9 MB in the beginning and 244.4 MB in the end (delta: -139.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2020-07-18 04:58:45,689 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 04:58:45,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.25 ms. Allocated memory is still 146.3 MB. Free memory was 104.4 MB in the beginning and 95.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-18 04:58:45,691 INFO L168 Benchmark]: Boogie Preprocessor took 23.13 ms. Allocated memory is still 146.3 MB. Free memory was 95.1 MB in the beginning and 93.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:58:45,691 INFO L168 Benchmark]: RCFGBuilder took 382.51 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 93.7 MB in the beginning and 169.5 MB in the end (delta: -75.8 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-18 04:58:45,692 INFO L168 Benchmark]: TraceAbstraction took 8107.06 ms. Allocated memory was 204.5 MB in the beginning and 308.3 MB in the end (delta: 103.8 MB). Free memory was 168.5 MB in the beginning and 244.4 MB in the end (delta: -75.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2020-07-18 04:58:45,695 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.19 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 219.25 ms. Allocated memory is still 146.3 MB. Free memory was 104.4 MB in the beginning and 95.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.13 ms. Allocated memory is still 146.3 MB. Free memory was 95.1 MB in the beginning and 93.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 382.51 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 93.7 MB in the beginning and 169.5 MB in the end (delta: -75.8 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8107.06 ms. Allocated memory was 204.5 MB in the beginning and 308.3 MB in the end (delta: 103.8 MB). Free memory was 168.5 MB in the beginning and 244.4 MB in the end (delta: -75.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 9]: Procedure Contract for main Derived contract for procedure main: 5 <= input - ProcedureContractResult [Line: 4]: Procedure Contract for id Derived contract for procedure id: ((((((\old(x) == x && 6 <= \old(x)) || ((((\result <= 4 && 4 <= \old(x)) && 4 <= \result) && \old(x) == x) && \old(x) <= 4)) || ((((\result <= 3 && \old(x) <= 3) && 3 <= \old(x)) && 3 <= \result) && \old(x) == x)) || ((0 == \old(x) && \old(x) == x) && 0 == \result)) || (((5 <= \result && \result <= 5) && 5 <= \old(x)) && \old(x) == x)) || ((((1 <= \result && 1 <= \old(x)) && \result <= 1) && \old(x) <= 1) && \old(x) == x)) || ((((\result <= 2 && 2 <= \result) && \old(x) <= 2) && \old(x) == x) && 2 <= \old(x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.7s, OverallIterations: 7, TraceHistogramMax: 7, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 159 SDtfs, 137 SDslu, 701 SDs, 0 SdLazy, 470 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 79 PreInvPairs, 288 NumberOfFragments, 548 HoareAnnotationTreeSize, 79 FomulaSimplifications, 366 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 25 FomulaSimplificationsInter, 1800 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 34973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 222/364 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...