/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-8fc6572 [2020-07-11 00:52:51,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:52:51,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:52:51,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:52:51,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:52:51,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:52:51,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:52:51,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:52:51,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:52:51,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:52:51,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:52:51,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:52:51,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:52:51,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:52:51,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:52:51,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:52:51,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:52:51,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:52:51,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:52:51,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:52:51,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:52:51,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:52:51,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:52:51,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:52:51,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:52:51,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:52:51,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:52:51,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:52:51,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:52:51,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:52:51,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:52:51,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:52:51,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:52:51,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:52:51,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:52:51,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:52:51,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:52:51,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:52:51,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:52:51,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:52:51,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:52:51,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:52:51,437 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:52:51,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:52:51,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:52:51,439 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:52:51,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:52:51,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:52:51,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:52:51,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:52:51,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:52:51,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:52:51,442 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:52:51,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:52:51,443 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:52:51,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:52:51,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:52:51,446 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:52:51,446 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:52:51,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:52:51,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:52:51,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:52:51,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:52:51,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:52:51,448 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:52:51,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:52:51,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:52:51,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:52:51,743 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:52:51,743 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:52:51,744 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-11 00:52:51,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890cd86b7/b2fa8534387f463d9d9f57456bd92615/FLAGa63f34302 [2020-07-11 00:52:52,297 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:52:52,298 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c [2020-07-11 00:52:52,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890cd86b7/b2fa8534387f463d9d9f57456bd92615/FLAGa63f34302 [2020-07-11 00:52:52,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890cd86b7/b2fa8534387f463d9d9f57456bd92615 [2020-07-11 00:52:52,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:52:52,725 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:52:52,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:52:52,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:52:52,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:52:52,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:52:52" (1/1) ... [2020-07-11 00:52:52,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2b15d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:52, skipping insertion in model container [2020-07-11 00:52:52,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:52:52" (1/1) ... [2020-07-11 00:52:52,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:52:52,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:52:52,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:52:52,923 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:52:52,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:52:52,955 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:52:52,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:52 WrapperNode [2020-07-11 00:52:52,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:52:52,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:52:52,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:52:52,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:52:52,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:52" (1/1) ... [2020-07-11 00:52:52,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:52" (1/1) ... [2020-07-11 00:52:52,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:52" (1/1) ... [2020-07-11 00:52:52,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:52" (1/1) ... [2020-07-11 00:52:52,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:52" (1/1) ... [2020-07-11 00:52:52,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:52" (1/1) ... [2020-07-11 00:52:52,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:52" (1/1) ... [2020-07-11 00:52:52,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:52:52,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:52:52,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:52:52,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:52:52,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:52:53,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:52:53,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:52:53,124 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-11 00:52:53,124 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:52:53,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:52:53,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:52:53,124 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-11 00:52:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:52:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:52:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:52:53,356 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:52:53,356 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:52:53,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:52:53 BoogieIcfgContainer [2020-07-11 00:52:53,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:52:53,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:52:53,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:52:53,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:52:53,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:52:52" (1/3) ... [2020-07-11 00:52:53,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167c995f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:52:53, skipping insertion in model container [2020-07-11 00:52:53,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:52" (2/3) ... [2020-07-11 00:52:53,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167c995f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:52:53, skipping insertion in model container [2020-07-11 00:52:53,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:52:53" (3/3) ... [2020-07-11 00:52:53,372 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i5_o5-2.c [2020-07-11 00:52:53,387 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:52:53,395 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:52:53,414 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:52:53,436 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:52:53,436 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:52:53,436 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:52:53,436 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:52:53,436 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:52:53,437 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:52:53,437 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:52:53,437 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:52:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-11 00:52:53,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-11 00:52:53,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:52:53,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:52:53,464 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:52:53,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:52:53,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-07-11 00:52:53,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:52:53,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [379179675] [2020-07-11 00:52:53,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:52:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:53,687 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-11 00:52:53,687 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {28#true} {28#true} #31#return; {28#true} is VALID [2020-07-11 00:52:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:53,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:53,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x; {39#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:53,746 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#(= 0 |id_#in~x|)} #res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:53,747 INFO L280 TraceCheckUtils]: 3: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:53,750 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {39#(= 0 |id_#in~x|)} {32#(<= 5 main_~input~0)} #35#return; {29#false} is VALID [2020-07-11 00:52:53,751 INFO L263 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2020-07-11 00:52:53,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-11 00:52:53,751 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #31#return; {28#true} is VALID [2020-07-11 00:52:53,752 INFO L263 TraceCheckUtils]: 3: Hoare triple {28#true} call #t~ret2 := main(); {28#true} is VALID [2020-07-11 00:52:53,753 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#true} ~input~0 := 5; {32#(<= 5 main_~input~0)} is VALID [2020-07-11 00:52:53,753 INFO L263 TraceCheckUtils]: 5: Hoare triple {32#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {28#true} is VALID [2020-07-11 00:52:53,755 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:53,756 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x; {39#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:53,756 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#(= 0 |id_#in~x|)} #res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:53,757 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:53,759 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {39#(= 0 |id_#in~x|)} {32#(<= 5 main_~input~0)} #35#return; {29#false} is VALID [2020-07-11 00:52:53,760 INFO L280 TraceCheckUtils]: 11: Hoare triple {29#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {29#false} is VALID [2020-07-11 00:52:53,760 INFO L280 TraceCheckUtils]: 12: Hoare triple {29#false} ~result~0 := #t~ret1; {29#false} is VALID [2020-07-11 00:52:53,760 INFO L280 TraceCheckUtils]: 13: Hoare triple {29#false} havoc #t~ret1; {29#false} is VALID [2020-07-11 00:52:53,761 INFO L280 TraceCheckUtils]: 14: Hoare triple {29#false} assume 5 != ~result~0; {29#false} is VALID [2020-07-11 00:52:53,761 INFO L280 TraceCheckUtils]: 15: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-11 00:52:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:52:53,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [379179675] [2020-07-11 00:52:53,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:52:53,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:52:53,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069133758] [2020-07-11 00:52:53,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-11 00:52:53,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:52:53,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:52:53,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:53,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:52:53,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:52:53,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:52:53,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:52:53,833 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-07-11 00:52:54,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:54,107 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-11 00:52:54,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:52:54,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-11 00:52:54,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:52:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:52:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-11 00:52:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:52:54,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-11 00:52:54,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-11 00:52:54,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:54,232 INFO L225 Difference]: With dead ends: 37 [2020-07-11 00:52:54,232 INFO L226 Difference]: Without dead ends: 23 [2020-07-11 00:52:54,244 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:52:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-11 00:52:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-11 00:52:54,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:52:54,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-11 00:52:54,338 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-11 00:52:54,339 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-11 00:52:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:54,344 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-11 00:52:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-11 00:52:54,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:54,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:54,346 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-11 00:52:54,346 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-11 00:52:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:54,351 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-11 00:52:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-11 00:52:54,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:54,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:54,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:52:54,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:52:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-11 00:52:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-11 00:52:54,358 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-07-11 00:52:54,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:52:54,359 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-11 00:52:54,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:52:54,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2020-07-11 00:52:54,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-11 00:52:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 00:52:54,401 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:52:54,401 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-11 00:52:54,402 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:52:54,402 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:52:54,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:52:54,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-07-11 00:52:54,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:52:54,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2012600248] [2020-07-11 00:52:54,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:52:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:54,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-11 00:52:54,468 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {210#true} {210#true} #31#return; {210#true} is VALID [2020-07-11 00:52:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:54,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:54,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:54,541 INFO L280 TraceCheckUtils]: 2: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:54,542 INFO L280 TraceCheckUtils]: 3: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:54,543 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-11 00:52:54,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:54,545 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-11 00:52:54,546 INFO L263 TraceCheckUtils]: 2: Hoare triple {228#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {210#true} is VALID [2020-07-11 00:52:54,547 INFO L280 TraceCheckUtils]: 3: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:54,548 INFO L280 TraceCheckUtils]: 4: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:54,548 INFO L280 TraceCheckUtils]: 5: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:54,549 INFO L280 TraceCheckUtils]: 6: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:54,551 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-11 00:52:54,551 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-11 00:52:54,552 INFO L280 TraceCheckUtils]: 9: Hoare triple {234#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:54,553 INFO L280 TraceCheckUtils]: 10: Hoare triple {234#(<= |id_#in~x| 1)} havoc #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:54,554 INFO L280 TraceCheckUtils]: 11: Hoare triple {234#(<= |id_#in~x| 1)} assume true; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:54,555 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {234#(<= |id_#in~x| 1)} {214#(<= 5 main_~input~0)} #35#return; {211#false} is VALID [2020-07-11 00:52:54,557 INFO L263 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2020-07-11 00:52:54,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-11 00:52:54,558 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #31#return; {210#true} is VALID [2020-07-11 00:52:54,558 INFO L263 TraceCheckUtils]: 3: Hoare triple {210#true} call #t~ret2 := main(); {210#true} is VALID [2020-07-11 00:52:54,560 INFO L280 TraceCheckUtils]: 4: Hoare triple {210#true} ~input~0 := 5; {214#(<= 5 main_~input~0)} is VALID [2020-07-11 00:52:54,560 INFO L263 TraceCheckUtils]: 5: Hoare triple {214#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {210#true} is VALID [2020-07-11 00:52:54,561 INFO L280 TraceCheckUtils]: 6: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:54,562 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-11 00:52:54,562 INFO L263 TraceCheckUtils]: 8: Hoare triple {228#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {210#true} is VALID [2020-07-11 00:52:54,563 INFO L280 TraceCheckUtils]: 9: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:54,564 INFO L280 TraceCheckUtils]: 10: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:54,565 INFO L280 TraceCheckUtils]: 11: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:54,566 INFO L280 TraceCheckUtils]: 12: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:54,567 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-11 00:52:54,568 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-11 00:52:54,569 INFO L280 TraceCheckUtils]: 15: Hoare triple {234#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:54,569 INFO L280 TraceCheckUtils]: 16: Hoare triple {234#(<= |id_#in~x| 1)} havoc #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:54,570 INFO L280 TraceCheckUtils]: 17: Hoare triple {234#(<= |id_#in~x| 1)} assume true; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:54,571 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {234#(<= |id_#in~x| 1)} {214#(<= 5 main_~input~0)} #35#return; {211#false} is VALID [2020-07-11 00:52:54,572 INFO L280 TraceCheckUtils]: 19: Hoare triple {211#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {211#false} is VALID [2020-07-11 00:52:54,572 INFO L280 TraceCheckUtils]: 20: Hoare triple {211#false} ~result~0 := #t~ret1; {211#false} is VALID [2020-07-11 00:52:54,573 INFO L280 TraceCheckUtils]: 21: Hoare triple {211#false} havoc #t~ret1; {211#false} is VALID [2020-07-11 00:52:54,573 INFO L280 TraceCheckUtils]: 22: Hoare triple {211#false} assume 5 != ~result~0; {211#false} is VALID [2020-07-11 00:52:54,573 INFO L280 TraceCheckUtils]: 23: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-11 00:52:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-11 00:52:54,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2012600248] [2020-07-11 00:52:54,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:52:54,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 00:52:54,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598484099] [2020-07-11 00:52:54,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-11 00:52:54,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:52:54,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:52:54,606 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-11 00:52:54,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:52:54,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:52:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:52:54,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:52:54,608 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-07-11 00:52:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:54,759 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-11 00:52:54,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:52:54,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-11 00:52:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:52:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:52:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-11 00:52:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:52:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-11 00:52:54,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2020-07-11 00:52:54,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:54,812 INFO L225 Difference]: With dead ends: 34 [2020-07-11 00:52:54,812 INFO L226 Difference]: Without dead ends: 28 [2020-07-11 00:52:54,813 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-11 00:52:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-11 00:52:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-11 00:52:54,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:52:54,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-11 00:52:54,847 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 00:52:54,847 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 00:52:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:54,850 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-11 00:52:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-11 00:52:54,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:54,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:54,852 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 00:52:54,852 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 00:52:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:54,855 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-11 00:52:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-11 00:52:54,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:54,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:54,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:52:54,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:52:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 00:52:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-11 00:52:54,860 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-07-11 00:52:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:52:54,860 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-11 00:52:54,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:52:54,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2020-07-11 00:52:54,897 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-11 00:52:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-11 00:52:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-11 00:52:54,899 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:52:54,899 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-11 00:52:54,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:52:54,900 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:52:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:52:54,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-07-11 00:52:54,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:52:54,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1402493914] [2020-07-11 00:52:54,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:52:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:54,962 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-11 00:52:54,962 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {422#true} {422#true} #31#return; {422#true} is VALID [2020-07-11 00:52:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:55,115 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,116 INFO L280 TraceCheckUtils]: 1: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,116 INFO L280 TraceCheckUtils]: 2: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,117 INFO L280 TraceCheckUtils]: 3: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,119 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-11 00:52:55,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,121 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-11 00:52:55,121 INFO L263 TraceCheckUtils]: 2: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-11 00:52:55,122 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,123 INFO L280 TraceCheckUtils]: 4: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,125 INFO L280 TraceCheckUtils]: 5: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,125 INFO L280 TraceCheckUtils]: 6: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,127 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-11 00:52:55,131 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-11 00:52:55,133 INFO L280 TraceCheckUtils]: 9: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,134 INFO L280 TraceCheckUtils]: 10: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,135 INFO L280 TraceCheckUtils]: 11: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,137 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-11 00:52:55,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,146 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-11 00:52:55,146 INFO L263 TraceCheckUtils]: 2: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-11 00:52:55,148 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,149 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-11 00:52:55,149 INFO L263 TraceCheckUtils]: 5: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-11 00:52:55,150 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,151 INFO L280 TraceCheckUtils]: 7: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,152 INFO L280 TraceCheckUtils]: 8: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,153 INFO L280 TraceCheckUtils]: 9: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,154 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-11 00:52:55,155 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-11 00:52:55,156 INFO L280 TraceCheckUtils]: 12: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,158 INFO L280 TraceCheckUtils]: 13: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,159 INFO L280 TraceCheckUtils]: 14: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,161 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-11 00:52:55,166 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-11 00:52:55,166 INFO L280 TraceCheckUtils]: 17: Hoare triple {462#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,168 INFO L280 TraceCheckUtils]: 18: Hoare triple {462#(<= |id_#in~x| 2)} havoc #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,169 INFO L280 TraceCheckUtils]: 19: Hoare triple {462#(<= |id_#in~x| 2)} assume true; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,170 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {462#(<= |id_#in~x| 2)} {426#(<= 5 main_~input~0)} #35#return; {423#false} is VALID [2020-07-11 00:52:55,171 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-11 00:52:55,171 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-11 00:52:55,172 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #31#return; {422#true} is VALID [2020-07-11 00:52:55,172 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret2 := main(); {422#true} is VALID [2020-07-11 00:52:55,173 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} ~input~0 := 5; {426#(<= 5 main_~input~0)} is VALID [2020-07-11 00:52:55,173 INFO L263 TraceCheckUtils]: 5: Hoare triple {426#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {422#true} is VALID [2020-07-11 00:52:55,174 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,175 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-11 00:52:55,175 INFO L263 TraceCheckUtils]: 8: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-11 00:52:55,176 INFO L280 TraceCheckUtils]: 9: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,176 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-11 00:52:55,177 INFO L263 TraceCheckUtils]: 11: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-11 00:52:55,178 INFO L280 TraceCheckUtils]: 12: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,189 INFO L280 TraceCheckUtils]: 13: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,190 INFO L280 TraceCheckUtils]: 14: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,191 INFO L280 TraceCheckUtils]: 15: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,192 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-11 00:52:55,193 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-11 00:52:55,194 INFO L280 TraceCheckUtils]: 18: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,195 INFO L280 TraceCheckUtils]: 19: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,198 INFO L280 TraceCheckUtils]: 20: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,200 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-11 00:52:55,201 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-11 00:52:55,201 INFO L280 TraceCheckUtils]: 23: Hoare triple {462#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,202 INFO L280 TraceCheckUtils]: 24: Hoare triple {462#(<= |id_#in~x| 2)} havoc #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,203 INFO L280 TraceCheckUtils]: 25: Hoare triple {462#(<= |id_#in~x| 2)} assume true; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,204 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {462#(<= |id_#in~x| 2)} {426#(<= 5 main_~input~0)} #35#return; {423#false} is VALID [2020-07-11 00:52:55,205 INFO L280 TraceCheckUtils]: 27: Hoare triple {423#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {423#false} is VALID [2020-07-11 00:52:55,205 INFO L280 TraceCheckUtils]: 28: Hoare triple {423#false} ~result~0 := #t~ret1; {423#false} is VALID [2020-07-11 00:52:55,205 INFO L280 TraceCheckUtils]: 29: Hoare triple {423#false} havoc #t~ret1; {423#false} is VALID [2020-07-11 00:52:55,205 INFO L280 TraceCheckUtils]: 30: Hoare triple {423#false} assume 5 != ~result~0; {423#false} is VALID [2020-07-11 00:52:55,206 INFO L280 TraceCheckUtils]: 31: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-11 00:52:55,208 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-11 00:52:55,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1402493914] [2020-07-11 00:52:55,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:52:55,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 00:52:55,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376057563] [2020-07-11 00:52:55,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-11 00:52:55,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:52:55,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:52:55,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:55,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:52:55,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:52:55,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:52:55,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:52:55,250 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-07-11 00:52:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:55,542 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-11 00:52:55,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 00:52:55,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-11 00:52:55,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:52:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:52:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2020-07-11 00:52:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:52:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2020-07-11 00:52:55,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2020-07-11 00:52:55,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:55,601 INFO L225 Difference]: With dead ends: 39 [2020-07-11 00:52:55,601 INFO L226 Difference]: Without dead ends: 33 [2020-07-11 00:52:55,602 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-11 00:52:55,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-11 00:52:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-11 00:52:55,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:52:55,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-11 00:52:55,643 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-11 00:52:55,643 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-11 00:52:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:55,646 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-11 00:52:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-11 00:52:55,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:55,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:55,648 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-11 00:52:55,648 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-11 00:52:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:55,651 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-11 00:52:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-11 00:52:55,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:55,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:55,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:52:55,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:52:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-11 00:52:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-11 00:52:55,655 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-07-11 00:52:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:52:55,656 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-11 00:52:55,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:52:55,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2020-07-11 00:52:55,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-11 00:52:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-11 00:52:55,699 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:52:55,699 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-11 00:52:55,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:52:55,700 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:52:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:52:55,700 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-07-11 00:52:55,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:52:55,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1533393988] [2020-07-11 00:52:55,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:52:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:55,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} assume true; {688#true} is VALID [2020-07-11 00:52:55,745 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {688#true} {688#true} #31#return; {688#true} is VALID [2020-07-11 00:52:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:55,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,879 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,881 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-11 00:52:55,882 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,883 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-11 00:52:55,883 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:55,884 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,885 INFO L280 TraceCheckUtils]: 4: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,885 INFO L280 TraceCheckUtils]: 5: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,886 INFO L280 TraceCheckUtils]: 6: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,887 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-11 00:52:55,888 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-11 00:52:55,889 INFO L280 TraceCheckUtils]: 9: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,889 INFO L280 TraceCheckUtils]: 10: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,890 INFO L280 TraceCheckUtils]: 11: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,891 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-11 00:52:55,892 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,893 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-11 00:52:55,893 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:55,894 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,895 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-11 00:52:55,895 INFO L263 TraceCheckUtils]: 5: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:55,895 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,902 INFO L280 TraceCheckUtils]: 7: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,903 INFO L280 TraceCheckUtils]: 8: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,904 INFO L280 TraceCheckUtils]: 9: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,905 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-11 00:52:55,905 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-11 00:52:55,906 INFO L280 TraceCheckUtils]: 12: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,906 INFO L280 TraceCheckUtils]: 13: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,907 INFO L280 TraceCheckUtils]: 14: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,908 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-11 00:52:55,908 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-11 00:52:55,909 INFO L280 TraceCheckUtils]: 17: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,909 INFO L280 TraceCheckUtils]: 18: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,911 INFO L280 TraceCheckUtils]: 19: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,914 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-11 00:52:55,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,918 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-11 00:52:55,918 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:55,920 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,922 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-11 00:52:55,922 INFO L263 TraceCheckUtils]: 5: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:55,923 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,924 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-11 00:52:55,924 INFO L263 TraceCheckUtils]: 8: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:55,925 INFO L280 TraceCheckUtils]: 9: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,926 INFO L280 TraceCheckUtils]: 10: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,927 INFO L280 TraceCheckUtils]: 11: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,927 INFO L280 TraceCheckUtils]: 12: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,928 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-11 00:52:55,928 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-11 00:52:55,929 INFO L280 TraceCheckUtils]: 15: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,931 INFO L280 TraceCheckUtils]: 16: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,932 INFO L280 TraceCheckUtils]: 17: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,934 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-11 00:52:55,939 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-11 00:52:55,940 INFO L280 TraceCheckUtils]: 20: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,941 INFO L280 TraceCheckUtils]: 21: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,941 INFO L280 TraceCheckUtils]: 22: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,943 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-11 00:52:55,944 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-11 00:52:55,945 INFO L280 TraceCheckUtils]: 25: Hoare triple {744#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:55,945 INFO L280 TraceCheckUtils]: 26: Hoare triple {744#(<= |id_#in~x| 3)} havoc #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:55,946 INFO L280 TraceCheckUtils]: 27: Hoare triple {744#(<= |id_#in~x| 3)} assume true; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:55,948 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {744#(<= |id_#in~x| 3)} {692#(<= 5 main_~input~0)} #35#return; {689#false} is VALID [2020-07-11 00:52:55,950 INFO L263 TraceCheckUtils]: 0: Hoare triple {688#true} call ULTIMATE.init(); {688#true} is VALID [2020-07-11 00:52:55,950 INFO L280 TraceCheckUtils]: 1: Hoare triple {688#true} assume true; {688#true} is VALID [2020-07-11 00:52:55,951 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {688#true} {688#true} #31#return; {688#true} is VALID [2020-07-11 00:52:55,951 INFO L263 TraceCheckUtils]: 3: Hoare triple {688#true} call #t~ret2 := main(); {688#true} is VALID [2020-07-11 00:52:55,952 INFO L280 TraceCheckUtils]: 4: Hoare triple {688#true} ~input~0 := 5; {692#(<= 5 main_~input~0)} is VALID [2020-07-11 00:52:55,952 INFO L263 TraceCheckUtils]: 5: Hoare triple {692#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {688#true} is VALID [2020-07-11 00:52:55,953 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,953 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-11 00:52:55,953 INFO L263 TraceCheckUtils]: 8: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:55,954 INFO L280 TraceCheckUtils]: 9: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,955 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-11 00:52:55,955 INFO L263 TraceCheckUtils]: 11: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:55,955 INFO L280 TraceCheckUtils]: 12: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,956 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-11 00:52:55,956 INFO L263 TraceCheckUtils]: 14: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:55,957 INFO L280 TraceCheckUtils]: 15: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:55,958 INFO L280 TraceCheckUtils]: 16: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,960 INFO L280 TraceCheckUtils]: 17: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,961 INFO L280 TraceCheckUtils]: 18: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:55,962 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-11 00:52:55,963 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-11 00:52:55,964 INFO L280 TraceCheckUtils]: 21: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,965 INFO L280 TraceCheckUtils]: 22: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,966 INFO L280 TraceCheckUtils]: 23: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:55,968 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-11 00:52:55,969 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-11 00:52:55,969 INFO L280 TraceCheckUtils]: 26: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,970 INFO L280 TraceCheckUtils]: 27: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,970 INFO L280 TraceCheckUtils]: 28: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:55,971 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-11 00:52:55,972 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-11 00:52:55,972 INFO L280 TraceCheckUtils]: 31: Hoare triple {744#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:55,973 INFO L280 TraceCheckUtils]: 32: Hoare triple {744#(<= |id_#in~x| 3)} havoc #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:55,973 INFO L280 TraceCheckUtils]: 33: Hoare triple {744#(<= |id_#in~x| 3)} assume true; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:55,975 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {744#(<= |id_#in~x| 3)} {692#(<= 5 main_~input~0)} #35#return; {689#false} is VALID [2020-07-11 00:52:55,975 INFO L280 TraceCheckUtils]: 35: Hoare triple {689#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {689#false} is VALID [2020-07-11 00:52:55,975 INFO L280 TraceCheckUtils]: 36: Hoare triple {689#false} ~result~0 := #t~ret1; {689#false} is VALID [2020-07-11 00:52:55,975 INFO L280 TraceCheckUtils]: 37: Hoare triple {689#false} havoc #t~ret1; {689#false} is VALID [2020-07-11 00:52:55,976 INFO L280 TraceCheckUtils]: 38: Hoare triple {689#false} assume 5 != ~result~0; {689#false} is VALID [2020-07-11 00:52:55,976 INFO L280 TraceCheckUtils]: 39: Hoare triple {689#false} assume !false; {689#false} is VALID [2020-07-11 00:52:55,978 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-11 00:52:55,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1533393988] [2020-07-11 00:52:55,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:52:55,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 00:52:55,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114657260] [2020-07-11 00:52:55,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-11 00:52:55,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:52:55,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:52:56,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:56,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:52:56,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:52:56,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:52:56,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:52:56,022 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-07-11 00:52:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:56,292 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-11 00:52:56,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 00:52:56,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-11 00:52:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:52:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:52:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2020-07-11 00:52:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:52:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2020-07-11 00:52:56,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2020-07-11 00:52:56,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:56,370 INFO L225 Difference]: With dead ends: 44 [2020-07-11 00:52:56,370 INFO L226 Difference]: Without dead ends: 38 [2020-07-11 00:52:56,371 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-11 00:52:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-11 00:52:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-11 00:52:56,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:52:56,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-11 00:52:56,423 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-11 00:52:56,423 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-11 00:52:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:56,426 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-11 00:52:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-11 00:52:56,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:56,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:56,427 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-11 00:52:56,427 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-11 00:52:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:56,430 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-11 00:52:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-11 00:52:56,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:56,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:56,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:52:56,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:52:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-11 00:52:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-07-11 00:52:56,434 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-07-11 00:52:56,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:52:56,434 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-07-11 00:52:56,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:52:56,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 39 transitions. [2020-07-11 00:52:56,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-11 00:52:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-11 00:52:56,492 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:52:56,492 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-11 00:52:56,493 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:52:56,493 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:52:56,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:52:56,494 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-07-11 00:52:56,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:52:56,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [506535169] [2020-07-11 00:52:56,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:52:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:56,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} assume true; {1016#true} is VALID [2020-07-11 00:52:56,531 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1016#true} {1016#true} #31#return; {1016#true} is VALID [2020-07-11 00:52:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:56,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,680 INFO L280 TraceCheckUtils]: 3: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,682 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-11 00:52:56,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,684 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-11 00:52:56,685 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:56,685 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,686 INFO L280 TraceCheckUtils]: 5: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,686 INFO L280 TraceCheckUtils]: 6: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,687 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-11 00:52:56,688 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-11 00:52:56,688 INFO L280 TraceCheckUtils]: 9: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,689 INFO L280 TraceCheckUtils]: 10: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,689 INFO L280 TraceCheckUtils]: 11: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,691 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-11 00:52:56,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,699 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-11 00:52:56,699 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:56,700 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,701 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-11 00:52:56,701 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:56,702 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,702 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,703 INFO L280 TraceCheckUtils]: 8: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,704 INFO L280 TraceCheckUtils]: 9: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,705 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-11 00:52:56,706 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-11 00:52:56,707 INFO L280 TraceCheckUtils]: 12: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,707 INFO L280 TraceCheckUtils]: 13: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,708 INFO L280 TraceCheckUtils]: 14: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,709 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-11 00:52:56,710 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-11 00:52:56,710 INFO L280 TraceCheckUtils]: 17: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:56,711 INFO L280 TraceCheckUtils]: 18: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:56,711 INFO L280 TraceCheckUtils]: 19: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:56,713 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-11 00:52:56,714 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,715 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-11 00:52:56,715 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:56,715 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,716 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-11 00:52:56,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-11 00:52:56,717 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,718 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-11 00:52:56,718 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:56,718 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,719 INFO L280 TraceCheckUtils]: 10: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,720 INFO L280 TraceCheckUtils]: 11: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,720 INFO L280 TraceCheckUtils]: 12: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,721 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-11 00:52:56,722 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-11 00:52:56,724 INFO L280 TraceCheckUtils]: 15: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,724 INFO L280 TraceCheckUtils]: 16: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,725 INFO L280 TraceCheckUtils]: 17: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,726 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-11 00:52:56,727 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-11 00:52:56,727 INFO L280 TraceCheckUtils]: 20: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:56,728 INFO L280 TraceCheckUtils]: 21: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:56,729 INFO L280 TraceCheckUtils]: 22: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:56,730 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-11 00:52:56,730 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-11 00:52:56,731 INFO L280 TraceCheckUtils]: 25: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:56,731 INFO L280 TraceCheckUtils]: 26: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:56,731 INFO L280 TraceCheckUtils]: 27: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:56,732 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-11 00:52:56,735 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,738 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-11 00:52:56,739 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:56,739 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,740 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-11 00:52:56,740 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:56,740 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,747 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-11 00:52:56,748 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:56,748 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,749 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-11 00:52:56,750 INFO L263 TraceCheckUtils]: 11: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:56,752 INFO L280 TraceCheckUtils]: 12: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,753 INFO L280 TraceCheckUtils]: 13: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,753 INFO L280 TraceCheckUtils]: 14: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,753 INFO L280 TraceCheckUtils]: 15: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,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-11 00:52:56,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-11 00:52:56,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-11 00:52:56,756 INFO L280 TraceCheckUtils]: 19: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,756 INFO L280 TraceCheckUtils]: 20: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,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-11 00:52:56,759 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-11 00:52:56,760 INFO L280 TraceCheckUtils]: 23: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:56,760 INFO L280 TraceCheckUtils]: 24: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:56,762 INFO L280 TraceCheckUtils]: 25: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:56,765 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-11 00:52:56,766 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-11 00:52:56,767 INFO L280 TraceCheckUtils]: 28: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:56,768 INFO L280 TraceCheckUtils]: 29: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:56,768 INFO L280 TraceCheckUtils]: 30: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:56,769 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-11 00:52:56,770 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-11 00:52:56,770 INFO L280 TraceCheckUtils]: 33: Hoare triple {1088#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:56,771 INFO L280 TraceCheckUtils]: 34: Hoare triple {1088#(<= |id_#in~x| 4)} havoc #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:56,771 INFO L280 TraceCheckUtils]: 35: Hoare triple {1088#(<= |id_#in~x| 4)} assume true; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:56,779 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1088#(<= |id_#in~x| 4)} {1020#(<= 5 main_~input~0)} #35#return; {1017#false} is VALID [2020-07-11 00:52:56,780 INFO L263 TraceCheckUtils]: 0: Hoare triple {1016#true} call ULTIMATE.init(); {1016#true} is VALID [2020-07-11 00:52:56,781 INFO L280 TraceCheckUtils]: 1: Hoare triple {1016#true} assume true; {1016#true} is VALID [2020-07-11 00:52:56,781 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1016#true} {1016#true} #31#return; {1016#true} is VALID [2020-07-11 00:52:56,781 INFO L263 TraceCheckUtils]: 3: Hoare triple {1016#true} call #t~ret2 := main(); {1016#true} is VALID [2020-07-11 00:52:56,782 INFO L280 TraceCheckUtils]: 4: Hoare triple {1016#true} ~input~0 := 5; {1020#(<= 5 main_~input~0)} is VALID [2020-07-11 00:52:56,782 INFO L263 TraceCheckUtils]: 5: Hoare triple {1020#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {1016#true} is VALID [2020-07-11 00:52:56,783 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,783 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-11 00:52:56,784 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:56,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,785 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-11 00:52:56,785 INFO L263 TraceCheckUtils]: 11: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:56,785 INFO L280 TraceCheckUtils]: 12: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,786 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-11 00:52:56,786 INFO L263 TraceCheckUtils]: 14: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:56,787 INFO L280 TraceCheckUtils]: 15: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,787 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-11 00:52:56,787 INFO L263 TraceCheckUtils]: 17: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:56,788 INFO L280 TraceCheckUtils]: 18: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:56,789 INFO L280 TraceCheckUtils]: 19: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,796 INFO L280 TraceCheckUtils]: 20: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,796 INFO L280 TraceCheckUtils]: 21: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:56,797 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-11 00:52:56,798 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-11 00:52:56,798 INFO L280 TraceCheckUtils]: 24: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,799 INFO L280 TraceCheckUtils]: 25: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,799 INFO L280 TraceCheckUtils]: 26: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:56,801 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-11 00:52:56,802 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-11 00:52:56,803 INFO L280 TraceCheckUtils]: 29: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:56,803 INFO L280 TraceCheckUtils]: 30: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:56,804 INFO L280 TraceCheckUtils]: 31: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:56,806 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-11 00:52:56,807 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-11 00:52:56,807 INFO L280 TraceCheckUtils]: 34: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:56,807 INFO L280 TraceCheckUtils]: 35: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:56,808 INFO L280 TraceCheckUtils]: 36: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:56,809 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-11 00:52:56,809 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-11 00:52:56,809 INFO L280 TraceCheckUtils]: 39: Hoare triple {1088#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:56,810 INFO L280 TraceCheckUtils]: 40: Hoare triple {1088#(<= |id_#in~x| 4)} havoc #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:56,810 INFO L280 TraceCheckUtils]: 41: Hoare triple {1088#(<= |id_#in~x| 4)} assume true; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:56,811 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1088#(<= |id_#in~x| 4)} {1020#(<= 5 main_~input~0)} #35#return; {1017#false} is VALID [2020-07-11 00:52:56,811 INFO L280 TraceCheckUtils]: 43: Hoare triple {1017#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1017#false} is VALID [2020-07-11 00:52:56,811 INFO L280 TraceCheckUtils]: 44: Hoare triple {1017#false} ~result~0 := #t~ret1; {1017#false} is VALID [2020-07-11 00:52:56,812 INFO L280 TraceCheckUtils]: 45: Hoare triple {1017#false} havoc #t~ret1; {1017#false} is VALID [2020-07-11 00:52:56,812 INFO L280 TraceCheckUtils]: 46: Hoare triple {1017#false} assume 5 != ~result~0; {1017#false} is VALID [2020-07-11 00:52:56,812 INFO L280 TraceCheckUtils]: 47: Hoare triple {1017#false} assume !false; {1017#false} is VALID [2020-07-11 00:52:56,814 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-11 00:52:56,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [506535169] [2020-07-11 00:52:56,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:52:56,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-11 00:52:56,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951376332] [2020-07-11 00:52:56,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-11 00:52:56,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:52:56,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 00:52:56,871 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-11 00:52:56,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 00:52:56,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:52:56,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 00:52:56,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-11 00:52:56,873 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-07-11 00:52:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:57,142 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-07-11 00:52:57,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 00:52:57,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-11 00:52:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:52:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 00:52:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-11 00:52:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 00:52:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-11 00:52:57,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2020-07-11 00:52:57,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:57,210 INFO L225 Difference]: With dead ends: 49 [2020-07-11 00:52:57,210 INFO L226 Difference]: Without dead ends: 43 [2020-07-11 00:52:57,211 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-11 00:52:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-11 00:52:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-11 00:52:57,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:52:57,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-11 00:52:57,264 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-11 00:52:57,264 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-11 00:52:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:57,267 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-11 00:52:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-11 00:52:57,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:57,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:57,268 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-11 00:52:57,268 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-11 00:52:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:57,271 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-11 00:52:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-11 00:52:57,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:57,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:57,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:52:57,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:52:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-11 00:52:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-07-11 00:52:57,275 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-07-11 00:52:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:52:57,275 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-07-11 00:52:57,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 00:52:57,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 44 transitions. [2020-07-11 00:52:57,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-11 00:52:57,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-11 00:52:57,349 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:52:57,349 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-11 00:52:57,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:52:57,350 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:52:57,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:52:57,350 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-07-11 00:52:57,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:52:57,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1535997046] [2020-07-11 00:52:57,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:52:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:57,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} assume true; {1414#true} is VALID [2020-07-11 00:52:57,452 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1414#true} {1414#true} #31#return; {1414#true} is VALID [2020-07-11 00:52:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:57,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,781 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-11 00:52:57,782 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,783 INFO L280 TraceCheckUtils]: 3: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,784 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:52:57,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,786 INFO L263 TraceCheckUtils]: 2: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,786 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,786 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-11 00:52:57,787 INFO L280 TraceCheckUtils]: 5: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,788 INFO L280 TraceCheckUtils]: 6: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,790 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:52:57,791 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-11 00:52:57,792 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-11 00:52:57,793 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-11 00:52:57,794 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-11 00:52:57,795 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-11 00:52:57,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,798 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,798 INFO L263 TraceCheckUtils]: 2: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,799 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,799 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,800 INFO L263 TraceCheckUtils]: 5: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,800 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,801 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-11 00:52:57,802 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,803 INFO L280 TraceCheckUtils]: 9: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,805 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:52:57,805 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-11 00:52:57,807 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-11 00:52:57,807 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-11 00:52:57,808 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-11 00:52:57,809 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-11 00:52:57,810 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-11 00:52:57,811 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-11 00:52:57,812 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-11 00:52:57,812 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-11 00:52:57,814 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-11 00:52:57,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,816 INFO L263 TraceCheckUtils]: 2: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,816 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,817 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,817 INFO L263 TraceCheckUtils]: 5: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,817 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,818 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,818 INFO L263 TraceCheckUtils]: 8: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,818 INFO L280 TraceCheckUtils]: 9: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,818 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-11 00:52:57,820 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,821 INFO L280 TraceCheckUtils]: 12: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,822 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:52:57,823 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-11 00:52:57,824 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-11 00:52:57,825 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-11 00:52:57,826 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-11 00:52:57,827 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-11 00:52:57,828 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-11 00:52:57,829 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-11 00:52:57,830 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-11 00:52:57,831 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-11 00:52:57,833 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-11 00:52:57,834 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-11 00:52:57,835 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-11 00:52:57,836 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-11 00:52:57,837 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-11 00:52:57,838 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-11 00:52:57,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,841 INFO L263 TraceCheckUtils]: 2: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,841 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,842 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,842 INFO L263 TraceCheckUtils]: 5: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,842 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,843 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,843 INFO L263 TraceCheckUtils]: 8: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,843 INFO L280 TraceCheckUtils]: 9: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,844 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,844 INFO L263 TraceCheckUtils]: 11: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,844 INFO L280 TraceCheckUtils]: 12: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,845 INFO L280 TraceCheckUtils]: 13: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-11 00:52:57,846 INFO L280 TraceCheckUtils]: 14: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,846 INFO L280 TraceCheckUtils]: 15: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,848 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:52:57,848 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-11 00:52:57,849 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-11 00:52:57,850 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-11 00:52:57,851 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-11 00:52:57,853 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-11 00:52:57,854 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-11 00:52:57,855 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-11 00:52:57,856 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-11 00:52:57,857 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-11 00:52:57,859 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-11 00:52:57,861 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-11 00:52:57,862 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-11 00:52:57,862 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-11 00:52:57,863 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-11 00:52:57,864 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-11 00:52:57,865 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-11 00:52:57,866 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-11 00:52:57,867 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-11 00:52:57,868 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-11 00:52:57,869 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-11 00:52:57,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,879 INFO L263 TraceCheckUtils]: 2: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,879 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,880 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,880 INFO L263 TraceCheckUtils]: 5: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,880 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,881 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,881 INFO L263 TraceCheckUtils]: 8: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,881 INFO L280 TraceCheckUtils]: 9: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,881 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,882 INFO L263 TraceCheckUtils]: 11: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,882 INFO L280 TraceCheckUtils]: 12: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,885 INFO L280 TraceCheckUtils]: 13: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,886 INFO L263 TraceCheckUtils]: 14: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,886 INFO L280 TraceCheckUtils]: 15: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,886 INFO L280 TraceCheckUtils]: 16: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-11 00:52:57,898 INFO L280 TraceCheckUtils]: 17: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,903 INFO L280 TraceCheckUtils]: 18: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,904 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:52:57,905 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-11 00:52:57,906 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-11 00:52:57,907 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-11 00:52:57,907 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-11 00:52:57,908 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-11 00:52:57,909 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-11 00:52:57,910 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-11 00:52:57,910 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-11 00:52:57,911 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-11 00:52:57,912 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-11 00:52:57,912 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-11 00:52:57,913 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-11 00:52:57,914 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-11 00:52:57,915 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-11 00:52:57,916 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-11 00:52:57,917 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-11 00:52:57,917 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-11 00:52:57,918 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-11 00:52:57,919 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-11 00:52:57,920 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-11 00:52:57,920 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-11 00:52:57,921 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-11 00:52:57,922 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-11 00:52:57,922 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-11 00:52:57,924 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-11 00:52:57,929 INFO L263 TraceCheckUtils]: 0: Hoare triple {1414#true} call ULTIMATE.init(); {1414#true} is VALID [2020-07-11 00:52:57,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} assume true; {1414#true} is VALID [2020-07-11 00:52:57,930 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1414#true} {1414#true} #31#return; {1414#true} is VALID [2020-07-11 00:52:57,930 INFO L263 TraceCheckUtils]: 3: Hoare triple {1414#true} call #t~ret2 := main(); {1414#true} is VALID [2020-07-11 00:52:57,930 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} ~input~0 := 5; {1414#true} is VALID [2020-07-11 00:52:57,930 INFO L263 TraceCheckUtils]: 5: Hoare triple {1414#true} call #t~ret1 := id(~input~0); {1414#true} is VALID [2020-07-11 00:52:57,931 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,931 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,931 INFO L263 TraceCheckUtils]: 8: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,932 INFO L280 TraceCheckUtils]: 9: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,932 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,932 INFO L263 TraceCheckUtils]: 11: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,932 INFO L280 TraceCheckUtils]: 12: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,933 INFO L280 TraceCheckUtils]: 13: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,933 INFO L263 TraceCheckUtils]: 14: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,933 INFO L280 TraceCheckUtils]: 15: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,933 INFO L280 TraceCheckUtils]: 16: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,934 INFO L263 TraceCheckUtils]: 17: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,934 INFO L280 TraceCheckUtils]: 18: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,934 INFO L280 TraceCheckUtils]: 19: Hoare triple {1414#true} assume !(0 == ~x); {1414#true} is VALID [2020-07-11 00:52:57,935 INFO L263 TraceCheckUtils]: 20: Hoare triple {1414#true} call #t~ret0 := id(~x - 1); {1414#true} is VALID [2020-07-11 00:52:57,935 INFO L280 TraceCheckUtils]: 21: Hoare triple {1414#true} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:52:57,935 INFO L280 TraceCheckUtils]: 22: Hoare triple {1414#true} assume 0 == ~x; {1414#true} is VALID [2020-07-11 00:52:57,938 INFO L280 TraceCheckUtils]: 23: Hoare triple {1414#true} #res := 0; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,939 INFO L280 TraceCheckUtils]: 24: Hoare triple {1580#(= 0 |id_#res|)} assume true; {1580#(= 0 |id_#res|)} is VALID [2020-07-11 00:52:57,940 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1580#(= 0 |id_#res|)} {1414#true} #37#return; {1578#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:52:57,941 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-11 00:52:57,942 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-11 00:52:57,943 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-11 00:52:57,944 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-11 00:52:57,945 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-11 00:52:57,946 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-11 00:52:57,948 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-11 00:52:57,949 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-11 00:52:57,950 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-11 00:52:57,951 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-11 00:52:57,952 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-11 00:52:57,953 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-11 00:52:57,954 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-11 00:52:57,955 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-11 00:52:57,959 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-11 00:52:57,960 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-11 00:52:57,961 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-11 00:52:57,962 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-11 00:52:57,963 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-11 00:52:57,965 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-11 00:52:57,966 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-11 00:52:57,967 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-11 00:52:57,968 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-11 00:52:57,968 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-11 00:52:57,969 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-11 00:52:57,970 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-11 00:52:57,971 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-11 00:52:57,972 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-11 00:52:57,972 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-11 00:52:57,973 INFO L280 TraceCheckUtils]: 55: Hoare triple {1415#false} assume !false; {1415#false} is VALID [2020-07-11 00:52:57,982 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-11 00:52:57,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1535997046] [2020-07-11 00:52:57,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:52:57,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-11 00:52:57,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483446489] [2020-07-11 00:52:57,987 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-07-11 00:52:57,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:52:57,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 00:52:58,054 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-11 00:52:58,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 00:52:58,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:52:58,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 00:52:58,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-11 00:52:58,055 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 15 states. [2020-07-11 00:52:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:59,003 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-11 00:52:59,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-11 00:52:59,003 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-07-11 00:52:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:52:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:52:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 55 transitions. [2020-07-11 00:52:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:52:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 55 transitions. [2020-07-11 00:52:59,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 55 transitions. [2020-07-11 00:52:59,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:59,078 INFO L225 Difference]: With dead ends: 54 [2020-07-11 00:52:59,079 INFO L226 Difference]: Without dead ends: 48 [2020-07-11 00:52:59,079 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-11 00:52:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-11 00:52:59,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-11 00:52:59,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:52:59,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2020-07-11 00:52:59,166 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-11 00:52:59,166 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-11 00:52:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:59,169 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2020-07-11 00:52:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-11 00:52:59,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:59,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:59,170 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-11 00:52:59,170 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-11 00:52:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:59,172 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2020-07-11 00:52:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-11 00:52:59,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:59,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:59,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:52:59,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:52:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-11 00:52:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-07-11 00:52:59,176 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-07-11 00:52:59,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:52:59,176 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-07-11 00:52:59,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 00:52:59,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 49 transitions. [2020-07-11 00:52:59,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-11 00:52:59,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-11 00:52:59,232 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:52:59,232 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-11 00:52:59,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 00:52:59,233 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:52:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:52:59,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-07-11 00:52:59,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:52:59,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1865180293] [2020-07-11 00:52:59,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:52:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:59,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} assume true; {1895#true} is VALID [2020-07-11 00:52:59,271 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1895#true} {1895#true} #31#return; {1895#true} is VALID [2020-07-11 00:52:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:59,445 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,446 INFO L280 TraceCheckUtils]: 2: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,447 INFO L280 TraceCheckUtils]: 3: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,448 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-11 00:52:59,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,449 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-11 00:52:59,449 INFO L263 TraceCheckUtils]: 2: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,450 INFO L280 TraceCheckUtils]: 3: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,450 INFO L280 TraceCheckUtils]: 4: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,451 INFO L280 TraceCheckUtils]: 5: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,451 INFO L280 TraceCheckUtils]: 6: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,452 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-11 00:52:59,453 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-11 00:52:59,453 INFO L280 TraceCheckUtils]: 9: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,454 INFO L280 TraceCheckUtils]: 10: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,454 INFO L280 TraceCheckUtils]: 11: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,456 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-11 00:52:59,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,457 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-11 00:52:59,457 INFO L263 TraceCheckUtils]: 2: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,458 INFO L280 TraceCheckUtils]: 3: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,458 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-11 00:52:59,459 INFO L263 TraceCheckUtils]: 5: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,459 INFO L280 TraceCheckUtils]: 6: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,460 INFO L280 TraceCheckUtils]: 7: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,461 INFO L280 TraceCheckUtils]: 9: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,462 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-11 00:52:59,462 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-11 00:52:59,463 INFO L280 TraceCheckUtils]: 12: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,463 INFO L280 TraceCheckUtils]: 13: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,464 INFO L280 TraceCheckUtils]: 14: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,465 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-11 00:52:59,466 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-11 00:52:59,466 INFO L280 TraceCheckUtils]: 17: Hoare triple {2103#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,467 INFO L280 TraceCheckUtils]: 18: Hoare triple {2103#(<= 2 |id_#in~x|)} havoc #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,467 INFO L280 TraceCheckUtils]: 19: Hoare triple {2103#(<= 2 |id_#in~x|)} assume true; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,468 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-11 00:52:59,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,470 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-11 00:52:59,470 INFO L263 TraceCheckUtils]: 2: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,471 INFO L280 TraceCheckUtils]: 3: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,471 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-11 00:52:59,472 INFO L263 TraceCheckUtils]: 5: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,472 INFO L280 TraceCheckUtils]: 6: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,473 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-11 00:52:59,473 INFO L263 TraceCheckUtils]: 8: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,473 INFO L280 TraceCheckUtils]: 9: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,474 INFO L280 TraceCheckUtils]: 10: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,475 INFO L280 TraceCheckUtils]: 11: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,475 INFO L280 TraceCheckUtils]: 12: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,476 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-11 00:52:59,477 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-11 00:52:59,477 INFO L280 TraceCheckUtils]: 15: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,478 INFO L280 TraceCheckUtils]: 16: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,478 INFO L280 TraceCheckUtils]: 17: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,480 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-11 00:52:59,480 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-11 00:52:59,481 INFO L280 TraceCheckUtils]: 20: Hoare triple {2103#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,481 INFO L280 TraceCheckUtils]: 21: Hoare triple {2103#(<= 2 |id_#in~x|)} havoc #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,482 INFO L280 TraceCheckUtils]: 22: Hoare triple {2103#(<= 2 |id_#in~x|)} assume true; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,483 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-11 00:52:59,483 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-11 00:52:59,484 INFO L280 TraceCheckUtils]: 25: Hoare triple {2089#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,485 INFO L280 TraceCheckUtils]: 26: Hoare triple {2089#(<= 3 |id_#in~x|)} havoc #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,485 INFO L280 TraceCheckUtils]: 27: Hoare triple {2089#(<= 3 |id_#in~x|)} assume true; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,486 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-11 00:52:59,488 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,488 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-11 00:52:59,488 INFO L263 TraceCheckUtils]: 2: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,489 INFO L280 TraceCheckUtils]: 3: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,490 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-11 00:52:59,490 INFO L263 TraceCheckUtils]: 5: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,490 INFO L280 TraceCheckUtils]: 6: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,491 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-11 00:52:59,491 INFO L263 TraceCheckUtils]: 8: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,492 INFO L280 TraceCheckUtils]: 9: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,492 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-11 00:52:59,492 INFO L263 TraceCheckUtils]: 11: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,493 INFO L280 TraceCheckUtils]: 12: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,493 INFO L280 TraceCheckUtils]: 13: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,494 INFO L280 TraceCheckUtils]: 14: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,494 INFO L280 TraceCheckUtils]: 15: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,495 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-11 00:52:59,496 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-11 00:52:59,496 INFO L280 TraceCheckUtils]: 18: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,497 INFO L280 TraceCheckUtils]: 19: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,497 INFO L280 TraceCheckUtils]: 20: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,499 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-11 00:52:59,499 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-11 00:52:59,500 INFO L280 TraceCheckUtils]: 23: Hoare triple {2103#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,500 INFO L280 TraceCheckUtils]: 24: Hoare triple {2103#(<= 2 |id_#in~x|)} havoc #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,501 INFO L280 TraceCheckUtils]: 25: Hoare triple {2103#(<= 2 |id_#in~x|)} assume true; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,502 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-11 00:52:59,502 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-11 00:52:59,503 INFO L280 TraceCheckUtils]: 28: Hoare triple {2089#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,504 INFO L280 TraceCheckUtils]: 29: Hoare triple {2089#(<= 3 |id_#in~x|)} havoc #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,504 INFO L280 TraceCheckUtils]: 30: Hoare triple {2089#(<= 3 |id_#in~x|)} assume true; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,505 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-11 00:52:59,506 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-11 00:52:59,506 INFO L280 TraceCheckUtils]: 33: Hoare triple {2067#(<= 4 |id_#in~x|)} #res := 1 + #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:52:59,507 INFO L280 TraceCheckUtils]: 34: Hoare triple {2067#(<= 4 |id_#in~x|)} havoc #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:52:59,507 INFO L280 TraceCheckUtils]: 35: Hoare triple {2067#(<= 4 |id_#in~x|)} assume true; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:52:59,508 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-11 00:52:59,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,511 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-11 00:52:59,511 INFO L263 TraceCheckUtils]: 2: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,512 INFO L280 TraceCheckUtils]: 3: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,512 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-11 00:52:59,512 INFO L263 TraceCheckUtils]: 5: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,513 INFO L280 TraceCheckUtils]: 6: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,513 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-11 00:52:59,514 INFO L263 TraceCheckUtils]: 8: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,514 INFO L280 TraceCheckUtils]: 9: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,515 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-11 00:52:59,515 INFO L263 TraceCheckUtils]: 11: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,515 INFO L280 TraceCheckUtils]: 12: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,516 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-11 00:52:59,516 INFO L263 TraceCheckUtils]: 14: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,517 INFO L280 TraceCheckUtils]: 15: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,517 INFO L280 TraceCheckUtils]: 16: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,518 INFO L280 TraceCheckUtils]: 17: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,518 INFO L280 TraceCheckUtils]: 18: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,519 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-11 00:52:59,520 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-11 00:52:59,520 INFO L280 TraceCheckUtils]: 21: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,521 INFO L280 TraceCheckUtils]: 22: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,521 INFO L280 TraceCheckUtils]: 23: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,522 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-11 00:52:59,523 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-11 00:52:59,524 INFO L280 TraceCheckUtils]: 26: Hoare triple {2103#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,524 INFO L280 TraceCheckUtils]: 27: Hoare triple {2103#(<= 2 |id_#in~x|)} havoc #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,525 INFO L280 TraceCheckUtils]: 28: Hoare triple {2103#(<= 2 |id_#in~x|)} assume true; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,526 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-11 00:52:59,526 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-11 00:52:59,527 INFO L280 TraceCheckUtils]: 31: Hoare triple {2089#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,527 INFO L280 TraceCheckUtils]: 32: Hoare triple {2089#(<= 3 |id_#in~x|)} havoc #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,528 INFO L280 TraceCheckUtils]: 33: Hoare triple {2089#(<= 3 |id_#in~x|)} assume true; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,529 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-11 00:52:59,529 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-11 00:52:59,530 INFO L280 TraceCheckUtils]: 36: Hoare triple {2067#(<= 4 |id_#in~x|)} #res := 1 + #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:52:59,530 INFO L280 TraceCheckUtils]: 37: Hoare triple {2067#(<= 4 |id_#in~x|)} havoc #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:52:59,531 INFO L280 TraceCheckUtils]: 38: Hoare triple {2067#(<= 4 |id_#in~x|)} assume true; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:52:59,532 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-11 00:52:59,532 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-11 00:52:59,533 INFO L280 TraceCheckUtils]: 41: Hoare triple {2037#(<= 5 |id_#in~x|)} #res := 1 + #t~ret0; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:52:59,533 INFO L280 TraceCheckUtils]: 42: Hoare triple {2037#(<= 5 |id_#in~x|)} havoc #t~ret0; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:52:59,534 INFO L280 TraceCheckUtils]: 43: Hoare triple {2037#(<= 5 |id_#in~x|)} assume true; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:52:59,535 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-11 00:52:59,538 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,538 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-11 00:52:59,538 INFO L263 TraceCheckUtils]: 2: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,539 INFO L280 TraceCheckUtils]: 3: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,539 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-11 00:52:59,540 INFO L263 TraceCheckUtils]: 5: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,540 INFO L280 TraceCheckUtils]: 6: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,541 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-11 00:52:59,541 INFO L263 TraceCheckUtils]: 8: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,541 INFO L280 TraceCheckUtils]: 9: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,542 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-11 00:52:59,542 INFO L263 TraceCheckUtils]: 11: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,543 INFO L280 TraceCheckUtils]: 12: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,543 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-11 00:52:59,543 INFO L263 TraceCheckUtils]: 14: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,544 INFO L280 TraceCheckUtils]: 15: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,544 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-11 00:52:59,544 INFO L263 TraceCheckUtils]: 17: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,545 INFO L280 TraceCheckUtils]: 18: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,545 INFO L280 TraceCheckUtils]: 19: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,546 INFO L280 TraceCheckUtils]: 20: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,547 INFO L280 TraceCheckUtils]: 21: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,548 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-11 00:52:59,548 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-11 00:52:59,549 INFO L280 TraceCheckUtils]: 24: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,549 INFO L280 TraceCheckUtils]: 25: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,550 INFO L280 TraceCheckUtils]: 26: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,551 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-11 00:52:59,551 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-11 00:52:59,552 INFO L280 TraceCheckUtils]: 29: Hoare triple {2103#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,552 INFO L280 TraceCheckUtils]: 30: Hoare triple {2103#(<= 2 |id_#in~x|)} havoc #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,553 INFO L280 TraceCheckUtils]: 31: Hoare triple {2103#(<= 2 |id_#in~x|)} assume true; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,554 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-11 00:52:59,554 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-11 00:52:59,555 INFO L280 TraceCheckUtils]: 34: Hoare triple {2089#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,555 INFO L280 TraceCheckUtils]: 35: Hoare triple {2089#(<= 3 |id_#in~x|)} havoc #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,556 INFO L280 TraceCheckUtils]: 36: Hoare triple {2089#(<= 3 |id_#in~x|)} assume true; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,557 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-11 00:52:59,558 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-11 00:52:59,558 INFO L280 TraceCheckUtils]: 39: Hoare triple {2067#(<= 4 |id_#in~x|)} #res := 1 + #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:52:59,559 INFO L280 TraceCheckUtils]: 40: Hoare triple {2067#(<= 4 |id_#in~x|)} havoc #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:52:59,559 INFO L280 TraceCheckUtils]: 41: Hoare triple {2067#(<= 4 |id_#in~x|)} assume true; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:52:59,560 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-11 00:52:59,561 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-11 00:52:59,561 INFO L280 TraceCheckUtils]: 44: Hoare triple {2037#(<= 5 |id_#in~x|)} #res := 1 + #t~ret0; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:52:59,562 INFO L280 TraceCheckUtils]: 45: Hoare triple {2037#(<= 5 |id_#in~x|)} havoc #t~ret0; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:52:59,562 INFO L280 TraceCheckUtils]: 46: Hoare triple {2037#(<= 5 |id_#in~x|)} assume true; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:52:59,563 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-11 00:52:59,564 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-11 00:52:59,564 INFO L280 TraceCheckUtils]: 49: Hoare triple {1999#(<= 6 |id_#in~x|)} #res := 1 + #t~ret0; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:52:59,565 INFO L280 TraceCheckUtils]: 50: Hoare triple {1999#(<= 6 |id_#in~x|)} havoc #t~ret0; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:52:59,565 INFO L280 TraceCheckUtils]: 51: Hoare triple {1999#(<= 6 |id_#in~x|)} assume true; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:52:59,566 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-11 00:52:59,569 INFO L263 TraceCheckUtils]: 0: Hoare triple {1895#true} call ULTIMATE.init(); {1895#true} is VALID [2020-07-11 00:52:59,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {1895#true} assume true; {1895#true} is VALID [2020-07-11 00:52:59,570 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1895#true} {1895#true} #31#return; {1895#true} is VALID [2020-07-11 00:52:59,570 INFO L263 TraceCheckUtils]: 3: Hoare triple {1895#true} call #t~ret2 := main(); {1895#true} is VALID [2020-07-11 00:52:59,570 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-11 00:52:59,571 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-11 00:52:59,571 INFO L280 TraceCheckUtils]: 6: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,572 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-11 00:52:59,572 INFO L263 TraceCheckUtils]: 8: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,572 INFO L280 TraceCheckUtils]: 9: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,573 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-11 00:52:59,573 INFO L263 TraceCheckUtils]: 11: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,574 INFO L280 TraceCheckUtils]: 12: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,574 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-11 00:52:59,574 INFO L263 TraceCheckUtils]: 14: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,575 INFO L280 TraceCheckUtils]: 15: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,575 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-11 00:52:59,576 INFO L263 TraceCheckUtils]: 17: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,576 INFO L280 TraceCheckUtils]: 18: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,577 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-11 00:52:59,577 INFO L263 TraceCheckUtils]: 20: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,577 INFO L280 TraceCheckUtils]: 21: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,578 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-11 00:52:59,578 INFO L263 TraceCheckUtils]: 23: Hoare triple {1953#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1895#true} is VALID [2020-07-11 00:52:59,579 INFO L280 TraceCheckUtils]: 24: Hoare triple {1895#true} ~x := #in~x; {1953#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:59,579 INFO L280 TraceCheckUtils]: 25: Hoare triple {1953#(= |id_#in~x| id_~x)} assume 0 == ~x; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,580 INFO L280 TraceCheckUtils]: 26: Hoare triple {2110#(= 0 |id_#in~x|)} #res := 0; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,580 INFO L280 TraceCheckUtils]: 27: Hoare triple {2110#(= 0 |id_#in~x|)} assume true; {2110#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:59,581 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-11 00:52:59,582 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-11 00:52:59,582 INFO L280 TraceCheckUtils]: 30: Hoare triple {2109#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,583 INFO L280 TraceCheckUtils]: 31: Hoare triple {2109#(<= 1 |id_#in~x|)} havoc #t~ret0; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,583 INFO L280 TraceCheckUtils]: 32: Hoare triple {2109#(<= 1 |id_#in~x|)} assume true; {2109#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:52:59,585 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-11 00:52:59,585 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-11 00:52:59,586 INFO L280 TraceCheckUtils]: 35: Hoare triple {2103#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,586 INFO L280 TraceCheckUtils]: 36: Hoare triple {2103#(<= 2 |id_#in~x|)} havoc #t~ret0; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,587 INFO L280 TraceCheckUtils]: 37: Hoare triple {2103#(<= 2 |id_#in~x|)} assume true; {2103#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:52:59,588 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-11 00:52:59,588 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-11 00:52:59,589 INFO L280 TraceCheckUtils]: 40: Hoare triple {2089#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,589 INFO L280 TraceCheckUtils]: 41: Hoare triple {2089#(<= 3 |id_#in~x|)} havoc #t~ret0; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,590 INFO L280 TraceCheckUtils]: 42: Hoare triple {2089#(<= 3 |id_#in~x|)} assume true; {2089#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:52:59,591 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-11 00:52:59,592 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-11 00:52:59,592 INFO L280 TraceCheckUtils]: 45: Hoare triple {2067#(<= 4 |id_#in~x|)} #res := 1 + #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:52:59,593 INFO L280 TraceCheckUtils]: 46: Hoare triple {2067#(<= 4 |id_#in~x|)} havoc #t~ret0; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:52:59,593 INFO L280 TraceCheckUtils]: 47: Hoare triple {2067#(<= 4 |id_#in~x|)} assume true; {2067#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:52:59,594 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-11 00:52:59,595 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-11 00:52:59,595 INFO L280 TraceCheckUtils]: 50: Hoare triple {2037#(<= 5 |id_#in~x|)} #res := 1 + #t~ret0; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:52:59,595 INFO L280 TraceCheckUtils]: 51: Hoare triple {2037#(<= 5 |id_#in~x|)} havoc #t~ret0; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:52:59,596 INFO L280 TraceCheckUtils]: 52: Hoare triple {2037#(<= 5 |id_#in~x|)} assume true; {2037#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:52:59,596 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-11 00:52:59,597 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-11 00:52:59,597 INFO L280 TraceCheckUtils]: 55: Hoare triple {1999#(<= 6 |id_#in~x|)} #res := 1 + #t~ret0; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:52:59,597 INFO L280 TraceCheckUtils]: 56: Hoare triple {1999#(<= 6 |id_#in~x|)} havoc #t~ret0; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:52:59,598 INFO L280 TraceCheckUtils]: 57: Hoare triple {1999#(<= 6 |id_#in~x|)} assume true; {1999#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:52:59,599 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-11 00:52:59,599 INFO L280 TraceCheckUtils]: 59: Hoare triple {1896#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1896#false} is VALID [2020-07-11 00:52:59,599 INFO L280 TraceCheckUtils]: 60: Hoare triple {1896#false} ~result~0 := #t~ret1; {1896#false} is VALID [2020-07-11 00:52:59,599 INFO L280 TraceCheckUtils]: 61: Hoare triple {1896#false} havoc #t~ret1; {1896#false} is VALID [2020-07-11 00:52:59,599 INFO L280 TraceCheckUtils]: 62: Hoare triple {1896#false} assume 5 != ~result~0; {1896#false} is VALID [2020-07-11 00:52:59,599 INFO L280 TraceCheckUtils]: 63: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2020-07-11 00:52:59,602 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-11 00:52:59,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1865180293] [2020-07-11 00:52:59,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:52:59,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 00:52:59,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242692667] [2020-07-11 00:52:59,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-07-11 00:52:59,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:52:59,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 00:52:59,665 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-11 00:52:59,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 00:52:59,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:52:59,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 00:52:59,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-07-11 00:52:59,666 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-07-11 00:53:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:53:00,626 INFO L93 Difference]: Finished difference Result 86 states and 122 transitions. [2020-07-11 00:53:00,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-11 00:53:00,626 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-07-11 00:53:00,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:53:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 00:53:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2020-07-11 00:53:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 00:53:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2020-07-11 00:53:00,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 103 transitions. [2020-07-11 00:53:00,776 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-11 00:53:00,777 INFO L225 Difference]: With dead ends: 86 [2020-07-11 00:53:00,777 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:53:00,780 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-11 00:53:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:53:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:53:00,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:53:00,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:53:00,780 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:53:00,781 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:53:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:53:00,781 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:53:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:53:00,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:53:00,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:53:00,782 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:53:00,782 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:53:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:53:00,782 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:53:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:53:00,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:53:00,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:53:00,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:53:00,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:53:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:53:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:53:00,783 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2020-07-11 00:53:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:53:00,783 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:53:00,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 00:53:00,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:53:00,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:53:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:53:00,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:53:00,784 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 00:53:00,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:53:01,218 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2020-07-11 00:53:01,398 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2020-07-11 00:53:01,621 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2020-07-11 00:53:01,824 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2020-07-11 00:53:01,970 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2020-07-11 00:53:01,982 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:53:01,982 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:53:01,983 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:53:01,983 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:53:01,983 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:53:01,983 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:53:01,983 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) the Hoare annotation is: false [2020-07-11 00:53:01,984 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-07-11 00:53:01,984 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 9 15) the Hoare annotation is: (<= 5 main_~input~0) [2020-07-11 00:53:01,984 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: false [2020-07-11 00:53:01,984 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-11 00:53:01,984 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-07-11 00:53:01,985 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-11 00:53:01,985 INFO L264 CegarLoopResult]: At program point L12-2(lines 9 15) the Hoare annotation is: (<= 5 main_~input~0) [2020-07-11 00:53:01,985 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-11 00:53:01,985 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-11 00:53:01,985 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-11 00:53:01,986 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-11 00:53:01,986 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-07-11 00:53:01,986 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-11 00:53:01,986 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-11 00:53:01,986 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-11 00:53:01,987 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-11 00:53:01,987 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-11 00:53:01,987 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-11 00:53:02,005 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-11 00:53:02,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:53:02 BoogieIcfgContainer [2020-07-11 00:53:02,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:53:02,022 INFO L168 Benchmark]: Toolchain (without parser) took 9297.84 ms. Allocated memory was 138.4 MB in the beginning and 329.8 MB in the end (delta: 191.4 MB). Free memory was 103.8 MB in the beginning and 165.7 MB in the end (delta: -61.9 MB). Peak memory consumption was 129.5 MB. Max. memory is 7.1 GB. [2020-07-11 00:53:02,028 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 00:53:02,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.27 ms. Allocated memory is still 138.4 MB. Free memory was 103.4 MB in the beginning and 94.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:53:02,030 INFO L168 Benchmark]: Boogie Preprocessor took 30.45 ms. Allocated memory is still 138.4 MB. Free memory was 94.1 MB in the beginning and 92.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:53:02,030 INFO L168 Benchmark]: RCFGBuilder took 373.58 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.5 MB in the beginning and 166.8 MB in the end (delta: -74.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-11 00:53:02,031 INFO L168 Benchmark]: TraceAbstraction took 8655.39 ms. Allocated memory was 202.9 MB in the beginning and 329.8 MB in the end (delta: 126.9 MB). Free memory was 166.8 MB in the beginning and 165.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 127.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:53:02,036 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 230.27 ms. Allocated memory is still 138.4 MB. Free memory was 103.4 MB in the beginning and 94.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 30.45 ms. Allocated memory is still 138.4 MB. Free memory was 94.1 MB in the beginning and 92.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 373.58 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.5 MB in the beginning and 166.8 MB in the end (delta: -74.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8655.39 ms. Allocated memory was 202.9 MB in the beginning and 329.8 MB in the end (delta: 126.9 MB). Free memory was 166.8 MB in the beginning and 165.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 127.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: 7.3s, OverallIterations: 7, TraceHistogramMax: 7, AutomataDifference: 3.8s, 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.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s 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.4s 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...