/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:51:23,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:51:23,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:51:23,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:51:23,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:51:23,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:51:23,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:51:23,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:51:23,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:51:23,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:51:23,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:51:23,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:51:23,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:51:23,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:51:23,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:51:23,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:51:23,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:51:23,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:51:23,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:51:23,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:51:23,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:51:23,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:51:23,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:51:23,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:51:23,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:51:23,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:51:23,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:51:23,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:51:23,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:51:23,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:51:23,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:51:23,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:51:23,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:51:23,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:51:23,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:51:23,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:51:23,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:51:23,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:51:23,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:51:23,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:51:23,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:51:23,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:51:23,491 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:51:23,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:51:23,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:51:23,493 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:51:23,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:51:23,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:51:23,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:51:23,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:51:23,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:51:23,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:51:23,495 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:51:23,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:51:23,496 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:51:23,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:51:23,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:51:23,497 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:51:23,497 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:51:23,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:51:23,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:51:23,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:51:23,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:51:23,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:51:23,498 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:51:23,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:51:23,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:51:23,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:51:23,812 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:51:23,812 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:51:23,813 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2020-07-11 00:51:23,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/161311dd1/afab8827664341b9896479da2c23941c/FLAG6bef4fd21 [2020-07-11 00:51:24,336 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:51:24,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2020-07-11 00:51:24,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/161311dd1/afab8827664341b9896479da2c23941c/FLAG6bef4fd21 [2020-07-11 00:51:24,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/161311dd1/afab8827664341b9896479da2c23941c [2020-07-11 00:51:24,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:51:24,718 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:51:24,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:51:24,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:51:24,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:51:24,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:24,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7c266f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24, skipping insertion in model container [2020-07-11 00:51:24,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:24,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:51:24,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:51:24,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:51:24,953 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:51:24,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:51:24,991 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:51:24,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24 WrapperNode [2020-07-11 00:51:24,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:51:24,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:51:24,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:51:24,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:51:25,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:25,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:25,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:25,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:25,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:25,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:25,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... [2020-07-11 00:51:25,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:51:25,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:51:25,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:51:25,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:51:25,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:51:25,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:51:25,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:51:25,181 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-11 00:51:25,181 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-07-11 00:51:25,181 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:51:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:51:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:51:25,182 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-11 00:51:25,182 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-07-11 00:51:25,182 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:51:25,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:51:25,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:51:25,471 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:51:25,471 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:51:25,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:51:25 BoogieIcfgContainer [2020-07-11 00:51:25,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:51:25,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:51:25,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:51:25,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:51:25,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:51:24" (1/3) ... [2020-07-11 00:51:25,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9c4bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:51:25, skipping insertion in model container [2020-07-11 00:51:25,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:24" (2/3) ... [2020-07-11 00:51:25,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9c4bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:51:25, skipping insertion in model container [2020-07-11 00:51:25,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:51:25" (3/3) ... [2020-07-11 00:51:25,484 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2020-07-11 00:51:25,495 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:51:25,503 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:51:25,541 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:51:25,593 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:51:25,593 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:51:25,593 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:51:25,594 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:51:25,594 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:51:25,594 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:51:25,594 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:51:25,594 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:51:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-11 00:51:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-11 00:51:25,630 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:25,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:25,631 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash -588914908, now seen corresponding path program 1 times [2020-07-11 00:51:25,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:25,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [299361315] [2020-07-11 00:51:25,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:25,827 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-11 00:51:25,827 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37#true} {37#true} #44#return; {37#true} is VALID [2020-07-11 00:51:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:25,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~x := #in~x; {47#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:25,890 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(= |id_#in~x| id_~x)} assume 0 == ~x; {48#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:25,891 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#(= 0 |id_#in~x|)} #res := 0; {48#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:25,892 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#(= 0 |id_#in~x|)} assume true; {48#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:25,894 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#(= 0 |id_#in~x|)} {41#(<= 5 main_~input~0)} #48#return; {38#false} is VALID [2020-07-11 00:51:25,895 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2020-07-11 00:51:25,895 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-11 00:51:25,896 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #44#return; {37#true} is VALID [2020-07-11 00:51:25,896 INFO L263 TraceCheckUtils]: 3: Hoare triple {37#true} call #t~ret3 := main(); {37#true} is VALID [2020-07-11 00:51:25,897 INFO L280 TraceCheckUtils]: 4: Hoare triple {37#true} ~input~0 := 5; {41#(<= 5 main_~input~0)} is VALID [2020-07-11 00:51:25,898 INFO L263 TraceCheckUtils]: 5: Hoare triple {41#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {37#true} is VALID [2020-07-11 00:51:25,899 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} ~x := #in~x; {47#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:25,901 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#(= |id_#in~x| id_~x)} assume 0 == ~x; {48#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:25,903 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#(= 0 |id_#in~x|)} #res := 0; {48#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:25,904 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#(= 0 |id_#in~x|)} assume true; {48#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:25,906 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#(= 0 |id_#in~x|)} {41#(<= 5 main_~input~0)} #48#return; {38#false} is VALID [2020-07-11 00:51:25,907 INFO L280 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {38#false} is VALID [2020-07-11 00:51:25,907 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} ~result~0 := #t~ret2; {38#false} is VALID [2020-07-11 00:51:25,908 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} havoc #t~ret2; {38#false} is VALID [2020-07-11 00:51:25,908 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} assume 5 != ~result~0; {38#false} is VALID [2020-07-11 00:51:25,909 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-11 00:51:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:51:25,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [299361315] [2020-07-11 00:51:25,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:51:25,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:51:25,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538922508] [2020-07-11 00:51:25,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-11 00:51:25,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:25,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:51:25,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:25,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:51:25,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:25,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:51:25,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:51:25,981 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2020-07-11 00:51:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:26,261 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-11 00:51:26,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:51:26,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-11 00:51:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-11 00:51:26,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-11 00:51:26,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-11 00:51:26,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:26,378 INFO L225 Difference]: With dead ends: 46 [2020-07-11 00:51:26,379 INFO L226 Difference]: Without dead ends: 32 [2020-07-11 00:51:26,382 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:51:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-11 00:51:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-11 00:51:26,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:26,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-11 00:51:26,475 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-11 00:51:26,475 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-11 00:51:26,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:26,482 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-11 00:51:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-11 00:51:26,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:26,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:26,483 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-11 00:51:26,484 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-11 00:51:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:26,488 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-11 00:51:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-11 00:51:26,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:26,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:26,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:26,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-11 00:51:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-11 00:51:26,495 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 16 [2020-07-11 00:51:26,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:26,496 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-11 00:51:26,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:51:26,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-11 00:51:26,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-11 00:51:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 00:51:26,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:26,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:26,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:51:26,551 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:26,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1852809946, now seen corresponding path program 1 times [2020-07-11 00:51:26,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:26,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [270297271] [2020-07-11 00:51:26,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:26,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} assume true; {273#true} is VALID [2020-07-11 00:51:26,619 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2020-07-11 00:51:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:26,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:26,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,736 INFO L280 TraceCheckUtils]: 3: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,738 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,739 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} ~x := #in~x; {291#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,739 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#(= |id_#in~x| id_~x)} assume !(0 == ~x); {291#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,740 INFO L263 TraceCheckUtils]: 2: Hoare triple {291#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {273#true} is VALID [2020-07-11 00:51:26,741 INFO L280 TraceCheckUtils]: 3: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:26,741 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,742 INFO L280 TraceCheckUtils]: 5: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,743 INFO L280 TraceCheckUtils]: 6: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,744 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,745 INFO L280 TraceCheckUtils]: 8: Hoare triple {297#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,746 INFO L280 TraceCheckUtils]: 9: Hoare triple {297#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,746 INFO L280 TraceCheckUtils]: 10: Hoare triple {297#(<= |id_#in~x| 1)} havoc #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,747 INFO L280 TraceCheckUtils]: 11: Hoare triple {297#(<= |id_#in~x| 1)} assume true; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,748 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {297#(<= |id_#in~x| 1)} {277#(<= 5 main_~input~0)} #48#return; {274#false} is VALID [2020-07-11 00:51:26,750 INFO L263 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2020-07-11 00:51:26,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {273#true} assume true; {273#true} is VALID [2020-07-11 00:51:26,751 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2020-07-11 00:51:26,751 INFO L263 TraceCheckUtils]: 3: Hoare triple {273#true} call #t~ret3 := main(); {273#true} is VALID [2020-07-11 00:51:26,752 INFO L280 TraceCheckUtils]: 4: Hoare triple {273#true} ~input~0 := 5; {277#(<= 5 main_~input~0)} is VALID [2020-07-11 00:51:26,752 INFO L263 TraceCheckUtils]: 5: Hoare triple {277#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {273#true} is VALID [2020-07-11 00:51:26,753 INFO L280 TraceCheckUtils]: 6: Hoare triple {273#true} ~x := #in~x; {291#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,754 INFO L280 TraceCheckUtils]: 7: Hoare triple {291#(= |id_#in~x| id_~x)} assume !(0 == ~x); {291#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:26,754 INFO L263 TraceCheckUtils]: 8: Hoare triple {291#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {273#true} is VALID [2020-07-11 00:51:26,755 INFO L280 TraceCheckUtils]: 9: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:26,756 INFO L280 TraceCheckUtils]: 10: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,756 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,757 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:26,758 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,759 INFO L280 TraceCheckUtils]: 14: Hoare triple {297#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,760 INFO L280 TraceCheckUtils]: 15: Hoare triple {297#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,760 INFO L280 TraceCheckUtils]: 16: Hoare triple {297#(<= |id_#in~x| 1)} havoc #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,761 INFO L280 TraceCheckUtils]: 17: Hoare triple {297#(<= |id_#in~x| 1)} assume true; {297#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:26,762 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {297#(<= |id_#in~x| 1)} {277#(<= 5 main_~input~0)} #48#return; {274#false} is VALID [2020-07-11 00:51:26,763 INFO L280 TraceCheckUtils]: 19: Hoare triple {274#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {274#false} is VALID [2020-07-11 00:51:26,763 INFO L280 TraceCheckUtils]: 20: Hoare triple {274#false} ~result~0 := #t~ret2; {274#false} is VALID [2020-07-11 00:51:26,763 INFO L280 TraceCheckUtils]: 21: Hoare triple {274#false} havoc #t~ret2; {274#false} is VALID [2020-07-11 00:51:26,764 INFO L280 TraceCheckUtils]: 22: Hoare triple {274#false} assume 5 != ~result~0; {274#false} is VALID [2020-07-11 00:51:26,764 INFO L280 TraceCheckUtils]: 23: Hoare triple {274#false} assume !false; {274#false} is VALID [2020-07-11 00:51:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:51:26,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [270297271] [2020-07-11 00:51:26,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:51:26,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 00:51:26,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219127639] [2020-07-11 00:51:26,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 00:51:26,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:26,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:51:26,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:26,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:51:26,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:26,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:51:26,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:51:26,799 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2020-07-11 00:51:27,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:27,089 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-11 00:51:27,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 00:51:27,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 00:51:27,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:51:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-11 00:51:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:51:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-11 00:51:27,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2020-07-11 00:51:27,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:27,163 INFO L225 Difference]: With dead ends: 45 [2020-07-11 00:51:27,163 INFO L226 Difference]: Without dead ends: 39 [2020-07-11 00:51:27,165 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-11 00:51:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-11 00:51:27,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-11 00:51:27,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:27,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2020-07-11 00:51:27,218 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2020-07-11 00:51:27,218 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2020-07-11 00:51:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:27,222 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-11 00:51:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-11 00:51:27,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:27,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:27,224 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2020-07-11 00:51:27,224 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2020-07-11 00:51:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:27,228 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-11 00:51:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-11 00:51:27,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:27,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:27,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:27,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-11 00:51:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-07-11 00:51:27,235 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2020-07-11 00:51:27,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:27,235 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-07-11 00:51:27,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:51:27,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2020-07-11 00:51:27,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-11 00:51:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-11 00:51:27,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:27,292 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:27,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:51:27,293 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:27,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:27,294 INFO L82 PathProgramCache]: Analyzing trace with hash -238705980, now seen corresponding path program 1 times [2020-07-11 00:51:27,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:27,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1230620310] [2020-07-11 00:51:27,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:27,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} assume true; {548#true} is VALID [2020-07-11 00:51:27,340 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {548#true} {548#true} #44#return; {548#true} is VALID [2020-07-11 00:51:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:27,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:27,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:27,448 INFO L280 TraceCheckUtils]: 3: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:27,450 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {596#(= 0 |id_#in~x|)} {589#(= id2_~x |id2_#in~x|)} #42#return; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} ~x := #in~x; {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {589#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,452 INFO L263 TraceCheckUtils]: 2: Hoare triple {589#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {548#true} is VALID [2020-07-11 00:51:27,468 INFO L280 TraceCheckUtils]: 3: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,469 INFO L280 TraceCheckUtils]: 4: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:27,470 INFO L280 TraceCheckUtils]: 5: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:27,471 INFO L280 TraceCheckUtils]: 6: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:27,472 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {596#(= 0 |id_#in~x|)} {589#(= id2_~x |id2_#in~x|)} #42#return; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,473 INFO L280 TraceCheckUtils]: 8: Hoare triple {595#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,474 INFO L280 TraceCheckUtils]: 9: Hoare triple {595#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,475 INFO L280 TraceCheckUtils]: 10: Hoare triple {595#(<= |id2_#in~x| 1)} havoc #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,475 INFO L280 TraceCheckUtils]: 11: Hoare triple {595#(<= |id2_#in~x| 1)} assume true; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,477 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {595#(<= |id2_#in~x| 1)} {574#(= |id_#in~x| id_~x)} #50#return; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:27,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {574#(= |id_#in~x| id_~x)} assume !(0 == ~x); {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,479 INFO L263 TraceCheckUtils]: 2: Hoare triple {574#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {548#true} is VALID [2020-07-11 00:51:27,480 INFO L280 TraceCheckUtils]: 3: Hoare triple {548#true} ~x := #in~x; {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,480 INFO L280 TraceCheckUtils]: 4: Hoare triple {589#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,480 INFO L263 TraceCheckUtils]: 5: Hoare triple {589#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {548#true} is VALID [2020-07-11 00:51:27,481 INFO L280 TraceCheckUtils]: 6: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,482 INFO L280 TraceCheckUtils]: 7: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:27,483 INFO L280 TraceCheckUtils]: 8: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:27,484 INFO L280 TraceCheckUtils]: 9: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:27,485 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {596#(= 0 |id_#in~x|)} {589#(= id2_~x |id2_#in~x|)} #42#return; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,486 INFO L280 TraceCheckUtils]: 11: Hoare triple {595#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,486 INFO L280 TraceCheckUtils]: 12: Hoare triple {595#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,487 INFO L280 TraceCheckUtils]: 13: Hoare triple {595#(<= |id2_#in~x| 1)} havoc #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,488 INFO L280 TraceCheckUtils]: 14: Hoare triple {595#(<= |id2_#in~x| 1)} assume true; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,489 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {595#(<= |id2_#in~x| 1)} {574#(= |id_#in~x| id_~x)} #50#return; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:27,490 INFO L280 TraceCheckUtils]: 16: Hoare triple {588#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:27,491 INFO L280 TraceCheckUtils]: 17: Hoare triple {588#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:27,491 INFO L280 TraceCheckUtils]: 18: Hoare triple {588#(<= |id_#in~x| 2)} havoc #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:27,492 INFO L280 TraceCheckUtils]: 19: Hoare triple {588#(<= |id_#in~x| 2)} assume true; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:27,493 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {588#(<= |id_#in~x| 2)} {552#(<= 5 main_~input~0)} #48#return; {549#false} is VALID [2020-07-11 00:51:27,494 INFO L263 TraceCheckUtils]: 0: Hoare triple {548#true} call ULTIMATE.init(); {548#true} is VALID [2020-07-11 00:51:27,495 INFO L280 TraceCheckUtils]: 1: Hoare triple {548#true} assume true; {548#true} is VALID [2020-07-11 00:51:27,495 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {548#true} {548#true} #44#return; {548#true} is VALID [2020-07-11 00:51:27,495 INFO L263 TraceCheckUtils]: 3: Hoare triple {548#true} call #t~ret3 := main(); {548#true} is VALID [2020-07-11 00:51:27,496 INFO L280 TraceCheckUtils]: 4: Hoare triple {548#true} ~input~0 := 5; {552#(<= 5 main_~input~0)} is VALID [2020-07-11 00:51:27,496 INFO L263 TraceCheckUtils]: 5: Hoare triple {552#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {548#true} is VALID [2020-07-11 00:51:27,497 INFO L280 TraceCheckUtils]: 6: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,498 INFO L280 TraceCheckUtils]: 7: Hoare triple {574#(= |id_#in~x| id_~x)} assume !(0 == ~x); {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,498 INFO L263 TraceCheckUtils]: 8: Hoare triple {574#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {548#true} is VALID [2020-07-11 00:51:27,498 INFO L280 TraceCheckUtils]: 9: Hoare triple {548#true} ~x := #in~x; {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,499 INFO L280 TraceCheckUtils]: 10: Hoare triple {589#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:27,499 INFO L263 TraceCheckUtils]: 11: Hoare triple {589#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {548#true} is VALID [2020-07-11 00:51:27,500 INFO L280 TraceCheckUtils]: 12: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:27,501 INFO L280 TraceCheckUtils]: 13: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:27,501 INFO L280 TraceCheckUtils]: 14: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:27,502 INFO L280 TraceCheckUtils]: 15: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:27,503 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {596#(= 0 |id_#in~x|)} {589#(= id2_~x |id2_#in~x|)} #42#return; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,504 INFO L280 TraceCheckUtils]: 17: Hoare triple {595#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,505 INFO L280 TraceCheckUtils]: 18: Hoare triple {595#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,505 INFO L280 TraceCheckUtils]: 19: Hoare triple {595#(<= |id2_#in~x| 1)} havoc #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,506 INFO L280 TraceCheckUtils]: 20: Hoare triple {595#(<= |id2_#in~x| 1)} assume true; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:27,507 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {595#(<= |id2_#in~x| 1)} {574#(= |id_#in~x| id_~x)} #50#return; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:27,508 INFO L280 TraceCheckUtils]: 22: Hoare triple {588#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:27,508 INFO L280 TraceCheckUtils]: 23: Hoare triple {588#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:27,509 INFO L280 TraceCheckUtils]: 24: Hoare triple {588#(<= |id_#in~x| 2)} havoc #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:27,510 INFO L280 TraceCheckUtils]: 25: Hoare triple {588#(<= |id_#in~x| 2)} assume true; {588#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:27,511 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {588#(<= |id_#in~x| 2)} {552#(<= 5 main_~input~0)} #48#return; {549#false} is VALID [2020-07-11 00:51:27,511 INFO L280 TraceCheckUtils]: 27: Hoare triple {549#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {549#false} is VALID [2020-07-11 00:51:27,511 INFO L280 TraceCheckUtils]: 28: Hoare triple {549#false} ~result~0 := #t~ret2; {549#false} is VALID [2020-07-11 00:51:27,512 INFO L280 TraceCheckUtils]: 29: Hoare triple {549#false} havoc #t~ret2; {549#false} is VALID [2020-07-11 00:51:27,512 INFO L280 TraceCheckUtils]: 30: Hoare triple {549#false} assume 5 != ~result~0; {549#false} is VALID [2020-07-11 00:51:27,512 INFO L280 TraceCheckUtils]: 31: Hoare triple {549#false} assume !false; {549#false} is VALID [2020-07-11 00:51:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-11 00:51:27,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1230620310] [2020-07-11 00:51:27,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:27,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 00:51:27,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366256594] [2020-07-11 00:51:27,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-11 00:51:27,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:27,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:51:27,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:27,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:51:27,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:27,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:51:27,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:51:27,552 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 8 states. [2020-07-11 00:51:27,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:27,870 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-11 00:51:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 00:51:27,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-11 00:51:27,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:51:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-11 00:51:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:51:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-11 00:51:27,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2020-07-11 00:51:27,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:27,936 INFO L225 Difference]: With dead ends: 55 [2020-07-11 00:51:27,937 INFO L226 Difference]: Without dead ends: 49 [2020-07-11 00:51:27,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-11 00:51:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-11 00:51:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2020-07-11 00:51:27,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:27,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 42 states. [2020-07-11 00:51:27,992 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 42 states. [2020-07-11 00:51:27,992 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 42 states. [2020-07-11 00:51:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:27,995 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-11 00:51:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-11 00:51:27,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:27,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:27,997 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 49 states. [2020-07-11 00:51:27,997 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 49 states. [2020-07-11 00:51:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:28,000 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-11 00:51:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-11 00:51:28,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:28,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:28,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:28,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-11 00:51:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-11 00:51:28,005 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 32 [2020-07-11 00:51:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:28,005 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-11 00:51:28,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:51:28,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2020-07-11 00:51:28,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-11 00:51:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-11 00:51:28,061 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:28,061 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:28,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:51:28,061 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:28,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:28,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2006293766, now seen corresponding path program 1 times [2020-07-11 00:51:28,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:28,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1862962940] [2020-07-11 00:51:28,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:28,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} assume true; {897#true} is VALID [2020-07-11 00:51:28,101 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {897#true} {897#true} #44#return; {897#true} is VALID [2020-07-11 00:51:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:28,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,279 INFO L280 TraceCheckUtils]: 3: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,280 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,282 INFO L263 TraceCheckUtils]: 2: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-11 00:51:28,282 INFO L280 TraceCheckUtils]: 3: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,283 INFO L280 TraceCheckUtils]: 4: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,283 INFO L280 TraceCheckUtils]: 5: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,284 INFO L280 TraceCheckUtils]: 6: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,285 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,286 INFO L280 TraceCheckUtils]: 8: Hoare triple {974#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,287 INFO L280 TraceCheckUtils]: 9: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,288 INFO L280 TraceCheckUtils]: 10: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,288 INFO L280 TraceCheckUtils]: 11: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,296 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {974#(<= |id_#in~x| 1)} {954#(= id2_~x |id2_#in~x|)} #42#return; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,297 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,298 INFO L263 TraceCheckUtils]: 2: Hoare triple {954#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {897#true} is VALID [2020-07-11 00:51:28,299 INFO L280 TraceCheckUtils]: 3: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,299 INFO L280 TraceCheckUtils]: 4: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,300 INFO L263 TraceCheckUtils]: 5: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-11 00:51:28,300 INFO L280 TraceCheckUtils]: 6: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,301 INFO L280 TraceCheckUtils]: 7: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,301 INFO L280 TraceCheckUtils]: 8: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,302 INFO L280 TraceCheckUtils]: 9: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,303 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,304 INFO L280 TraceCheckUtils]: 11: Hoare triple {974#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,304 INFO L280 TraceCheckUtils]: 12: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,305 INFO L280 TraceCheckUtils]: 13: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,305 INFO L280 TraceCheckUtils]: 14: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,307 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {974#(<= |id_#in~x| 1)} {954#(= id2_~x |id2_#in~x|)} #42#return; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,307 INFO L280 TraceCheckUtils]: 16: Hoare triple {968#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,308 INFO L280 TraceCheckUtils]: 17: Hoare triple {968#(<= |id2_#in~x| 2)} #res := 1 + #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,308 INFO L280 TraceCheckUtils]: 18: Hoare triple {968#(<= |id2_#in~x| 2)} havoc #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,309 INFO L280 TraceCheckUtils]: 19: Hoare triple {968#(<= |id2_#in~x| 2)} assume true; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,310 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {968#(<= |id2_#in~x| 2)} {931#(= |id_#in~x| id_~x)} #50#return; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:28,311 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,312 INFO L263 TraceCheckUtils]: 2: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-11 00:51:28,313 INFO L280 TraceCheckUtils]: 3: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,313 INFO L280 TraceCheckUtils]: 4: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,313 INFO L263 TraceCheckUtils]: 5: Hoare triple {954#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {897#true} is VALID [2020-07-11 00:51:28,314 INFO L280 TraceCheckUtils]: 6: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,314 INFO L280 TraceCheckUtils]: 7: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,315 INFO L263 TraceCheckUtils]: 8: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-11 00:51:28,315 INFO L280 TraceCheckUtils]: 9: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,316 INFO L280 TraceCheckUtils]: 10: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,321 INFO L280 TraceCheckUtils]: 11: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,321 INFO L280 TraceCheckUtils]: 12: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,323 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,323 INFO L280 TraceCheckUtils]: 14: Hoare triple {974#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,324 INFO L280 TraceCheckUtils]: 15: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,324 INFO L280 TraceCheckUtils]: 16: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,325 INFO L280 TraceCheckUtils]: 17: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,326 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {974#(<= |id_#in~x| 1)} {954#(= id2_~x |id2_#in~x|)} #42#return; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,326 INFO L280 TraceCheckUtils]: 19: Hoare triple {968#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,327 INFO L280 TraceCheckUtils]: 20: Hoare triple {968#(<= |id2_#in~x| 2)} #res := 1 + #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,327 INFO L280 TraceCheckUtils]: 21: Hoare triple {968#(<= |id2_#in~x| 2)} havoc #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,328 INFO L280 TraceCheckUtils]: 22: Hoare triple {968#(<= |id2_#in~x| 2)} assume true; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,329 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {968#(<= |id2_#in~x| 2)} {931#(= |id_#in~x| id_~x)} #50#return; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:28,331 INFO L280 TraceCheckUtils]: 24: Hoare triple {953#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:28,331 INFO L280 TraceCheckUtils]: 25: Hoare triple {953#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:28,332 INFO L280 TraceCheckUtils]: 26: Hoare triple {953#(<= |id_#in~x| 3)} havoc #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:28,332 INFO L280 TraceCheckUtils]: 27: Hoare triple {953#(<= |id_#in~x| 3)} assume true; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:28,334 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {953#(<= |id_#in~x| 3)} {901#(<= 5 main_~input~0)} #48#return; {898#false} is VALID [2020-07-11 00:51:28,336 INFO L263 TraceCheckUtils]: 0: Hoare triple {897#true} call ULTIMATE.init(); {897#true} is VALID [2020-07-11 00:51:28,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {897#true} assume true; {897#true} is VALID [2020-07-11 00:51:28,336 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {897#true} {897#true} #44#return; {897#true} is VALID [2020-07-11 00:51:28,336 INFO L263 TraceCheckUtils]: 3: Hoare triple {897#true} call #t~ret3 := main(); {897#true} is VALID [2020-07-11 00:51:28,339 INFO L280 TraceCheckUtils]: 4: Hoare triple {897#true} ~input~0 := 5; {901#(<= 5 main_~input~0)} is VALID [2020-07-11 00:51:28,339 INFO L263 TraceCheckUtils]: 5: Hoare triple {901#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {897#true} is VALID [2020-07-11 00:51:28,339 INFO L280 TraceCheckUtils]: 6: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,340 INFO L280 TraceCheckUtils]: 7: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,340 INFO L263 TraceCheckUtils]: 8: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-11 00:51:28,341 INFO L280 TraceCheckUtils]: 9: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,341 INFO L280 TraceCheckUtils]: 10: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,341 INFO L263 TraceCheckUtils]: 11: Hoare triple {954#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {897#true} is VALID [2020-07-11 00:51:28,342 INFO L280 TraceCheckUtils]: 12: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,343 INFO L280 TraceCheckUtils]: 13: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:28,343 INFO L263 TraceCheckUtils]: 14: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-11 00:51:28,343 INFO L280 TraceCheckUtils]: 15: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:28,344 INFO L280 TraceCheckUtils]: 16: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,344 INFO L280 TraceCheckUtils]: 17: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,344 INFO L280 TraceCheckUtils]: 18: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:28,345 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,346 INFO L280 TraceCheckUtils]: 20: Hoare triple {974#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,346 INFO L280 TraceCheckUtils]: 21: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,347 INFO L280 TraceCheckUtils]: 22: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,347 INFO L280 TraceCheckUtils]: 23: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:51:28,349 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {974#(<= |id_#in~x| 1)} {954#(= id2_~x |id2_#in~x|)} #42#return; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,349 INFO L280 TraceCheckUtils]: 25: Hoare triple {968#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,351 INFO L280 TraceCheckUtils]: 26: Hoare triple {968#(<= |id2_#in~x| 2)} #res := 1 + #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,353 INFO L280 TraceCheckUtils]: 27: Hoare triple {968#(<= |id2_#in~x| 2)} havoc #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,353 INFO L280 TraceCheckUtils]: 28: Hoare triple {968#(<= |id2_#in~x| 2)} assume true; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-11 00:51:28,356 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {968#(<= |id2_#in~x| 2)} {931#(= |id_#in~x| id_~x)} #50#return; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:28,357 INFO L280 TraceCheckUtils]: 30: Hoare triple {953#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:28,359 INFO L280 TraceCheckUtils]: 31: Hoare triple {953#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:28,360 INFO L280 TraceCheckUtils]: 32: Hoare triple {953#(<= |id_#in~x| 3)} havoc #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:28,360 INFO L280 TraceCheckUtils]: 33: Hoare triple {953#(<= |id_#in~x| 3)} assume true; {953#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:51:28,361 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {953#(<= |id_#in~x| 3)} {901#(<= 5 main_~input~0)} #48#return; {898#false} is VALID [2020-07-11 00:51:28,361 INFO L280 TraceCheckUtils]: 35: Hoare triple {898#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {898#false} is VALID [2020-07-11 00:51:28,361 INFO L280 TraceCheckUtils]: 36: Hoare triple {898#false} ~result~0 := #t~ret2; {898#false} is VALID [2020-07-11 00:51:28,362 INFO L280 TraceCheckUtils]: 37: Hoare triple {898#false} havoc #t~ret2; {898#false} is VALID [2020-07-11 00:51:28,362 INFO L280 TraceCheckUtils]: 38: Hoare triple {898#false} assume 5 != ~result~0; {898#false} is VALID [2020-07-11 00:51:28,362 INFO L280 TraceCheckUtils]: 39: Hoare triple {898#false} assume !false; {898#false} is VALID [2020-07-11 00:51:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-11 00:51:28,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1862962940] [2020-07-11 00:51:28,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:28,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-11 00:51:28,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743110623] [2020-07-11 00:51:28,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-07-11 00:51:28,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:28,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 00:51:28,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:28,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 00:51:28,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:28,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 00:51:28,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-11 00:51:28,411 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 9 states. [2020-07-11 00:51:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:28,745 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-07-11 00:51:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 00:51:28,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-07-11 00:51:28,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 00:51:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-11 00:51:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 00:51:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-11 00:51:28,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2020-07-11 00:51:28,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:28,829 INFO L225 Difference]: With dead ends: 65 [2020-07-11 00:51:28,829 INFO L226 Difference]: Without dead ends: 59 [2020-07-11 00:51:28,830 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-07-11 00:51:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-11 00:51:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-07-11 00:51:28,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:28,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 47 states. [2020-07-11 00:51:28,906 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 47 states. [2020-07-11 00:51:28,907 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 47 states. [2020-07-11 00:51:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:28,911 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-11 00:51:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-11 00:51:28,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:28,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:28,912 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 59 states. [2020-07-11 00:51:28,913 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 59 states. [2020-07-11 00:51:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:28,915 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-11 00:51:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-11 00:51:28,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:28,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:28,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:28,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-11 00:51:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2020-07-11 00:51:28,919 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 40 [2020-07-11 00:51:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:28,919 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2020-07-11 00:51:28,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 00:51:28,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2020-07-11 00:51:28,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-07-11 00:51:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-11 00:51:28,992 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:28,992 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:28,993 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:51:28,993 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:28,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:28,993 INFO L82 PathProgramCache]: Analyzing trace with hash 940355172, now seen corresponding path program 2 times [2020-07-11 00:51:28,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:28,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2107079589] [2020-07-11 00:51:28,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:29,028 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} assume true; {1328#true} is VALID [2020-07-11 00:51:29,028 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1328#true} {1328#true} #44#return; {1328#true} is VALID [2020-07-11 00:51:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:29,224 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,228 INFO L280 TraceCheckUtils]: 2: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,229 INFO L280 TraceCheckUtils]: 3: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,231 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,231 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,232 INFO L280 TraceCheckUtils]: 1: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,232 INFO L263 TraceCheckUtils]: 2: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,233 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,233 INFO L280 TraceCheckUtils]: 4: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,234 INFO L280 TraceCheckUtils]: 5: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,234 INFO L280 TraceCheckUtils]: 6: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,235 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,236 INFO L280 TraceCheckUtils]: 9: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,236 INFO L280 TraceCheckUtils]: 10: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,237 INFO L280 TraceCheckUtils]: 11: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,239 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,240 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,241 INFO L263 TraceCheckUtils]: 2: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,242 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,243 INFO L280 TraceCheckUtils]: 4: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,244 INFO L263 TraceCheckUtils]: 5: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,244 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,245 INFO L280 TraceCheckUtils]: 7: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,246 INFO L280 TraceCheckUtils]: 8: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,246 INFO L280 TraceCheckUtils]: 9: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,247 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,248 INFO L280 TraceCheckUtils]: 11: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,248 INFO L280 TraceCheckUtils]: 12: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,248 INFO L280 TraceCheckUtils]: 13: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,249 INFO L280 TraceCheckUtils]: 14: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,250 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,250 INFO L280 TraceCheckUtils]: 16: Hoare triple {1437#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,251 INFO L280 TraceCheckUtils]: 17: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,251 INFO L280 TraceCheckUtils]: 18: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,252 INFO L280 TraceCheckUtils]: 19: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,253 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1437#(<= |id_#in~x| 2)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,254 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,255 INFO L280 TraceCheckUtils]: 1: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,256 INFO L263 TraceCheckUtils]: 2: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,257 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,258 INFO L280 TraceCheckUtils]: 4: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,258 INFO L263 TraceCheckUtils]: 5: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,259 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,260 INFO L280 TraceCheckUtils]: 7: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,260 INFO L263 TraceCheckUtils]: 8: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,261 INFO L280 TraceCheckUtils]: 9: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,262 INFO L280 TraceCheckUtils]: 10: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,263 INFO L280 TraceCheckUtils]: 11: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,264 INFO L280 TraceCheckUtils]: 12: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,265 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,266 INFO L280 TraceCheckUtils]: 14: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,269 INFO L280 TraceCheckUtils]: 15: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,270 INFO L280 TraceCheckUtils]: 16: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,270 INFO L280 TraceCheckUtils]: 17: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,272 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,272 INFO L280 TraceCheckUtils]: 19: Hoare triple {1437#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,273 INFO L280 TraceCheckUtils]: 20: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,274 INFO L280 TraceCheckUtils]: 21: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,274 INFO L280 TraceCheckUtils]: 22: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,275 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1437#(<= |id_#in~x| 2)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,276 INFO L280 TraceCheckUtils]: 24: Hoare triple {1423#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,276 INFO L280 TraceCheckUtils]: 25: Hoare triple {1423#(<= |id2_#in~x| 3)} #res := 1 + #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,277 INFO L280 TraceCheckUtils]: 26: Hoare triple {1423#(<= |id2_#in~x| 3)} havoc #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,278 INFO L280 TraceCheckUtils]: 27: Hoare triple {1423#(<= |id2_#in~x| 3)} assume true; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,279 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1423#(<= |id2_#in~x| 3)} {1370#(= |id_#in~x| id_~x)} #50#return; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:29,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,281 INFO L263 TraceCheckUtils]: 2: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,281 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,282 INFO L280 TraceCheckUtils]: 4: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,282 INFO L263 TraceCheckUtils]: 5: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,283 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,283 INFO L280 TraceCheckUtils]: 7: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,284 INFO L263 TraceCheckUtils]: 8: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,284 INFO L280 TraceCheckUtils]: 9: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,285 INFO L280 TraceCheckUtils]: 10: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,285 INFO L263 TraceCheckUtils]: 11: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,286 INFO L280 TraceCheckUtils]: 12: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,286 INFO L280 TraceCheckUtils]: 13: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,287 INFO L280 TraceCheckUtils]: 14: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,287 INFO L280 TraceCheckUtils]: 15: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,288 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,289 INFO L280 TraceCheckUtils]: 17: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,290 INFO L280 TraceCheckUtils]: 18: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,290 INFO L280 TraceCheckUtils]: 19: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,291 INFO L280 TraceCheckUtils]: 20: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,292 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,292 INFO L280 TraceCheckUtils]: 22: Hoare triple {1437#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,293 INFO L280 TraceCheckUtils]: 23: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,294 INFO L280 TraceCheckUtils]: 24: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,294 INFO L280 TraceCheckUtils]: 25: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,295 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1437#(<= |id_#in~x| 2)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,296 INFO L280 TraceCheckUtils]: 27: Hoare triple {1423#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,296 INFO L280 TraceCheckUtils]: 28: Hoare triple {1423#(<= |id2_#in~x| 3)} #res := 1 + #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,297 INFO L280 TraceCheckUtils]: 29: Hoare triple {1423#(<= |id2_#in~x| 3)} havoc #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,298 INFO L280 TraceCheckUtils]: 30: Hoare triple {1423#(<= |id2_#in~x| 3)} assume true; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,299 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1423#(<= |id2_#in~x| 3)} {1370#(= |id_#in~x| id_~x)} #50#return; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:29,299 INFO L280 TraceCheckUtils]: 32: Hoare triple {1400#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:29,300 INFO L280 TraceCheckUtils]: 33: Hoare triple {1400#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:29,301 INFO L280 TraceCheckUtils]: 34: Hoare triple {1400#(<= |id_#in~x| 4)} havoc #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:29,301 INFO L280 TraceCheckUtils]: 35: Hoare triple {1400#(<= |id_#in~x| 4)} assume true; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:29,304 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1400#(<= |id_#in~x| 4)} {1332#(<= 5 main_~input~0)} #48#return; {1329#false} is VALID [2020-07-11 00:51:29,306 INFO L263 TraceCheckUtils]: 0: Hoare triple {1328#true} call ULTIMATE.init(); {1328#true} is VALID [2020-07-11 00:51:29,306 INFO L280 TraceCheckUtils]: 1: Hoare triple {1328#true} assume true; {1328#true} is VALID [2020-07-11 00:51:29,306 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1328#true} {1328#true} #44#return; {1328#true} is VALID [2020-07-11 00:51:29,306 INFO L263 TraceCheckUtils]: 3: Hoare triple {1328#true} call #t~ret3 := main(); {1328#true} is VALID [2020-07-11 00:51:29,308 INFO L280 TraceCheckUtils]: 4: Hoare triple {1328#true} ~input~0 := 5; {1332#(<= 5 main_~input~0)} is VALID [2020-07-11 00:51:29,309 INFO L263 TraceCheckUtils]: 5: Hoare triple {1332#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {1328#true} is VALID [2020-07-11 00:51:29,310 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,311 INFO L280 TraceCheckUtils]: 7: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,311 INFO L263 TraceCheckUtils]: 8: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,312 INFO L280 TraceCheckUtils]: 9: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,313 INFO L280 TraceCheckUtils]: 10: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,313 INFO L263 TraceCheckUtils]: 11: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,314 INFO L280 TraceCheckUtils]: 12: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,315 INFO L280 TraceCheckUtils]: 13: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,315 INFO L263 TraceCheckUtils]: 14: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,315 INFO L280 TraceCheckUtils]: 15: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,316 INFO L280 TraceCheckUtils]: 16: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:29,316 INFO L263 TraceCheckUtils]: 17: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-11 00:51:29,318 INFO L280 TraceCheckUtils]: 18: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:29,319 INFO L280 TraceCheckUtils]: 19: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,319 INFO L280 TraceCheckUtils]: 20: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,320 INFO L280 TraceCheckUtils]: 21: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:29,320 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,323 INFO L280 TraceCheckUtils]: 23: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,323 INFO L280 TraceCheckUtils]: 24: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,324 INFO L280 TraceCheckUtils]: 25: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,325 INFO L280 TraceCheckUtils]: 26: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-11 00:51:29,327 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,328 INFO L280 TraceCheckUtils]: 28: Hoare triple {1437#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,329 INFO L280 TraceCheckUtils]: 29: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,330 INFO L280 TraceCheckUtils]: 30: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,331 INFO L280 TraceCheckUtils]: 31: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:51:29,332 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1437#(<= |id_#in~x| 2)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,333 INFO L280 TraceCheckUtils]: 33: Hoare triple {1423#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,334 INFO L280 TraceCheckUtils]: 34: Hoare triple {1423#(<= |id2_#in~x| 3)} #res := 1 + #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,334 INFO L280 TraceCheckUtils]: 35: Hoare triple {1423#(<= |id2_#in~x| 3)} havoc #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,335 INFO L280 TraceCheckUtils]: 36: Hoare triple {1423#(<= |id2_#in~x| 3)} assume true; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-11 00:51:29,337 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1423#(<= |id2_#in~x| 3)} {1370#(= |id_#in~x| id_~x)} #50#return; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:29,337 INFO L280 TraceCheckUtils]: 38: Hoare triple {1400#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:29,339 INFO L280 TraceCheckUtils]: 39: Hoare triple {1400#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:29,340 INFO L280 TraceCheckUtils]: 40: Hoare triple {1400#(<= |id_#in~x| 4)} havoc #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:29,340 INFO L280 TraceCheckUtils]: 41: Hoare triple {1400#(<= |id_#in~x| 4)} assume true; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:51:29,341 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1400#(<= |id_#in~x| 4)} {1332#(<= 5 main_~input~0)} #48#return; {1329#false} is VALID [2020-07-11 00:51:29,342 INFO L280 TraceCheckUtils]: 43: Hoare triple {1329#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1329#false} is VALID [2020-07-11 00:51:29,342 INFO L280 TraceCheckUtils]: 44: Hoare triple {1329#false} ~result~0 := #t~ret2; {1329#false} is VALID [2020-07-11 00:51:29,342 INFO L280 TraceCheckUtils]: 45: Hoare triple {1329#false} havoc #t~ret2; {1329#false} is VALID [2020-07-11 00:51:29,342 INFO L280 TraceCheckUtils]: 46: Hoare triple {1329#false} assume 5 != ~result~0; {1329#false} is VALID [2020-07-11 00:51:29,342 INFO L280 TraceCheckUtils]: 47: Hoare triple {1329#false} assume !false; {1329#false} is VALID [2020-07-11 00:51:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-11 00:51:29,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2107079589] [2020-07-11 00:51:29,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:29,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 00:51:29,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681188675] [2020-07-11 00:51:29,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-07-11 00:51:29,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:29,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 00:51:29,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:29,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 00:51:29,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:29,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 00:51:29,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:51:29,396 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 10 states. [2020-07-11 00:51:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:29,833 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-07-11 00:51:29,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 00:51:29,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-07-11 00:51:29,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:51:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-11 00:51:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:51:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-11 00:51:29,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 60 transitions. [2020-07-11 00:51:29,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:29,925 INFO L225 Difference]: With dead ends: 75 [2020-07-11 00:51:29,925 INFO L226 Difference]: Without dead ends: 69 [2020-07-11 00:51:29,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-07-11 00:51:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-11 00:51:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2020-07-11 00:51:30,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:30,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 52 states. [2020-07-11 00:51:30,028 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 52 states. [2020-07-11 00:51:30,028 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 52 states. [2020-07-11 00:51:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:30,032 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-07-11 00:51:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-07-11 00:51:30,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:30,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:30,033 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 69 states. [2020-07-11 00:51:30,033 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 69 states. [2020-07-11 00:51:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:30,036 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-07-11 00:51:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-07-11 00:51:30,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:30,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:30,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:30,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-11 00:51:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-07-11 00:51:30,040 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2020-07-11 00:51:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:30,041 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-07-11 00:51:30,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 00:51:30,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2020-07-11 00:51:30,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-11 00:51:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-11 00:51:30,103 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:30,103 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:30,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:51:30,103 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:30,104 INFO L82 PathProgramCache]: Analyzing trace with hash 826985242, now seen corresponding path program 2 times [2020-07-11 00:51:30,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:30,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [235172369] [2020-07-11 00:51:30,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:30,179 INFO L280 TraceCheckUtils]: 0: Hoare triple {1849#true} assume true; {1849#true} is VALID [2020-07-11 00:51:30,179 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1849#true} {1849#true} #44#return; {1849#true} is VALID [2020-07-11 00:51:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:30,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {1849#true} assume 0 == ~x; {1849#true} is VALID [2020-07-11 00:51:30,460 INFO L280 TraceCheckUtils]: 2: Hoare triple {1849#true} #res := 0; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,461 INFO L280 TraceCheckUtils]: 3: Hoare triple {2015#(= 0 |id2_#res|)} assume true; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,462 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2015#(= 0 |id2_#res|)} {1849#true} #50#return; {2013#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:30,462 INFO L280 TraceCheckUtils]: 0: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,463 INFO L280 TraceCheckUtils]: 1: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,463 INFO L263 TraceCheckUtils]: 2: Hoare triple {1849#true} call #t~ret0 := id2(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,463 INFO L280 TraceCheckUtils]: 3: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,463 INFO L280 TraceCheckUtils]: 4: Hoare triple {1849#true} assume 0 == ~x; {1849#true} is VALID [2020-07-11 00:51:30,464 INFO L280 TraceCheckUtils]: 5: Hoare triple {1849#true} #res := 0; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,464 INFO L280 TraceCheckUtils]: 6: Hoare triple {2015#(= 0 |id2_#res|)} assume true; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,465 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2015#(= 0 |id2_#res|)} {1849#true} #50#return; {2013#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:30,466 INFO L280 TraceCheckUtils]: 8: Hoare triple {2013#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2013#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:30,467 INFO L280 TraceCheckUtils]: 9: Hoare triple {2013#(= 0 |id_#t~ret0|)} #res := 1 + #t~ret0; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,467 INFO L280 TraceCheckUtils]: 10: Hoare triple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} havoc #t~ret0; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,468 INFO L280 TraceCheckUtils]: 11: Hoare triple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,469 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1849#true} #42#return; {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-11 00:51:30,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,472 INFO L263 TraceCheckUtils]: 2: Hoare triple {1849#true} call #t~ret1 := id(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,472 INFO L280 TraceCheckUtils]: 3: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,472 INFO L280 TraceCheckUtils]: 4: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,472 INFO L263 TraceCheckUtils]: 5: Hoare triple {1849#true} call #t~ret0 := id2(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,473 INFO L280 TraceCheckUtils]: 6: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,473 INFO L280 TraceCheckUtils]: 7: Hoare triple {1849#true} assume 0 == ~x; {1849#true} is VALID [2020-07-11 00:51:30,473 INFO L280 TraceCheckUtils]: 8: Hoare triple {1849#true} #res := 0; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,474 INFO L280 TraceCheckUtils]: 9: Hoare triple {2015#(= 0 |id2_#res|)} assume true; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,475 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2015#(= 0 |id2_#res|)} {1849#true} #50#return; {2013#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:30,476 INFO L280 TraceCheckUtils]: 11: Hoare triple {2013#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2013#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:30,476 INFO L280 TraceCheckUtils]: 12: Hoare triple {2013#(= 0 |id_#t~ret0|)} #res := 1 + #t~ret0; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,477 INFO L280 TraceCheckUtils]: 13: Hoare triple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} havoc #t~ret0; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,478 INFO L280 TraceCheckUtils]: 14: Hoare triple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,479 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1849#true} #42#return; {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-11 00:51:30,479 INFO L280 TraceCheckUtils]: 16: Hoare triple {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-11 00:51:30,480 INFO L280 TraceCheckUtils]: 17: Hoare triple {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} #res := 1 + #t~ret1; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,481 INFO L280 TraceCheckUtils]: 18: Hoare triple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} havoc #t~ret1; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,481 INFO L280 TraceCheckUtils]: 19: Hoare triple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,482 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1849#true} #50#return; {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-11 00:51:30,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,484 INFO L263 TraceCheckUtils]: 2: Hoare triple {1849#true} call #t~ret0 := id2(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,484 INFO L280 TraceCheckUtils]: 3: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,484 INFO L280 TraceCheckUtils]: 4: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,484 INFO L263 TraceCheckUtils]: 5: Hoare triple {1849#true} call #t~ret1 := id(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,485 INFO L280 TraceCheckUtils]: 6: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,485 INFO L280 TraceCheckUtils]: 7: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,485 INFO L263 TraceCheckUtils]: 8: Hoare triple {1849#true} call #t~ret0 := id2(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,485 INFO L280 TraceCheckUtils]: 9: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,485 INFO L280 TraceCheckUtils]: 10: Hoare triple {1849#true} assume 0 == ~x; {1849#true} is VALID [2020-07-11 00:51:30,486 INFO L280 TraceCheckUtils]: 11: Hoare triple {1849#true} #res := 0; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,487 INFO L280 TraceCheckUtils]: 12: Hoare triple {2015#(= 0 |id2_#res|)} assume true; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,488 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2015#(= 0 |id2_#res|)} {1849#true} #50#return; {2013#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:30,488 INFO L280 TraceCheckUtils]: 14: Hoare triple {2013#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2013#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:30,489 INFO L280 TraceCheckUtils]: 15: Hoare triple {2013#(= 0 |id_#t~ret0|)} #res := 1 + #t~ret0; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,489 INFO L280 TraceCheckUtils]: 16: Hoare triple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} havoc #t~ret0; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,490 INFO L280 TraceCheckUtils]: 17: Hoare triple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,491 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1849#true} #42#return; {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-11 00:51:30,492 INFO L280 TraceCheckUtils]: 19: Hoare triple {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-11 00:51:30,493 INFO L280 TraceCheckUtils]: 20: Hoare triple {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} #res := 1 + #t~ret1; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,493 INFO L280 TraceCheckUtils]: 21: Hoare triple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} havoc #t~ret1; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,494 INFO L280 TraceCheckUtils]: 22: Hoare triple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,495 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1849#true} #50#return; {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-11 00:51:30,496 INFO L280 TraceCheckUtils]: 24: Hoare triple {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-11 00:51:30,496 INFO L280 TraceCheckUtils]: 25: Hoare triple {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} #res := 1 + #t~ret0; {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-11 00:51:30,497 INFO L280 TraceCheckUtils]: 26: Hoare triple {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} havoc #t~ret0; {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-11 00:51:30,497 INFO L280 TraceCheckUtils]: 27: Hoare triple {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-11 00:51:30,498 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1849#true} #42#return; {1968#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-11 00:51:30,499 INFO L280 TraceCheckUtils]: 0: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,499 INFO L263 TraceCheckUtils]: 2: Hoare triple {1849#true} call #t~ret1 := id(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,499 INFO L280 TraceCheckUtils]: 3: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,500 INFO L263 TraceCheckUtils]: 5: Hoare triple {1849#true} call #t~ret0 := id2(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,500 INFO L280 TraceCheckUtils]: 6: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,500 INFO L280 TraceCheckUtils]: 7: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,500 INFO L263 TraceCheckUtils]: 8: Hoare triple {1849#true} call #t~ret1 := id(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,500 INFO L280 TraceCheckUtils]: 9: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,500 INFO L280 TraceCheckUtils]: 10: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,501 INFO L263 TraceCheckUtils]: 11: Hoare triple {1849#true} call #t~ret0 := id2(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,501 INFO L280 TraceCheckUtils]: 12: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,501 INFO L280 TraceCheckUtils]: 13: Hoare triple {1849#true} assume 0 == ~x; {1849#true} is VALID [2020-07-11 00:51:30,504 INFO L280 TraceCheckUtils]: 14: Hoare triple {1849#true} #res := 0; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,505 INFO L280 TraceCheckUtils]: 15: Hoare triple {2015#(= 0 |id2_#res|)} assume true; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,506 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2015#(= 0 |id2_#res|)} {1849#true} #50#return; {2013#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:30,506 INFO L280 TraceCheckUtils]: 17: Hoare triple {2013#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2013#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:30,506 INFO L280 TraceCheckUtils]: 18: Hoare triple {2013#(= 0 |id_#t~ret0|)} #res := 1 + #t~ret0; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,507 INFO L280 TraceCheckUtils]: 19: Hoare triple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} havoc #t~ret0; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,507 INFO L280 TraceCheckUtils]: 20: Hoare triple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,508 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1849#true} #42#return; {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-11 00:51:30,511 INFO L280 TraceCheckUtils]: 22: Hoare triple {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-11 00:51:30,513 INFO L280 TraceCheckUtils]: 23: Hoare triple {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} #res := 1 + #t~ret1; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,517 INFO L280 TraceCheckUtils]: 24: Hoare triple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} havoc #t~ret1; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,517 INFO L280 TraceCheckUtils]: 25: Hoare triple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,518 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1849#true} #50#return; {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-11 00:51:30,519 INFO L280 TraceCheckUtils]: 27: Hoare triple {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-11 00:51:30,520 INFO L280 TraceCheckUtils]: 28: Hoare triple {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} #res := 1 + #t~ret0; {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-11 00:51:30,520 INFO L280 TraceCheckUtils]: 29: Hoare triple {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} havoc #t~ret0; {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-11 00:51:30,521 INFO L280 TraceCheckUtils]: 30: Hoare triple {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-11 00:51:30,522 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1849#true} #42#return; {1968#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-11 00:51:30,523 INFO L280 TraceCheckUtils]: 32: Hoare triple {1968#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1968#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-11 00:51:30,523 INFO L280 TraceCheckUtils]: 33: Hoare triple {1968#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} #res := 1 + #t~ret1; {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-11 00:51:30,524 INFO L280 TraceCheckUtils]: 34: Hoare triple {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} havoc #t~ret1; {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-11 00:51:30,527 INFO L280 TraceCheckUtils]: 35: Hoare triple {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-11 00:51:30,528 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1849#true} #50#return; {1937#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-11 00:51:30,532 INFO L280 TraceCheckUtils]: 0: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,533 INFO L263 TraceCheckUtils]: 2: Hoare triple {1849#true} call #t~ret0 := id2(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,533 INFO L280 TraceCheckUtils]: 3: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,533 INFO L280 TraceCheckUtils]: 4: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,534 INFO L263 TraceCheckUtils]: 5: Hoare triple {1849#true} call #t~ret1 := id(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,534 INFO L280 TraceCheckUtils]: 6: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,534 INFO L280 TraceCheckUtils]: 7: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,534 INFO L263 TraceCheckUtils]: 8: Hoare triple {1849#true} call #t~ret0 := id2(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,534 INFO L280 TraceCheckUtils]: 9: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,534 INFO L280 TraceCheckUtils]: 10: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,535 INFO L263 TraceCheckUtils]: 11: Hoare triple {1849#true} call #t~ret1 := id(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,535 INFO L280 TraceCheckUtils]: 12: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,535 INFO L280 TraceCheckUtils]: 13: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,537 INFO L263 TraceCheckUtils]: 14: Hoare triple {1849#true} call #t~ret0 := id2(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,537 INFO L280 TraceCheckUtils]: 15: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,537 INFO L280 TraceCheckUtils]: 16: Hoare triple {1849#true} assume 0 == ~x; {1849#true} is VALID [2020-07-11 00:51:30,538 INFO L280 TraceCheckUtils]: 17: Hoare triple {1849#true} #res := 0; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,539 INFO L280 TraceCheckUtils]: 18: Hoare triple {2015#(= 0 |id2_#res|)} assume true; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,540 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2015#(= 0 |id2_#res|)} {1849#true} #50#return; {2013#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:30,540 INFO L280 TraceCheckUtils]: 20: Hoare triple {2013#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2013#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:30,541 INFO L280 TraceCheckUtils]: 21: Hoare triple {2013#(= 0 |id_#t~ret0|)} #res := 1 + #t~ret0; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,541 INFO L280 TraceCheckUtils]: 22: Hoare triple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} havoc #t~ret0; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,542 INFO L280 TraceCheckUtils]: 23: Hoare triple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,543 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1849#true} #42#return; {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-11 00:51:30,544 INFO L280 TraceCheckUtils]: 25: Hoare triple {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-11 00:51:30,545 INFO L280 TraceCheckUtils]: 26: Hoare triple {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} #res := 1 + #t~ret1; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,545 INFO L280 TraceCheckUtils]: 27: Hoare triple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} havoc #t~ret1; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,546 INFO L280 TraceCheckUtils]: 28: Hoare triple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,547 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1849#true} #50#return; {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-11 00:51:30,547 INFO L280 TraceCheckUtils]: 30: Hoare triple {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-11 00:51:30,548 INFO L280 TraceCheckUtils]: 31: Hoare triple {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} #res := 1 + #t~ret0; {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-11 00:51:30,549 INFO L280 TraceCheckUtils]: 32: Hoare triple {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} havoc #t~ret0; {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-11 00:51:30,549 INFO L280 TraceCheckUtils]: 33: Hoare triple {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-11 00:51:30,550 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1849#true} #42#return; {1968#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-11 00:51:30,551 INFO L280 TraceCheckUtils]: 35: Hoare triple {1968#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1968#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-11 00:51:30,552 INFO L280 TraceCheckUtils]: 36: Hoare triple {1968#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} #res := 1 + #t~ret1; {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-11 00:51:30,552 INFO L280 TraceCheckUtils]: 37: Hoare triple {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} havoc #t~ret1; {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-11 00:51:30,553 INFO L280 TraceCheckUtils]: 38: Hoare triple {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-11 00:51:30,554 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1849#true} #50#return; {1937#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-11 00:51:30,555 INFO L280 TraceCheckUtils]: 40: Hoare triple {1937#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1937#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-11 00:51:30,556 INFO L280 TraceCheckUtils]: 41: Hoare triple {1937#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} #res := 1 + #t~ret0; {1938#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-11 00:51:30,556 INFO L280 TraceCheckUtils]: 42: Hoare triple {1938#(and (<= 5 |id_#res|) (<= |id_#res| 5))} havoc #t~ret0; {1938#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-11 00:51:30,557 INFO L280 TraceCheckUtils]: 43: Hoare triple {1938#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1938#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-11 00:51:30,558 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1938#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1849#true} #48#return; {1898#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} is VALID [2020-07-11 00:51:30,561 INFO L263 TraceCheckUtils]: 0: Hoare triple {1849#true} call ULTIMATE.init(); {1849#true} is VALID [2020-07-11 00:51:30,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {1849#true} assume true; {1849#true} is VALID [2020-07-11 00:51:30,561 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1849#true} {1849#true} #44#return; {1849#true} is VALID [2020-07-11 00:51:30,562 INFO L263 TraceCheckUtils]: 3: Hoare triple {1849#true} call #t~ret3 := main(); {1849#true} is VALID [2020-07-11 00:51:30,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {1849#true} ~input~0 := 5; {1849#true} is VALID [2020-07-11 00:51:30,563 INFO L263 TraceCheckUtils]: 5: Hoare triple {1849#true} call #t~ret2 := id(~input~0); {1849#true} is VALID [2020-07-11 00:51:30,563 INFO L280 TraceCheckUtils]: 6: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,563 INFO L280 TraceCheckUtils]: 7: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,563 INFO L263 TraceCheckUtils]: 8: Hoare triple {1849#true} call #t~ret0 := id2(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,563 INFO L280 TraceCheckUtils]: 9: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,564 INFO L263 TraceCheckUtils]: 11: Hoare triple {1849#true} call #t~ret1 := id(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,564 INFO L280 TraceCheckUtils]: 12: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,564 INFO L280 TraceCheckUtils]: 13: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,564 INFO L263 TraceCheckUtils]: 14: Hoare triple {1849#true} call #t~ret0 := id2(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,564 INFO L280 TraceCheckUtils]: 15: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,565 INFO L280 TraceCheckUtils]: 16: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,565 INFO L263 TraceCheckUtils]: 17: Hoare triple {1849#true} call #t~ret1 := id(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,565 INFO L280 TraceCheckUtils]: 18: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,565 INFO L280 TraceCheckUtils]: 19: Hoare triple {1849#true} assume !(0 == ~x); {1849#true} is VALID [2020-07-11 00:51:30,566 INFO L263 TraceCheckUtils]: 20: Hoare triple {1849#true} call #t~ret0 := id2(~x - 1); {1849#true} is VALID [2020-07-11 00:51:30,566 INFO L280 TraceCheckUtils]: 21: Hoare triple {1849#true} ~x := #in~x; {1849#true} is VALID [2020-07-11 00:51:30,566 INFO L280 TraceCheckUtils]: 22: Hoare triple {1849#true} assume 0 == ~x; {1849#true} is VALID [2020-07-11 00:51:30,567 INFO L280 TraceCheckUtils]: 23: Hoare triple {1849#true} #res := 0; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,567 INFO L280 TraceCheckUtils]: 24: Hoare triple {2015#(= 0 |id2_#res|)} assume true; {2015#(= 0 |id2_#res|)} is VALID [2020-07-11 00:51:30,568 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2015#(= 0 |id2_#res|)} {1849#true} #50#return; {2013#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:30,568 INFO L280 TraceCheckUtils]: 26: Hoare triple {2013#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2013#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:30,569 INFO L280 TraceCheckUtils]: 27: Hoare triple {2013#(= 0 |id_#t~ret0|)} #res := 1 + #t~ret0; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,570 INFO L280 TraceCheckUtils]: 28: Hoare triple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} havoc #t~ret0; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,570 INFO L280 TraceCheckUtils]: 29: Hoare triple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-11 00:51:30,571 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2014#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1849#true} #42#return; {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-11 00:51:30,572 INFO L280 TraceCheckUtils]: 31: Hoare triple {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-11 00:51:30,573 INFO L280 TraceCheckUtils]: 32: Hoare triple {2006#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} #res := 1 + #t~ret1; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,573 INFO L280 TraceCheckUtils]: 33: Hoare triple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} havoc #t~ret1; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,574 INFO L280 TraceCheckUtils]: 34: Hoare triple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-11 00:51:30,575 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2007#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1849#true} #50#return; {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-11 00:51:30,575 INFO L280 TraceCheckUtils]: 36: Hoare triple {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-11 00:51:30,576 INFO L280 TraceCheckUtils]: 37: Hoare triple {1991#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} #res := 1 + #t~ret0; {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-11 00:51:30,577 INFO L280 TraceCheckUtils]: 38: Hoare triple {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} havoc #t~ret0; {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-11 00:51:30,577 INFO L280 TraceCheckUtils]: 39: Hoare triple {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-11 00:51:30,578 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1992#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1849#true} #42#return; {1968#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-11 00:51:30,579 INFO L280 TraceCheckUtils]: 41: Hoare triple {1968#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1968#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-11 00:51:30,580 INFO L280 TraceCheckUtils]: 42: Hoare triple {1968#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} #res := 1 + #t~ret1; {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-11 00:51:30,580 INFO L280 TraceCheckUtils]: 43: Hoare triple {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} havoc #t~ret1; {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-11 00:51:30,581 INFO L280 TraceCheckUtils]: 44: Hoare triple {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-11 00:51:30,582 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1969#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1849#true} #50#return; {1937#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-11 00:51:30,583 INFO L280 TraceCheckUtils]: 46: Hoare triple {1937#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1937#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-11 00:51:30,584 INFO L280 TraceCheckUtils]: 47: Hoare triple {1937#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} #res := 1 + #t~ret0; {1938#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-11 00:51:30,584 INFO L280 TraceCheckUtils]: 48: Hoare triple {1938#(and (<= 5 |id_#res|) (<= |id_#res| 5))} havoc #t~ret0; {1938#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-11 00:51:30,585 INFO L280 TraceCheckUtils]: 49: Hoare triple {1938#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1938#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-11 00:51:30,586 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1938#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1849#true} #48#return; {1898#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} is VALID [2020-07-11 00:51:30,588 INFO L280 TraceCheckUtils]: 51: Hoare triple {1898#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1898#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} is VALID [2020-07-11 00:51:30,589 INFO L280 TraceCheckUtils]: 52: Hoare triple {1898#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} ~result~0 := #t~ret2; {1899#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-11 00:51:30,589 INFO L280 TraceCheckUtils]: 53: Hoare triple {1899#(and (< 4 main_~result~0) (<= main_~result~0 5))} havoc #t~ret2; {1899#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-11 00:51:30,590 INFO L280 TraceCheckUtils]: 54: Hoare triple {1899#(and (< 4 main_~result~0) (<= main_~result~0 5))} assume 5 != ~result~0; {1850#false} is VALID [2020-07-11 00:51:30,590 INFO L280 TraceCheckUtils]: 55: Hoare triple {1850#false} assume !false; {1850#false} is VALID [2020-07-11 00:51:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-11 00:51:30,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [235172369] [2020-07-11 00:51:30,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:30,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-11 00:51:30,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821346921] [2020-07-11 00:51:30,597 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-07-11 00:51:30,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:30,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 00:51:30,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:30,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 00:51:30,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:30,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 00:51:30,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-11 00:51:30,656 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 15 states. [2020-07-11 00:51:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:31,710 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2020-07-11 00:51:31,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-11 00:51:31,710 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-07-11 00:51:31,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:51:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 65 transitions. [2020-07-11 00:51:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:51:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 65 transitions. [2020-07-11 00:51:31,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 65 transitions. [2020-07-11 00:51:31,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:31,791 INFO L225 Difference]: With dead ends: 85 [2020-07-11 00:51:31,791 INFO L226 Difference]: Without dead ends: 79 [2020-07-11 00:51:31,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2020-07-11 00:51:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-11 00:51:31,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2020-07-11 00:51:31,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:31,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 57 states. [2020-07-11 00:51:31,928 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 57 states. [2020-07-11 00:51:31,928 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 57 states. [2020-07-11 00:51:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:31,931 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2020-07-11 00:51:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2020-07-11 00:51:31,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:31,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:31,932 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 79 states. [2020-07-11 00:51:31,933 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 79 states. [2020-07-11 00:51:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:31,936 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2020-07-11 00:51:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2020-07-11 00:51:31,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:31,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:31,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:31,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-11 00:51:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2020-07-11 00:51:31,940 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 56 [2020-07-11 00:51:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:31,940 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2020-07-11 00:51:31,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 00:51:31,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 59 transitions. [2020-07-11 00:51:32,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-07-11 00:51:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-11 00:51:32,038 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:32,038 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:32,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 00:51:32,039 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:32,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:32,039 INFO L82 PathProgramCache]: Analyzing trace with hash -996081148, now seen corresponding path program 3 times [2020-07-11 00:51:32,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:32,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1591357880] [2020-07-11 00:51:32,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:32,096 INFO L280 TraceCheckUtils]: 0: Hoare triple {2472#true} assume true; {2472#true} is VALID [2020-07-11 00:51:32,097 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2472#true} {2472#true} #44#return; {2472#true} is VALID [2020-07-11 00:51:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:32,380 INFO L280 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,381 INFO L280 TraceCheckUtils]: 1: Hoare triple {2530#(= |id_#in~x| id_~x)} assume 0 == ~x; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,382 INFO L280 TraceCheckUtils]: 2: Hoare triple {2688#(= 0 |id_#in~x|)} #res := 0; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,382 INFO L280 TraceCheckUtils]: 3: Hoare triple {2688#(= 0 |id_#in~x|)} assume true; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,383 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2688#(= 0 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,384 INFO L280 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,385 INFO L263 TraceCheckUtils]: 2: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,385 INFO L280 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,386 INFO L280 TraceCheckUtils]: 4: Hoare triple {2530#(= |id_#in~x| id_~x)} assume 0 == ~x; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,387 INFO L280 TraceCheckUtils]: 5: Hoare triple {2688#(= 0 |id_#in~x|)} #res := 0; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,387 INFO L280 TraceCheckUtils]: 6: Hoare triple {2688#(= 0 |id_#in~x|)} assume true; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,388 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2688#(= 0 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,389 INFO L280 TraceCheckUtils]: 8: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,389 INFO L280 TraceCheckUtils]: 9: Hoare triple {2687#(<= 1 |id2_#in~x|)} #res := 1 + #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,390 INFO L280 TraceCheckUtils]: 10: Hoare triple {2687#(<= 1 |id2_#in~x|)} havoc #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,391 INFO L280 TraceCheckUtils]: 11: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume true; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,392 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2687#(<= 1 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,393 INFO L280 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {2530#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,393 INFO L263 TraceCheckUtils]: 2: Hoare triple {2530#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,394 INFO L280 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,395 INFO L263 TraceCheckUtils]: 5: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,395 INFO L280 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,396 INFO L280 TraceCheckUtils]: 7: Hoare triple {2530#(= |id_#in~x| id_~x)} assume 0 == ~x; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,396 INFO L280 TraceCheckUtils]: 8: Hoare triple {2688#(= 0 |id_#in~x|)} #res := 0; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,397 INFO L280 TraceCheckUtils]: 9: Hoare triple {2688#(= 0 |id_#in~x|)} assume true; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,398 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2688#(= 0 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,398 INFO L280 TraceCheckUtils]: 11: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,399 INFO L280 TraceCheckUtils]: 12: Hoare triple {2687#(<= 1 |id2_#in~x|)} #res := 1 + #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,400 INFO L280 TraceCheckUtils]: 13: Hoare triple {2687#(<= 1 |id2_#in~x|)} havoc #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,400 INFO L280 TraceCheckUtils]: 14: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume true; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,402 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2687#(<= 1 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,402 INFO L280 TraceCheckUtils]: 16: Hoare triple {2681#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,403 INFO L280 TraceCheckUtils]: 17: Hoare triple {2681#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,403 INFO L280 TraceCheckUtils]: 18: Hoare triple {2681#(<= 2 |id_#in~x|)} havoc #t~ret0; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,404 INFO L280 TraceCheckUtils]: 19: Hoare triple {2681#(<= 2 |id_#in~x|)} assume true; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,405 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2681#(<= 2 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,408 INFO L263 TraceCheckUtils]: 2: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,408 INFO L280 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,409 INFO L280 TraceCheckUtils]: 4: Hoare triple {2530#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,409 INFO L263 TraceCheckUtils]: 5: Hoare triple {2530#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,410 INFO L280 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,416 INFO L280 TraceCheckUtils]: 7: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,416 INFO L263 TraceCheckUtils]: 8: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,417 INFO L280 TraceCheckUtils]: 9: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,417 INFO L280 TraceCheckUtils]: 10: Hoare triple {2530#(= |id_#in~x| id_~x)} assume 0 == ~x; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,418 INFO L280 TraceCheckUtils]: 11: Hoare triple {2688#(= 0 |id_#in~x|)} #res := 0; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,418 INFO L280 TraceCheckUtils]: 12: Hoare triple {2688#(= 0 |id_#in~x|)} assume true; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,435 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2688#(= 0 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,436 INFO L280 TraceCheckUtils]: 14: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,437 INFO L280 TraceCheckUtils]: 15: Hoare triple {2687#(<= 1 |id2_#in~x|)} #res := 1 + #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,437 INFO L280 TraceCheckUtils]: 16: Hoare triple {2687#(<= 1 |id2_#in~x|)} havoc #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,438 INFO L280 TraceCheckUtils]: 17: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume true; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,439 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2687#(<= 1 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,440 INFO L280 TraceCheckUtils]: 19: Hoare triple {2681#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,441 INFO L280 TraceCheckUtils]: 20: Hoare triple {2681#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,441 INFO L280 TraceCheckUtils]: 21: Hoare triple {2681#(<= 2 |id_#in~x|)} havoc #t~ret0; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,442 INFO L280 TraceCheckUtils]: 22: Hoare triple {2681#(<= 2 |id_#in~x|)} assume true; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,443 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2681#(<= 2 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,444 INFO L280 TraceCheckUtils]: 24: Hoare triple {2667#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,444 INFO L280 TraceCheckUtils]: 25: Hoare triple {2667#(<= 3 |id2_#in~x|)} #res := 1 + #t~ret1; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,445 INFO L280 TraceCheckUtils]: 26: Hoare triple {2667#(<= 3 |id2_#in~x|)} havoc #t~ret1; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,446 INFO L280 TraceCheckUtils]: 27: Hoare triple {2667#(<= 3 |id2_#in~x|)} assume true; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,447 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2667#(<= 3 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,449 INFO L280 TraceCheckUtils]: 1: Hoare triple {2530#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,449 INFO L263 TraceCheckUtils]: 2: Hoare triple {2530#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,450 INFO L280 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,450 INFO L280 TraceCheckUtils]: 4: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,450 INFO L263 TraceCheckUtils]: 5: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,451 INFO L280 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,451 INFO L280 TraceCheckUtils]: 7: Hoare triple {2530#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,452 INFO L263 TraceCheckUtils]: 8: Hoare triple {2530#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,452 INFO L280 TraceCheckUtils]: 9: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,453 INFO L280 TraceCheckUtils]: 10: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,453 INFO L263 TraceCheckUtils]: 11: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,453 INFO L280 TraceCheckUtils]: 12: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,454 INFO L280 TraceCheckUtils]: 13: Hoare triple {2530#(= |id_#in~x| id_~x)} assume 0 == ~x; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,455 INFO L280 TraceCheckUtils]: 14: Hoare triple {2688#(= 0 |id_#in~x|)} #res := 0; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,455 INFO L280 TraceCheckUtils]: 15: Hoare triple {2688#(= 0 |id_#in~x|)} assume true; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,456 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2688#(= 0 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,457 INFO L280 TraceCheckUtils]: 17: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,457 INFO L280 TraceCheckUtils]: 18: Hoare triple {2687#(<= 1 |id2_#in~x|)} #res := 1 + #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,458 INFO L280 TraceCheckUtils]: 19: Hoare triple {2687#(<= 1 |id2_#in~x|)} havoc #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,458 INFO L280 TraceCheckUtils]: 20: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume true; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,459 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2687#(<= 1 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,460 INFO L280 TraceCheckUtils]: 22: Hoare triple {2681#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,461 INFO L280 TraceCheckUtils]: 23: Hoare triple {2681#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,461 INFO L280 TraceCheckUtils]: 24: Hoare triple {2681#(<= 2 |id_#in~x|)} havoc #t~ret0; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,462 INFO L280 TraceCheckUtils]: 25: Hoare triple {2681#(<= 2 |id_#in~x|)} assume true; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,463 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2681#(<= 2 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,463 INFO L280 TraceCheckUtils]: 27: Hoare triple {2667#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,464 INFO L280 TraceCheckUtils]: 28: Hoare triple {2667#(<= 3 |id2_#in~x|)} #res := 1 + #t~ret1; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,464 INFO L280 TraceCheckUtils]: 29: Hoare triple {2667#(<= 3 |id2_#in~x|)} havoc #t~ret1; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,465 INFO L280 TraceCheckUtils]: 30: Hoare triple {2667#(<= 3 |id2_#in~x|)} assume true; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,466 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2667#(<= 3 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,467 INFO L280 TraceCheckUtils]: 32: Hoare triple {2645#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,467 INFO L280 TraceCheckUtils]: 33: Hoare triple {2645#(<= 4 |id_#in~x|)} #res := 1 + #t~ret0; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,468 INFO L280 TraceCheckUtils]: 34: Hoare triple {2645#(<= 4 |id_#in~x|)} havoc #t~ret0; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,468 INFO L280 TraceCheckUtils]: 35: Hoare triple {2645#(<= 4 |id_#in~x|)} assume true; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,469 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2645#(<= 4 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,471 INFO L280 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,472 INFO L280 TraceCheckUtils]: 1: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,472 INFO L263 TraceCheckUtils]: 2: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,472 INFO L280 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,473 INFO L280 TraceCheckUtils]: 4: Hoare triple {2530#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,473 INFO L263 TraceCheckUtils]: 5: Hoare triple {2530#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,474 INFO L280 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,474 INFO L280 TraceCheckUtils]: 7: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,474 INFO L263 TraceCheckUtils]: 8: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,475 INFO L280 TraceCheckUtils]: 9: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,476 INFO L280 TraceCheckUtils]: 10: Hoare triple {2530#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,476 INFO L263 TraceCheckUtils]: 11: Hoare triple {2530#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,476 INFO L280 TraceCheckUtils]: 12: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,477 INFO L280 TraceCheckUtils]: 13: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,477 INFO L263 TraceCheckUtils]: 14: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,478 INFO L280 TraceCheckUtils]: 15: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,478 INFO L280 TraceCheckUtils]: 16: Hoare triple {2530#(= |id_#in~x| id_~x)} assume 0 == ~x; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,479 INFO L280 TraceCheckUtils]: 17: Hoare triple {2688#(= 0 |id_#in~x|)} #res := 0; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,479 INFO L280 TraceCheckUtils]: 18: Hoare triple {2688#(= 0 |id_#in~x|)} assume true; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,480 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2688#(= 0 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,481 INFO L280 TraceCheckUtils]: 20: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,482 INFO L280 TraceCheckUtils]: 21: Hoare triple {2687#(<= 1 |id2_#in~x|)} #res := 1 + #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,482 INFO L280 TraceCheckUtils]: 22: Hoare triple {2687#(<= 1 |id2_#in~x|)} havoc #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,483 INFO L280 TraceCheckUtils]: 23: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume true; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,484 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2687#(<= 1 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,485 INFO L280 TraceCheckUtils]: 25: Hoare triple {2681#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,485 INFO L280 TraceCheckUtils]: 26: Hoare triple {2681#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,486 INFO L280 TraceCheckUtils]: 27: Hoare triple {2681#(<= 2 |id_#in~x|)} havoc #t~ret0; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,486 INFO L280 TraceCheckUtils]: 28: Hoare triple {2681#(<= 2 |id_#in~x|)} assume true; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,487 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2681#(<= 2 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,488 INFO L280 TraceCheckUtils]: 30: Hoare triple {2667#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,489 INFO L280 TraceCheckUtils]: 31: Hoare triple {2667#(<= 3 |id2_#in~x|)} #res := 1 + #t~ret1; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,489 INFO L280 TraceCheckUtils]: 32: Hoare triple {2667#(<= 3 |id2_#in~x|)} havoc #t~ret1; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,490 INFO L280 TraceCheckUtils]: 33: Hoare triple {2667#(<= 3 |id2_#in~x|)} assume true; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,491 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2667#(<= 3 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,492 INFO L280 TraceCheckUtils]: 35: Hoare triple {2645#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,492 INFO L280 TraceCheckUtils]: 36: Hoare triple {2645#(<= 4 |id_#in~x|)} #res := 1 + #t~ret0; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,493 INFO L280 TraceCheckUtils]: 37: Hoare triple {2645#(<= 4 |id_#in~x|)} havoc #t~ret0; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,494 INFO L280 TraceCheckUtils]: 38: Hoare triple {2645#(<= 4 |id_#in~x|)} assume true; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,495 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2645#(<= 4 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,495 INFO L280 TraceCheckUtils]: 40: Hoare triple {2615#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,496 INFO L280 TraceCheckUtils]: 41: Hoare triple {2615#(<= 5 |id2_#in~x|)} #res := 1 + #t~ret1; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,496 INFO L280 TraceCheckUtils]: 42: Hoare triple {2615#(<= 5 |id2_#in~x|)} havoc #t~ret1; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,497 INFO L280 TraceCheckUtils]: 43: Hoare triple {2615#(<= 5 |id2_#in~x|)} assume true; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,498 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2615#(<= 5 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2576#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:51:32,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {2530#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,501 INFO L263 TraceCheckUtils]: 2: Hoare triple {2530#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,501 INFO L280 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,502 INFO L263 TraceCheckUtils]: 5: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,503 INFO L280 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,503 INFO L280 TraceCheckUtils]: 7: Hoare triple {2530#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,504 INFO L263 TraceCheckUtils]: 8: Hoare triple {2530#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,504 INFO L280 TraceCheckUtils]: 9: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,505 INFO L280 TraceCheckUtils]: 10: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,506 INFO L263 TraceCheckUtils]: 11: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,506 INFO L280 TraceCheckUtils]: 12: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,507 INFO L280 TraceCheckUtils]: 13: Hoare triple {2530#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,507 INFO L263 TraceCheckUtils]: 14: Hoare triple {2530#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,507 INFO L280 TraceCheckUtils]: 15: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,508 INFO L280 TraceCheckUtils]: 16: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,508 INFO L263 TraceCheckUtils]: 17: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,509 INFO L280 TraceCheckUtils]: 18: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,509 INFO L280 TraceCheckUtils]: 19: Hoare triple {2530#(= |id_#in~x| id_~x)} assume 0 == ~x; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,510 INFO L280 TraceCheckUtils]: 20: Hoare triple {2688#(= 0 |id_#in~x|)} #res := 0; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,510 INFO L280 TraceCheckUtils]: 21: Hoare triple {2688#(= 0 |id_#in~x|)} assume true; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,511 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2688#(= 0 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,512 INFO L280 TraceCheckUtils]: 23: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,512 INFO L280 TraceCheckUtils]: 24: Hoare triple {2687#(<= 1 |id2_#in~x|)} #res := 1 + #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,513 INFO L280 TraceCheckUtils]: 25: Hoare triple {2687#(<= 1 |id2_#in~x|)} havoc #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,513 INFO L280 TraceCheckUtils]: 26: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume true; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,514 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2687#(<= 1 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,515 INFO L280 TraceCheckUtils]: 28: Hoare triple {2681#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,515 INFO L280 TraceCheckUtils]: 29: Hoare triple {2681#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,516 INFO L280 TraceCheckUtils]: 30: Hoare triple {2681#(<= 2 |id_#in~x|)} havoc #t~ret0; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,516 INFO L280 TraceCheckUtils]: 31: Hoare triple {2681#(<= 2 |id_#in~x|)} assume true; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,517 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2681#(<= 2 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,518 INFO L280 TraceCheckUtils]: 33: Hoare triple {2667#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,518 INFO L280 TraceCheckUtils]: 34: Hoare triple {2667#(<= 3 |id2_#in~x|)} #res := 1 + #t~ret1; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,519 INFO L280 TraceCheckUtils]: 35: Hoare triple {2667#(<= 3 |id2_#in~x|)} havoc #t~ret1; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,519 INFO L280 TraceCheckUtils]: 36: Hoare triple {2667#(<= 3 |id2_#in~x|)} assume true; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,520 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2667#(<= 3 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,521 INFO L280 TraceCheckUtils]: 38: Hoare triple {2645#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,522 INFO L280 TraceCheckUtils]: 39: Hoare triple {2645#(<= 4 |id_#in~x|)} #res := 1 + #t~ret0; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,522 INFO L280 TraceCheckUtils]: 40: Hoare triple {2645#(<= 4 |id_#in~x|)} havoc #t~ret0; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,523 INFO L280 TraceCheckUtils]: 41: Hoare triple {2645#(<= 4 |id_#in~x|)} assume true; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,524 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2645#(<= 4 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,524 INFO L280 TraceCheckUtils]: 43: Hoare triple {2615#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,525 INFO L280 TraceCheckUtils]: 44: Hoare triple {2615#(<= 5 |id2_#in~x|)} #res := 1 + #t~ret1; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,525 INFO L280 TraceCheckUtils]: 45: Hoare triple {2615#(<= 5 |id2_#in~x|)} havoc #t~ret1; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,526 INFO L280 TraceCheckUtils]: 46: Hoare triple {2615#(<= 5 |id2_#in~x|)} assume true; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,527 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2615#(<= 5 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2576#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:51:32,528 INFO L280 TraceCheckUtils]: 48: Hoare triple {2576#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2576#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:51:32,528 INFO L280 TraceCheckUtils]: 49: Hoare triple {2576#(<= 6 |id_#in~x|)} #res := 1 + #t~ret0; {2576#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:51:32,529 INFO L280 TraceCheckUtils]: 50: Hoare triple {2576#(<= 6 |id_#in~x|)} havoc #t~ret0; {2576#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:51:32,529 INFO L280 TraceCheckUtils]: 51: Hoare triple {2576#(<= 6 |id_#in~x|)} assume true; {2576#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:51:32,530 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2576#(<= 6 |id_#in~x|)} {2476#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #48#return; {2473#false} is VALID [2020-07-11 00:51:32,533 INFO L263 TraceCheckUtils]: 0: Hoare triple {2472#true} call ULTIMATE.init(); {2472#true} is VALID [2020-07-11 00:51:32,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {2472#true} assume true; {2472#true} is VALID [2020-07-11 00:51:32,533 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2472#true} {2472#true} #44#return; {2472#true} is VALID [2020-07-11 00:51:32,533 INFO L263 TraceCheckUtils]: 3: Hoare triple {2472#true} call #t~ret3 := main(); {2472#true} is VALID [2020-07-11 00:51:32,534 INFO L280 TraceCheckUtils]: 4: Hoare triple {2472#true} ~input~0 := 5; {2476#(and (<= main_~input~0 5) (<= 5 main_~input~0))} is VALID [2020-07-11 00:51:32,534 INFO L263 TraceCheckUtils]: 5: Hoare triple {2476#(and (<= main_~input~0 5) (<= 5 main_~input~0))} call #t~ret2 := id(~input~0); {2472#true} is VALID [2020-07-11 00:51:32,535 INFO L280 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,535 INFO L280 TraceCheckUtils]: 7: Hoare triple {2530#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,535 INFO L263 TraceCheckUtils]: 8: Hoare triple {2530#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,536 INFO L280 TraceCheckUtils]: 9: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,536 INFO L280 TraceCheckUtils]: 10: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,536 INFO L263 TraceCheckUtils]: 11: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,537 INFO L280 TraceCheckUtils]: 12: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,537 INFO L280 TraceCheckUtils]: 13: Hoare triple {2530#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,538 INFO L263 TraceCheckUtils]: 14: Hoare triple {2530#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,538 INFO L280 TraceCheckUtils]: 15: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,539 INFO L280 TraceCheckUtils]: 16: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,539 INFO L263 TraceCheckUtils]: 17: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,539 INFO L280 TraceCheckUtils]: 18: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,540 INFO L280 TraceCheckUtils]: 19: Hoare triple {2530#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,540 INFO L263 TraceCheckUtils]: 20: Hoare triple {2530#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,541 INFO L280 TraceCheckUtils]: 21: Hoare triple {2472#true} ~x := #in~x; {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,541 INFO L280 TraceCheckUtils]: 22: Hoare triple {2577#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2577#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:32,541 INFO L263 TraceCheckUtils]: 23: Hoare triple {2577#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2472#true} is VALID [2020-07-11 00:51:32,542 INFO L280 TraceCheckUtils]: 24: Hoare triple {2472#true} ~x := #in~x; {2530#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:32,542 INFO L280 TraceCheckUtils]: 25: Hoare triple {2530#(= |id_#in~x| id_~x)} assume 0 == ~x; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,543 INFO L280 TraceCheckUtils]: 26: Hoare triple {2688#(= 0 |id_#in~x|)} #res := 0; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,543 INFO L280 TraceCheckUtils]: 27: Hoare triple {2688#(= 0 |id_#in~x|)} assume true; {2688#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:51:32,544 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2688#(= 0 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,545 INFO L280 TraceCheckUtils]: 29: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,545 INFO L280 TraceCheckUtils]: 30: Hoare triple {2687#(<= 1 |id2_#in~x|)} #res := 1 + #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,546 INFO L280 TraceCheckUtils]: 31: Hoare triple {2687#(<= 1 |id2_#in~x|)} havoc #t~ret1; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,546 INFO L280 TraceCheckUtils]: 32: Hoare triple {2687#(<= 1 |id2_#in~x|)} assume true; {2687#(<= 1 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,547 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2687#(<= 1 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,548 INFO L280 TraceCheckUtils]: 34: Hoare triple {2681#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,548 INFO L280 TraceCheckUtils]: 35: Hoare triple {2681#(<= 2 |id_#in~x|)} #res := 1 + #t~ret0; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,549 INFO L280 TraceCheckUtils]: 36: Hoare triple {2681#(<= 2 |id_#in~x|)} havoc #t~ret0; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,549 INFO L280 TraceCheckUtils]: 37: Hoare triple {2681#(<= 2 |id_#in~x|)} assume true; {2681#(<= 2 |id_#in~x|)} is VALID [2020-07-11 00:51:32,550 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2681#(<= 2 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,551 INFO L280 TraceCheckUtils]: 39: Hoare triple {2667#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,551 INFO L280 TraceCheckUtils]: 40: Hoare triple {2667#(<= 3 |id2_#in~x|)} #res := 1 + #t~ret1; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,552 INFO L280 TraceCheckUtils]: 41: Hoare triple {2667#(<= 3 |id2_#in~x|)} havoc #t~ret1; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,552 INFO L280 TraceCheckUtils]: 42: Hoare triple {2667#(<= 3 |id2_#in~x|)} assume true; {2667#(<= 3 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,553 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2667#(<= 3 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,554 INFO L280 TraceCheckUtils]: 44: Hoare triple {2645#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,554 INFO L280 TraceCheckUtils]: 45: Hoare triple {2645#(<= 4 |id_#in~x|)} #res := 1 + #t~ret0; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,555 INFO L280 TraceCheckUtils]: 46: Hoare triple {2645#(<= 4 |id_#in~x|)} havoc #t~ret0; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,555 INFO L280 TraceCheckUtils]: 47: Hoare triple {2645#(<= 4 |id_#in~x|)} assume true; {2645#(<= 4 |id_#in~x|)} is VALID [2020-07-11 00:51:32,557 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2645#(<= 4 |id_#in~x|)} {2577#(= id2_~x |id2_#in~x|)} #42#return; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,557 INFO L280 TraceCheckUtils]: 49: Hoare triple {2615#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,558 INFO L280 TraceCheckUtils]: 50: Hoare triple {2615#(<= 5 |id2_#in~x|)} #res := 1 + #t~ret1; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,558 INFO L280 TraceCheckUtils]: 51: Hoare triple {2615#(<= 5 |id2_#in~x|)} havoc #t~ret1; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,559 INFO L280 TraceCheckUtils]: 52: Hoare triple {2615#(<= 5 |id2_#in~x|)} assume true; {2615#(<= 5 |id2_#in~x|)} is VALID [2020-07-11 00:51:32,560 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2615#(<= 5 |id2_#in~x|)} {2530#(= |id_#in~x| id_~x)} #50#return; {2576#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:51:32,560 INFO L280 TraceCheckUtils]: 54: Hoare triple {2576#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2576#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:51:32,561 INFO L280 TraceCheckUtils]: 55: Hoare triple {2576#(<= 6 |id_#in~x|)} #res := 1 + #t~ret0; {2576#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:51:32,561 INFO L280 TraceCheckUtils]: 56: Hoare triple {2576#(<= 6 |id_#in~x|)} havoc #t~ret0; {2576#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:51:32,562 INFO L280 TraceCheckUtils]: 57: Hoare triple {2576#(<= 6 |id_#in~x|)} assume true; {2576#(<= 6 |id_#in~x|)} is VALID [2020-07-11 00:51:32,563 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2576#(<= 6 |id_#in~x|)} {2476#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #48#return; {2473#false} is VALID [2020-07-11 00:51:32,563 INFO L280 TraceCheckUtils]: 59: Hoare triple {2473#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2473#false} is VALID [2020-07-11 00:51:32,563 INFO L280 TraceCheckUtils]: 60: Hoare triple {2473#false} ~result~0 := #t~ret2; {2473#false} is VALID [2020-07-11 00:51:32,563 INFO L280 TraceCheckUtils]: 61: Hoare triple {2473#false} havoc #t~ret2; {2473#false} is VALID [2020-07-11 00:51:32,563 INFO L280 TraceCheckUtils]: 62: Hoare triple {2473#false} assume 5 != ~result~0; {2473#false} is VALID [2020-07-11 00:51:32,563 INFO L280 TraceCheckUtils]: 63: Hoare triple {2473#false} assume !false; {2473#false} is VALID [2020-07-11 00:51:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-11 00:51:32,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1591357880] [2020-07-11 00:51:32,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:32,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-11 00:51:32,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847446025] [2020-07-11 00:51:32,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2020-07-11 00:51:32,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:32,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 00:51:32,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:32,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 00:51:32,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:32,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 00:51:32,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-07-11 00:51:32,623 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 12 states. [2020-07-11 00:51:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:33,947 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2020-07-11 00:51:33,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-11 00:51:33,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2020-07-11 00:51:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 00:51:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 112 transitions. [2020-07-11 00:51:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 00:51:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 112 transitions. [2020-07-11 00:51:33,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 112 transitions. [2020-07-11 00:51:34,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:34,097 INFO L225 Difference]: With dead ends: 156 [2020-07-11 00:51:34,098 INFO L226 Difference]: Without dead ends: 98 [2020-07-11 00:51:34,099 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-07-11 00:51:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-11 00:51:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2020-07-11 00:51:34,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:34,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 68 states. [2020-07-11 00:51:34,255 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 68 states. [2020-07-11 00:51:34,256 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 68 states. [2020-07-11 00:51:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:34,261 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2020-07-11 00:51:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2020-07-11 00:51:34,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:34,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:34,262 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 98 states. [2020-07-11 00:51:34,262 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 98 states. [2020-07-11 00:51:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:34,267 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2020-07-11 00:51:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2020-07-11 00:51:34,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:34,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:34,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:34,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-11 00:51:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-07-11 00:51:34,270 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 64 [2020-07-11 00:51:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:34,271 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-07-11 00:51:34,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 00:51:34,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 69 transitions. [2020-07-11 00:51:34,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-07-11 00:51:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-11 00:51:34,383 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:34,383 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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:51:34,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 00:51:34,384 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:34,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1686185158, now seen corresponding path program 3 times [2020-07-11 00:51:34,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:34,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2126019764] [2020-07-11 00:51:34,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:34,421 INFO L280 TraceCheckUtils]: 0: Hoare triple {3349#true} assume true; {3349#true} is VALID [2020-07-11 00:51:34,421 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3349#true} {3349#true} #44#return; {3349#true} is VALID [2020-07-11 00:51:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:34,661 INFO L280 TraceCheckUtils]: 0: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,662 INFO L280 TraceCheckUtils]: 2: Hoare triple {3627#(= 0 |id2_#in~x|)} #res := 0; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,663 INFO L280 TraceCheckUtils]: 3: Hoare triple {3627#(= 0 |id2_#in~x|)} assume true; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,664 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3627#(= 0 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,665 INFO L280 TraceCheckUtils]: 1: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,665 INFO L263 TraceCheckUtils]: 2: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,666 INFO L280 TraceCheckUtils]: 3: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,666 INFO L280 TraceCheckUtils]: 4: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,667 INFO L280 TraceCheckUtils]: 5: Hoare triple {3627#(= 0 |id2_#in~x|)} #res := 0; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,667 INFO L280 TraceCheckUtils]: 6: Hoare triple {3627#(= 0 |id2_#in~x|)} assume true; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,668 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {3627#(= 0 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,669 INFO L280 TraceCheckUtils]: 8: Hoare triple {3626#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,669 INFO L280 TraceCheckUtils]: 9: Hoare triple {3626#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,670 INFO L280 TraceCheckUtils]: 10: Hoare triple {3626#(<= 1 |id_#in~x|)} havoc #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,670 INFO L280 TraceCheckUtils]: 11: Hoare triple {3626#(<= 1 |id_#in~x|)} assume true; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,672 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {3626#(<= 1 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,672 INFO L280 TraceCheckUtils]: 0: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,673 INFO L263 TraceCheckUtils]: 2: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,674 INFO L280 TraceCheckUtils]: 3: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,674 INFO L280 TraceCheckUtils]: 4: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,675 INFO L263 TraceCheckUtils]: 5: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,675 INFO L280 TraceCheckUtils]: 6: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,676 INFO L280 TraceCheckUtils]: 7: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,676 INFO L280 TraceCheckUtils]: 8: Hoare triple {3627#(= 0 |id2_#in~x|)} #res := 0; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,677 INFO L280 TraceCheckUtils]: 9: Hoare triple {3627#(= 0 |id2_#in~x|)} assume true; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,678 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3627#(= 0 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,678 INFO L280 TraceCheckUtils]: 11: Hoare triple {3626#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,679 INFO L280 TraceCheckUtils]: 12: Hoare triple {3626#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,679 INFO L280 TraceCheckUtils]: 13: Hoare triple {3626#(<= 1 |id_#in~x|)} havoc #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,680 INFO L280 TraceCheckUtils]: 14: Hoare triple {3626#(<= 1 |id_#in~x|)} assume true; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,681 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3626#(<= 1 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,681 INFO L280 TraceCheckUtils]: 16: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,682 INFO L280 TraceCheckUtils]: 17: Hoare triple {3620#(<= 2 |id2_#in~x|)} #res := 1 + #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,682 INFO L280 TraceCheckUtils]: 18: Hoare triple {3620#(<= 2 |id2_#in~x|)} havoc #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,683 INFO L280 TraceCheckUtils]: 19: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume true; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,684 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3620#(<= 2 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,685 INFO L280 TraceCheckUtils]: 0: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,685 INFO L263 TraceCheckUtils]: 2: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,686 INFO L280 TraceCheckUtils]: 3: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,687 INFO L263 TraceCheckUtils]: 5: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,687 INFO L280 TraceCheckUtils]: 6: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,688 INFO L280 TraceCheckUtils]: 7: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,688 INFO L263 TraceCheckUtils]: 8: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,688 INFO L280 TraceCheckUtils]: 9: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,689 INFO L280 TraceCheckUtils]: 10: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,689 INFO L280 TraceCheckUtils]: 11: Hoare triple {3627#(= 0 |id2_#in~x|)} #res := 0; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,690 INFO L280 TraceCheckUtils]: 12: Hoare triple {3627#(= 0 |id2_#in~x|)} assume true; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,691 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3627#(= 0 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,691 INFO L280 TraceCheckUtils]: 14: Hoare triple {3626#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,692 INFO L280 TraceCheckUtils]: 15: Hoare triple {3626#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,692 INFO L280 TraceCheckUtils]: 16: Hoare triple {3626#(<= 1 |id_#in~x|)} havoc #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,693 INFO L280 TraceCheckUtils]: 17: Hoare triple {3626#(<= 1 |id_#in~x|)} assume true; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,694 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {3626#(<= 1 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,695 INFO L280 TraceCheckUtils]: 19: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,695 INFO L280 TraceCheckUtils]: 20: Hoare triple {3620#(<= 2 |id2_#in~x|)} #res := 1 + #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,696 INFO L280 TraceCheckUtils]: 21: Hoare triple {3620#(<= 2 |id2_#in~x|)} havoc #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,696 INFO L280 TraceCheckUtils]: 22: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume true; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,697 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {3620#(<= 2 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,698 INFO L280 TraceCheckUtils]: 24: Hoare triple {3606#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,698 INFO L280 TraceCheckUtils]: 25: Hoare triple {3606#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,699 INFO L280 TraceCheckUtils]: 26: Hoare triple {3606#(<= 3 |id_#in~x|)} havoc #t~ret0; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,699 INFO L280 TraceCheckUtils]: 27: Hoare triple {3606#(<= 3 |id_#in~x|)} assume true; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,700 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3606#(<= 3 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,701 INFO L280 TraceCheckUtils]: 0: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,702 INFO L263 TraceCheckUtils]: 2: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,703 INFO L280 TraceCheckUtils]: 4: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,704 INFO L263 TraceCheckUtils]: 5: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,704 INFO L280 TraceCheckUtils]: 6: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,705 INFO L280 TraceCheckUtils]: 7: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,705 INFO L263 TraceCheckUtils]: 8: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,706 INFO L280 TraceCheckUtils]: 9: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,707 INFO L280 TraceCheckUtils]: 10: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,707 INFO L263 TraceCheckUtils]: 11: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,707 INFO L280 TraceCheckUtils]: 12: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,708 INFO L280 TraceCheckUtils]: 13: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,709 INFO L280 TraceCheckUtils]: 14: Hoare triple {3627#(= 0 |id2_#in~x|)} #res := 0; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,710 INFO L280 TraceCheckUtils]: 15: Hoare triple {3627#(= 0 |id2_#in~x|)} assume true; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,711 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3627#(= 0 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,711 INFO L280 TraceCheckUtils]: 17: Hoare triple {3626#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,712 INFO L280 TraceCheckUtils]: 18: Hoare triple {3626#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,712 INFO L280 TraceCheckUtils]: 19: Hoare triple {3626#(<= 1 |id_#in~x|)} havoc #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,713 INFO L280 TraceCheckUtils]: 20: Hoare triple {3626#(<= 1 |id_#in~x|)} assume true; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,714 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3626#(<= 1 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,715 INFO L280 TraceCheckUtils]: 22: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,715 INFO L280 TraceCheckUtils]: 23: Hoare triple {3620#(<= 2 |id2_#in~x|)} #res := 1 + #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,716 INFO L280 TraceCheckUtils]: 24: Hoare triple {3620#(<= 2 |id2_#in~x|)} havoc #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,716 INFO L280 TraceCheckUtils]: 25: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume true; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,717 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3620#(<= 2 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,718 INFO L280 TraceCheckUtils]: 27: Hoare triple {3606#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,718 INFO L280 TraceCheckUtils]: 28: Hoare triple {3606#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,719 INFO L280 TraceCheckUtils]: 29: Hoare triple {3606#(<= 3 |id_#in~x|)} havoc #t~ret0; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,719 INFO L280 TraceCheckUtils]: 30: Hoare triple {3606#(<= 3 |id_#in~x|)} assume true; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,720 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {3606#(<= 3 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,721 INFO L280 TraceCheckUtils]: 32: Hoare triple {3584#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,721 INFO L280 TraceCheckUtils]: 33: Hoare triple {3584#(<= 4 |id2_#in~x|)} #res := 1 + #t~ret1; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,722 INFO L280 TraceCheckUtils]: 34: Hoare triple {3584#(<= 4 |id2_#in~x|)} havoc #t~ret1; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,722 INFO L280 TraceCheckUtils]: 35: Hoare triple {3584#(<= 4 |id2_#in~x|)} assume true; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,723 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3584#(<= 4 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,727 INFO L280 TraceCheckUtils]: 0: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,727 INFO L263 TraceCheckUtils]: 2: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,728 INFO L280 TraceCheckUtils]: 3: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,728 INFO L280 TraceCheckUtils]: 4: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,729 INFO L263 TraceCheckUtils]: 5: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,729 INFO L280 TraceCheckUtils]: 6: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,730 INFO L280 TraceCheckUtils]: 7: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,730 INFO L263 TraceCheckUtils]: 8: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,731 INFO L280 TraceCheckUtils]: 9: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,731 INFO L280 TraceCheckUtils]: 10: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,731 INFO L263 TraceCheckUtils]: 11: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,732 INFO L280 TraceCheckUtils]: 12: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,732 INFO L280 TraceCheckUtils]: 13: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,733 INFO L263 TraceCheckUtils]: 14: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,733 INFO L280 TraceCheckUtils]: 15: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,734 INFO L280 TraceCheckUtils]: 16: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,734 INFO L280 TraceCheckUtils]: 17: Hoare triple {3627#(= 0 |id2_#in~x|)} #res := 0; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,735 INFO L280 TraceCheckUtils]: 18: Hoare triple {3627#(= 0 |id2_#in~x|)} assume true; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,736 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {3627#(= 0 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,736 INFO L280 TraceCheckUtils]: 20: Hoare triple {3626#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,737 INFO L280 TraceCheckUtils]: 21: Hoare triple {3626#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,737 INFO L280 TraceCheckUtils]: 22: Hoare triple {3626#(<= 1 |id_#in~x|)} havoc #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,738 INFO L280 TraceCheckUtils]: 23: Hoare triple {3626#(<= 1 |id_#in~x|)} assume true; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,739 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3626#(<= 1 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,740 INFO L280 TraceCheckUtils]: 25: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,740 INFO L280 TraceCheckUtils]: 26: Hoare triple {3620#(<= 2 |id2_#in~x|)} #res := 1 + #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,741 INFO L280 TraceCheckUtils]: 27: Hoare triple {3620#(<= 2 |id2_#in~x|)} havoc #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,741 INFO L280 TraceCheckUtils]: 28: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume true; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,742 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {3620#(<= 2 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,743 INFO L280 TraceCheckUtils]: 30: Hoare triple {3606#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,743 INFO L280 TraceCheckUtils]: 31: Hoare triple {3606#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,744 INFO L280 TraceCheckUtils]: 32: Hoare triple {3606#(<= 3 |id_#in~x|)} havoc #t~ret0; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,744 INFO L280 TraceCheckUtils]: 33: Hoare triple {3606#(<= 3 |id_#in~x|)} assume true; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,745 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3606#(<= 3 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,746 INFO L280 TraceCheckUtils]: 35: Hoare triple {3584#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,746 INFO L280 TraceCheckUtils]: 36: Hoare triple {3584#(<= 4 |id2_#in~x|)} #res := 1 + #t~ret1; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,747 INFO L280 TraceCheckUtils]: 37: Hoare triple {3584#(<= 4 |id2_#in~x|)} havoc #t~ret1; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,747 INFO L280 TraceCheckUtils]: 38: Hoare triple {3584#(<= 4 |id2_#in~x|)} assume true; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,748 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {3584#(<= 4 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,749 INFO L280 TraceCheckUtils]: 40: Hoare triple {3554#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,749 INFO L280 TraceCheckUtils]: 41: Hoare triple {3554#(<= 5 |id_#in~x|)} #res := 1 + #t~ret0; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,750 INFO L280 TraceCheckUtils]: 42: Hoare triple {3554#(<= 5 |id_#in~x|)} havoc #t~ret0; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,750 INFO L280 TraceCheckUtils]: 43: Hoare triple {3554#(<= 5 |id_#in~x|)} assume true; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,751 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3554#(<= 5 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,755 INFO L263 TraceCheckUtils]: 2: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,756 INFO L280 TraceCheckUtils]: 3: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,756 INFO L280 TraceCheckUtils]: 4: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,756 INFO L263 TraceCheckUtils]: 5: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,757 INFO L280 TraceCheckUtils]: 6: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,758 INFO L280 TraceCheckUtils]: 7: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,758 INFO L263 TraceCheckUtils]: 8: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,759 INFO L280 TraceCheckUtils]: 9: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,759 INFO L280 TraceCheckUtils]: 10: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,759 INFO L263 TraceCheckUtils]: 11: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,760 INFO L280 TraceCheckUtils]: 12: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,761 INFO L280 TraceCheckUtils]: 13: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,761 INFO L263 TraceCheckUtils]: 14: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,762 INFO L280 TraceCheckUtils]: 15: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,762 INFO L280 TraceCheckUtils]: 16: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,763 INFO L263 TraceCheckUtils]: 17: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,763 INFO L280 TraceCheckUtils]: 18: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,764 INFO L280 TraceCheckUtils]: 19: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,764 INFO L280 TraceCheckUtils]: 20: Hoare triple {3627#(= 0 |id2_#in~x|)} #res := 0; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,765 INFO L280 TraceCheckUtils]: 21: Hoare triple {3627#(= 0 |id2_#in~x|)} assume true; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,766 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3627#(= 0 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,766 INFO L280 TraceCheckUtils]: 23: Hoare triple {3626#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,767 INFO L280 TraceCheckUtils]: 24: Hoare triple {3626#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,767 INFO L280 TraceCheckUtils]: 25: Hoare triple {3626#(<= 1 |id_#in~x|)} havoc #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,768 INFO L280 TraceCheckUtils]: 26: Hoare triple {3626#(<= 1 |id_#in~x|)} assume true; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,769 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3626#(<= 1 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,769 INFO L280 TraceCheckUtils]: 28: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,771 INFO L280 TraceCheckUtils]: 29: Hoare triple {3620#(<= 2 |id2_#in~x|)} #res := 1 + #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,772 INFO L280 TraceCheckUtils]: 30: Hoare triple {3620#(<= 2 |id2_#in~x|)} havoc #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,772 INFO L280 TraceCheckUtils]: 31: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume true; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,773 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3620#(<= 2 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,774 INFO L280 TraceCheckUtils]: 33: Hoare triple {3606#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,774 INFO L280 TraceCheckUtils]: 34: Hoare triple {3606#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,775 INFO L280 TraceCheckUtils]: 35: Hoare triple {3606#(<= 3 |id_#in~x|)} havoc #t~ret0; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,775 INFO L280 TraceCheckUtils]: 36: Hoare triple {3606#(<= 3 |id_#in~x|)} assume true; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,776 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {3606#(<= 3 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,777 INFO L280 TraceCheckUtils]: 38: Hoare triple {3584#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,777 INFO L280 TraceCheckUtils]: 39: Hoare triple {3584#(<= 4 |id2_#in~x|)} #res := 1 + #t~ret1; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,778 INFO L280 TraceCheckUtils]: 40: Hoare triple {3584#(<= 4 |id2_#in~x|)} havoc #t~ret1; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,778 INFO L280 TraceCheckUtils]: 41: Hoare triple {3584#(<= 4 |id2_#in~x|)} assume true; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,779 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3584#(<= 4 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,780 INFO L280 TraceCheckUtils]: 43: Hoare triple {3554#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,780 INFO L280 TraceCheckUtils]: 44: Hoare triple {3554#(<= 5 |id_#in~x|)} #res := 1 + #t~ret0; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,781 INFO L280 TraceCheckUtils]: 45: Hoare triple {3554#(<= 5 |id_#in~x|)} havoc #t~ret0; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,781 INFO L280 TraceCheckUtils]: 46: Hoare triple {3554#(<= 5 |id_#in~x|)} assume true; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,782 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {3554#(<= 5 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,783 INFO L280 TraceCheckUtils]: 48: Hoare triple {3516#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,783 INFO L280 TraceCheckUtils]: 49: Hoare triple {3516#(<= 6 |id2_#in~x|)} #res := 1 + #t~ret1; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,784 INFO L280 TraceCheckUtils]: 50: Hoare triple {3516#(<= 6 |id2_#in~x|)} havoc #t~ret1; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,784 INFO L280 TraceCheckUtils]: 51: Hoare triple {3516#(<= 6 |id2_#in~x|)} assume true; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,785 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {3516#(<= 6 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3469#(<= 7 |id_#in~x|)} is VALID [2020-07-11 00:51:34,788 INFO L280 TraceCheckUtils]: 0: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,789 INFO L263 TraceCheckUtils]: 2: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,790 INFO L280 TraceCheckUtils]: 3: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,790 INFO L280 TraceCheckUtils]: 4: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,790 INFO L263 TraceCheckUtils]: 5: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,791 INFO L280 TraceCheckUtils]: 6: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,791 INFO L280 TraceCheckUtils]: 7: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,791 INFO L263 TraceCheckUtils]: 8: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,792 INFO L280 TraceCheckUtils]: 9: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,793 INFO L280 TraceCheckUtils]: 10: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,793 INFO L263 TraceCheckUtils]: 11: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,793 INFO L280 TraceCheckUtils]: 12: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,794 INFO L280 TraceCheckUtils]: 13: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,794 INFO L263 TraceCheckUtils]: 14: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,795 INFO L280 TraceCheckUtils]: 15: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,795 INFO L280 TraceCheckUtils]: 16: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,795 INFO L263 TraceCheckUtils]: 17: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,796 INFO L280 TraceCheckUtils]: 18: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,796 INFO L280 TraceCheckUtils]: 19: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,796 INFO L263 TraceCheckUtils]: 20: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,797 INFO L280 TraceCheckUtils]: 21: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,798 INFO L280 TraceCheckUtils]: 22: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,798 INFO L280 TraceCheckUtils]: 23: Hoare triple {3627#(= 0 |id2_#in~x|)} #res := 0; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,799 INFO L280 TraceCheckUtils]: 24: Hoare triple {3627#(= 0 |id2_#in~x|)} assume true; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,800 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3627#(= 0 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,800 INFO L280 TraceCheckUtils]: 26: Hoare triple {3626#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,801 INFO L280 TraceCheckUtils]: 27: Hoare triple {3626#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,801 INFO L280 TraceCheckUtils]: 28: Hoare triple {3626#(<= 1 |id_#in~x|)} havoc #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,802 INFO L280 TraceCheckUtils]: 29: Hoare triple {3626#(<= 1 |id_#in~x|)} assume true; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,804 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3626#(<= 1 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,804 INFO L280 TraceCheckUtils]: 31: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,805 INFO L280 TraceCheckUtils]: 32: Hoare triple {3620#(<= 2 |id2_#in~x|)} #res := 1 + #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,805 INFO L280 TraceCheckUtils]: 33: Hoare triple {3620#(<= 2 |id2_#in~x|)} havoc #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,806 INFO L280 TraceCheckUtils]: 34: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume true; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,807 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {3620#(<= 2 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,807 INFO L280 TraceCheckUtils]: 36: Hoare triple {3606#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,808 INFO L280 TraceCheckUtils]: 37: Hoare triple {3606#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,808 INFO L280 TraceCheckUtils]: 38: Hoare triple {3606#(<= 3 |id_#in~x|)} havoc #t~ret0; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,808 INFO L280 TraceCheckUtils]: 39: Hoare triple {3606#(<= 3 |id_#in~x|)} assume true; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,809 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3606#(<= 3 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,810 INFO L280 TraceCheckUtils]: 41: Hoare triple {3584#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,810 INFO L280 TraceCheckUtils]: 42: Hoare triple {3584#(<= 4 |id2_#in~x|)} #res := 1 + #t~ret1; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,811 INFO L280 TraceCheckUtils]: 43: Hoare triple {3584#(<= 4 |id2_#in~x|)} havoc #t~ret1; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,811 INFO L280 TraceCheckUtils]: 44: Hoare triple {3584#(<= 4 |id2_#in~x|)} assume true; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,812 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {3584#(<= 4 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,813 INFO L280 TraceCheckUtils]: 46: Hoare triple {3554#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,813 INFO L280 TraceCheckUtils]: 47: Hoare triple {3554#(<= 5 |id_#in~x|)} #res := 1 + #t~ret0; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,814 INFO L280 TraceCheckUtils]: 48: Hoare triple {3554#(<= 5 |id_#in~x|)} havoc #t~ret0; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,814 INFO L280 TraceCheckUtils]: 49: Hoare triple {3554#(<= 5 |id_#in~x|)} assume true; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,815 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {3554#(<= 5 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,816 INFO L280 TraceCheckUtils]: 51: Hoare triple {3516#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,816 INFO L280 TraceCheckUtils]: 52: Hoare triple {3516#(<= 6 |id2_#in~x|)} #res := 1 + #t~ret1; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,817 INFO L280 TraceCheckUtils]: 53: Hoare triple {3516#(<= 6 |id2_#in~x|)} havoc #t~ret1; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,817 INFO L280 TraceCheckUtils]: 54: Hoare triple {3516#(<= 6 |id2_#in~x|)} assume true; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,818 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {3516#(<= 6 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3469#(<= 7 |id_#in~x|)} is VALID [2020-07-11 00:51:34,819 INFO L280 TraceCheckUtils]: 56: Hoare triple {3469#(<= 7 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3469#(<= 7 |id_#in~x|)} is VALID [2020-07-11 00:51:34,819 INFO L280 TraceCheckUtils]: 57: Hoare triple {3469#(<= 7 |id_#in~x|)} #res := 1 + #t~ret0; {3469#(<= 7 |id_#in~x|)} is VALID [2020-07-11 00:51:34,820 INFO L280 TraceCheckUtils]: 58: Hoare triple {3469#(<= 7 |id_#in~x|)} havoc #t~ret0; {3469#(<= 7 |id_#in~x|)} is VALID [2020-07-11 00:51:34,820 INFO L280 TraceCheckUtils]: 59: Hoare triple {3469#(<= 7 |id_#in~x|)} assume true; {3469#(<= 7 |id_#in~x|)} is VALID [2020-07-11 00:51:34,821 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3469#(<= 7 |id_#in~x|)} {3353#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #48#return; {3350#false} is VALID [2020-07-11 00:51:34,824 INFO L263 TraceCheckUtils]: 0: Hoare triple {3349#true} call ULTIMATE.init(); {3349#true} is VALID [2020-07-11 00:51:34,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {3349#true} assume true; {3349#true} is VALID [2020-07-11 00:51:34,824 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3349#true} {3349#true} #44#return; {3349#true} is VALID [2020-07-11 00:51:34,824 INFO L263 TraceCheckUtils]: 3: Hoare triple {3349#true} call #t~ret3 := main(); {3349#true} is VALID [2020-07-11 00:51:34,825 INFO L280 TraceCheckUtils]: 4: Hoare triple {3349#true} ~input~0 := 5; {3353#(and (<= main_~input~0 5) (<= 5 main_~input~0))} is VALID [2020-07-11 00:51:34,825 INFO L263 TraceCheckUtils]: 5: Hoare triple {3353#(and (<= main_~input~0 5) (<= 5 main_~input~0))} call #t~ret2 := id(~input~0); {3349#true} is VALID [2020-07-11 00:51:34,825 INFO L280 TraceCheckUtils]: 6: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,825 INFO L280 TraceCheckUtils]: 7: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,826 INFO L263 TraceCheckUtils]: 8: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,829 INFO L280 TraceCheckUtils]: 9: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,833 INFO L280 TraceCheckUtils]: 10: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,833 INFO L263 TraceCheckUtils]: 11: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,833 INFO L280 TraceCheckUtils]: 12: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,834 INFO L280 TraceCheckUtils]: 13: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,834 INFO L263 TraceCheckUtils]: 14: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,834 INFO L280 TraceCheckUtils]: 15: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,834 INFO L280 TraceCheckUtils]: 16: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,835 INFO L263 TraceCheckUtils]: 17: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,835 INFO L280 TraceCheckUtils]: 18: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,836 INFO L280 TraceCheckUtils]: 19: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,836 INFO L263 TraceCheckUtils]: 20: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,836 INFO L280 TraceCheckUtils]: 21: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,837 INFO L280 TraceCheckUtils]: 22: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,837 INFO L263 TraceCheckUtils]: 23: Hoare triple {3470#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,838 INFO L280 TraceCheckUtils]: 24: Hoare triple {3349#true} ~x := #in~x; {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,838 INFO L280 TraceCheckUtils]: 25: Hoare triple {3415#(= |id_#in~x| id_~x)} assume !(0 == ~x); {3415#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:51:34,838 INFO L263 TraceCheckUtils]: 26: Hoare triple {3415#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {3349#true} is VALID [2020-07-11 00:51:34,839 INFO L280 TraceCheckUtils]: 27: Hoare triple {3349#true} ~x := #in~x; {3470#(= id2_~x |id2_#in~x|)} is VALID [2020-07-11 00:51:34,839 INFO L280 TraceCheckUtils]: 28: Hoare triple {3470#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,840 INFO L280 TraceCheckUtils]: 29: Hoare triple {3627#(= 0 |id2_#in~x|)} #res := 0; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,840 INFO L280 TraceCheckUtils]: 30: Hoare triple {3627#(= 0 |id2_#in~x|)} assume true; {3627#(= 0 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,841 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {3627#(= 0 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,842 INFO L280 TraceCheckUtils]: 32: Hoare triple {3626#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,842 INFO L280 TraceCheckUtils]: 33: Hoare triple {3626#(<= 1 |id_#in~x|)} #res := 1 + #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,843 INFO L280 TraceCheckUtils]: 34: Hoare triple {3626#(<= 1 |id_#in~x|)} havoc #t~ret0; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,843 INFO L280 TraceCheckUtils]: 35: Hoare triple {3626#(<= 1 |id_#in~x|)} assume true; {3626#(<= 1 |id_#in~x|)} is VALID [2020-07-11 00:51:34,844 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3626#(<= 1 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,845 INFO L280 TraceCheckUtils]: 37: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,845 INFO L280 TraceCheckUtils]: 38: Hoare triple {3620#(<= 2 |id2_#in~x|)} #res := 1 + #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,845 INFO L280 TraceCheckUtils]: 39: Hoare triple {3620#(<= 2 |id2_#in~x|)} havoc #t~ret1; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,846 INFO L280 TraceCheckUtils]: 40: Hoare triple {3620#(<= 2 |id2_#in~x|)} assume true; {3620#(<= 2 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,847 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3620#(<= 2 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,848 INFO L280 TraceCheckUtils]: 42: Hoare triple {3606#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,848 INFO L280 TraceCheckUtils]: 43: Hoare triple {3606#(<= 3 |id_#in~x|)} #res := 1 + #t~ret0; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,849 INFO L280 TraceCheckUtils]: 44: Hoare triple {3606#(<= 3 |id_#in~x|)} havoc #t~ret0; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,849 INFO L280 TraceCheckUtils]: 45: Hoare triple {3606#(<= 3 |id_#in~x|)} assume true; {3606#(<= 3 |id_#in~x|)} is VALID [2020-07-11 00:51:34,850 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {3606#(<= 3 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,851 INFO L280 TraceCheckUtils]: 47: Hoare triple {3584#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,851 INFO L280 TraceCheckUtils]: 48: Hoare triple {3584#(<= 4 |id2_#in~x|)} #res := 1 + #t~ret1; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,852 INFO L280 TraceCheckUtils]: 49: Hoare triple {3584#(<= 4 |id2_#in~x|)} havoc #t~ret1; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,853 INFO L280 TraceCheckUtils]: 50: Hoare triple {3584#(<= 4 |id2_#in~x|)} assume true; {3584#(<= 4 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,854 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {3584#(<= 4 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,854 INFO L280 TraceCheckUtils]: 52: Hoare triple {3554#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,855 INFO L280 TraceCheckUtils]: 53: Hoare triple {3554#(<= 5 |id_#in~x|)} #res := 1 + #t~ret0; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,855 INFO L280 TraceCheckUtils]: 54: Hoare triple {3554#(<= 5 |id_#in~x|)} havoc #t~ret0; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,855 INFO L280 TraceCheckUtils]: 55: Hoare triple {3554#(<= 5 |id_#in~x|)} assume true; {3554#(<= 5 |id_#in~x|)} is VALID [2020-07-11 00:51:34,856 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3554#(<= 5 |id_#in~x|)} {3470#(= id2_~x |id2_#in~x|)} #42#return; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,857 INFO L280 TraceCheckUtils]: 57: Hoare triple {3516#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,857 INFO L280 TraceCheckUtils]: 58: Hoare triple {3516#(<= 6 |id2_#in~x|)} #res := 1 + #t~ret1; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,857 INFO L280 TraceCheckUtils]: 59: Hoare triple {3516#(<= 6 |id2_#in~x|)} havoc #t~ret1; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,858 INFO L280 TraceCheckUtils]: 60: Hoare triple {3516#(<= 6 |id2_#in~x|)} assume true; {3516#(<= 6 |id2_#in~x|)} is VALID [2020-07-11 00:51:34,858 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {3516#(<= 6 |id2_#in~x|)} {3415#(= |id_#in~x| id_~x)} #50#return; {3469#(<= 7 |id_#in~x|)} is VALID [2020-07-11 00:51:34,859 INFO L280 TraceCheckUtils]: 62: Hoare triple {3469#(<= 7 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3469#(<= 7 |id_#in~x|)} is VALID [2020-07-11 00:51:34,859 INFO L280 TraceCheckUtils]: 63: Hoare triple {3469#(<= 7 |id_#in~x|)} #res := 1 + #t~ret0; {3469#(<= 7 |id_#in~x|)} is VALID [2020-07-11 00:51:34,859 INFO L280 TraceCheckUtils]: 64: Hoare triple {3469#(<= 7 |id_#in~x|)} havoc #t~ret0; {3469#(<= 7 |id_#in~x|)} is VALID [2020-07-11 00:51:34,860 INFO L280 TraceCheckUtils]: 65: Hoare triple {3469#(<= 7 |id_#in~x|)} assume true; {3469#(<= 7 |id_#in~x|)} is VALID [2020-07-11 00:51:34,863 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {3469#(<= 7 |id_#in~x|)} {3353#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #48#return; {3350#false} is VALID [2020-07-11 00:51:34,863 INFO L280 TraceCheckUtils]: 67: Hoare triple {3350#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3350#false} is VALID [2020-07-11 00:51:34,864 INFO L280 TraceCheckUtils]: 68: Hoare triple {3350#false} ~result~0 := #t~ret2; {3350#false} is VALID [2020-07-11 00:51:34,864 INFO L280 TraceCheckUtils]: 69: Hoare triple {3350#false} havoc #t~ret2; {3350#false} is VALID [2020-07-11 00:51:34,864 INFO L280 TraceCheckUtils]: 70: Hoare triple {3350#false} assume 5 != ~result~0; {3350#false} is VALID [2020-07-11 00:51:34,864 INFO L280 TraceCheckUtils]: 71: Hoare triple {3350#false} assume !false; {3350#false} is VALID [2020-07-11 00:51:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-07-11 00:51:34,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2126019764] [2020-07-11 00:51:34,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:34,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 00:51:34,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857684793] [2020-07-11 00:51:34,870 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2020-07-11 00:51:34,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:34,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 00:51:34,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:34,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 00:51:34,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:34,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 00:51:34,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-11 00:51:34,945 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 13 states. [2020-07-11 00:51:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:36,091 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2020-07-11 00:51:36,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 00:51:36,091 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2020-07-11 00:51:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 00:51:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 84 transitions. [2020-07-11 00:51:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 00:51:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 84 transitions. [2020-07-11 00:51:36,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 84 transitions. [2020-07-11 00:51:36,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:36,220 INFO L225 Difference]: With dead ends: 101 [2020-07-11 00:51:36,220 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:51:36,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2020-07-11 00:51:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:51:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:51:36,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:36,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:36,223 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:36,223 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:36,224 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:51:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:51:36,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:36,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:36,225 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:36,225 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:36,225 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:51:36,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:51:36,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:36,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:36,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:36,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:51:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:51:36,226 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2020-07-11 00:51:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:36,227 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:51:36,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 00:51:36,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:51:36,227 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:51:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:51:36,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:36,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 00:51:36,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:51:37,202 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-07-11 00:51:37,546 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2020-07-11 00:51:37,893 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2020-07-11 00:51:38,177 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2020-07-11 00:51:38,343 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-07-11 00:51:38,677 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2020-07-11 00:51:39,073 WARN L193 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2020-07-11 00:51:39,206 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2020-07-11 00:51:39,395 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2020-07-11 00:51:39,575 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2020-07-11 00:51:39,585 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:51:39,585 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:51:39,585 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2020-07-11 00:51:39,585 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2020-07-11 00:51:39,586 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (let ((.cse2 (= id2_~x |id2_#in~x|))) (let ((.cse0 (and (or (and (<= |id2_#in~x| 3) .cse2) (and (<= |id2_#t~ret1| 3) .cse2 (<= 3 |id2_#t~ret1|))) (<= 3 |id2_#in~x|))) (.cse1 (and (<= 5 |id2_#in~x|) .cse2))) (and (or .cse0 .cse1 (not (<= 4 |id2_#in~x|))) (or (and (or (and (<= 1 |id2_#t~ret1|) .cse2 (<= |id2_#t~ret1| 1)) (and (<= |id2_#in~x| 1) .cse2)) (<= 1 |id2_#in~x|)) .cse0 .cse1)))) [2020-07-11 00:51:39,586 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (= 0 |id2_#in~x|) (= id2_~x |id2_#in~x|)) [2020-07-11 00:51:39,586 INFO L264 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (let ((.cse2 (= id2_~x |id2_#in~x|))) (let ((.cse0 (and (or (and (<= |id2_#in~x| 3) .cse2) (and (<= |id2_#t~ret1| 3) .cse2 (<= 3 |id2_#t~ret1|))) (<= 3 |id2_#in~x|))) (.cse1 (and (<= 5 |id2_#in~x|) .cse2))) (and (or .cse0 .cse1 (not (<= 4 |id2_#in~x|))) (or (and (or (and (<= 1 |id2_#t~ret1|) .cse2 (<= |id2_#t~ret1| 1)) (and (<= |id2_#in~x| 1) .cse2)) (<= 1 |id2_#in~x|)) .cse0 .cse1)))) [2020-07-11 00:51:39,586 INFO L264 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: (let ((.cse0 (<= |id2_#in~x| 3)) (.cse1 (= id2_~x |id2_#in~x|))) (or (and (or (and (<= 2 |id2_#res|) .cse0 (<= 1 |id2_#t~ret1|) (<= |id2_#res| 2) .cse1 (<= |id2_#t~ret1| 1)) (and (<= |id2_#in~x| 1) .cse1)) (<= 1 |id2_#in~x|)) (and (<= 5 |id2_#in~x|) .cse1) (and (<= 3 |id2_#in~x|) (or (and (<= |id2_#t~ret1| 3) (<= |id2_#res| 4) .cse1 (<= 3 |id2_#t~ret1|) (<= 4 |id2_#res|)) (and .cse0 .cse1))))) [2020-07-11 00:51:39,587 INFO L264 CegarLoopResult]: At program point id2EXIT(lines 12 15) the Hoare annotation is: (let ((.cse0 (= id2_~x |id2_#in~x|)) (.cse1 (<= |id2_#in~x| 3))) (or (and (<= 5 |id2_#in~x|) .cse0) (and (or .cse1 (and (<= |id2_#res| 4) (<= 4 |id2_#res|))) .cse0 (<= 3 |id2_#in~x|)) (and (= 0 |id2_#in~x|) .cse0 (= 0 |id2_#res|)) (and .cse0 (or (<= |id2_#in~x| 1) (and (<= 2 |id2_#res|) .cse1 (<= |id2_#res| 2))) (<= 1 |id2_#in~x|)))) [2020-07-11 00:51:39,587 INFO L271 CegarLoopResult]: At program point id2ENTRY(lines 12 15) the Hoare annotation is: true [2020-07-11 00:51:39,587 INFO L264 CegarLoopResult]: At program point id2FINAL(lines 12 15) the Hoare annotation is: (let ((.cse0 (= id2_~x |id2_#in~x|)) (.cse1 (<= |id2_#in~x| 3))) (or (and (<= 5 |id2_#in~x|) .cse0) (and (or .cse1 (and (<= |id2_#res| 4) (<= 4 |id2_#res|))) .cse0 (<= 3 |id2_#in~x|)) (and (= 0 |id2_#in~x|) .cse0 (= 0 |id2_#res|)) (and .cse0 (or (<= |id2_#in~x| 1) (and (<= 2 |id2_#res|) .cse1 (<= |id2_#res| 2))) (<= 1 |id2_#in~x|)))) [2020-07-11 00:51:39,587 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:51:39,588 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:51:39,588 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:51:39,588 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:51:39,588 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) the Hoare annotation is: false [2020-07-11 00:51:39,588 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 17 23) the Hoare annotation is: true [2020-07-11 00:51:39,588 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 17 23) the Hoare annotation is: (<= 5 main_~input~0) [2020-07-11 00:51:39,588 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: false [2020-07-11 00:51:39,588 INFO L264 CegarLoopResult]: At program point L20(lines 20 22) the Hoare annotation is: (and (<= 5 main_~input~0) (< 4 main_~result~0) (<= main_~result~0 5)) [2020-07-11 00:51:39,588 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-07-11 00:51:39,588 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|) (<= 5 main_~input~0)) [2020-07-11 00:51:39,589 INFO L264 CegarLoopResult]: At program point L20-2(lines 17 23) the Hoare annotation is: (<= 5 main_~input~0) [2020-07-11 00:51:39,589 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|) (<= 5 main_~input~0)) [2020-07-11 00:51:39,589 INFO L264 CegarLoopResult]: At program point L19-3(line 19) the Hoare annotation is: (and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|) (<= 5 main_~input~0) (< 4 main_~result~0) (<= main_~result~0 5)) [2020-07-11 00:51:39,589 INFO L264 CegarLoopResult]: At program point idFINAL(lines 7 10) the Hoare annotation is: (let ((.cse3 (<= |id_#in~x| 2))) (and (let ((.cse2 (= 0 |id_#in~x|)) (.cse0 (= |id_#in~x| id_~x))) (let ((.cse1 (or (and (<= 1 |id_#res|) (<= |id_#res| 1) .cse3 .cse0) (and .cse2 .cse0)))) (or (and .cse0 (<= 2 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse1) (and .cse2 .cse1)))) (or (<= 4 |id_#in~x|) (and (<= |id_#res| 3) (<= 3 |id_#res|)) .cse3) (or (<= 6 |id_#in~x|) (and (<= 5 |id_#res|) (<= |id_#res| 5)) (<= |id_#in~x| 4)))) [2020-07-11 00:51:39,589 INFO L264 CegarLoopResult]: At program point idEXIT(lines 7 10) the Hoare annotation is: (let ((.cse3 (<= |id_#in~x| 2))) (and (let ((.cse2 (= 0 |id_#in~x|)) (.cse0 (= |id_#in~x| id_~x))) (let ((.cse1 (or (and (<= 1 |id_#res|) (<= |id_#res| 1) .cse3 .cse0) (and .cse2 .cse0)))) (or (and .cse0 (<= 2 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse1) (and .cse2 .cse1)))) (or (<= 4 |id_#in~x|) (and (<= |id_#res| 3) (<= 3 |id_#res|)) .cse3) (or (<= 6 |id_#in~x|) (and (<= 5 |id_#res|) (<= |id_#res| 5)) (<= |id_#in~x| 4)))) [2020-07-11 00:51:39,589 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-11 00:51:39,589 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-11 00:51:39,590 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (let ((.cse2 (<= |id_#in~x| 4)) (.cse3 (<= 2 |id_#in~x|))) (let ((.cse0 (and (or (and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|) .cse2) (<= |id_#in~x| 2)) .cse3))) (and (or .cse0 (and (= 0 |id_#t~ret0|) (<= 1 |id_#in~x|)) (<= 3 |id_#in~x|)) (let ((.cse1 (= |id_#in~x| id_~x))) (or (and .cse1 (<= 6 |id_#in~x|)) (and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4) .cse1) (and .cse1 .cse2))) (or (<= 4 |id_#in~x|) .cse0 (not .cse3))))) [2020-07-11 00:51:39,590 INFO L271 CegarLoopResult]: At program point idENTRY(lines 7 10) the Hoare annotation is: true [2020-07-11 00:51:39,590 INFO L264 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: (and (= 0 |id_#in~x|) (= |id_#in~x| id_~x)) [2020-07-11 00:51:39,590 INFO L264 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: (let ((.cse2 (<= |id_#in~x| 4)) (.cse3 (<= 2 |id_#in~x|))) (let ((.cse0 (and (or (and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|) .cse2) (<= |id_#in~x| 2)) .cse3))) (and (or .cse0 (and (= 0 |id_#t~ret0|) (<= 1 |id_#in~x|)) (<= 3 |id_#in~x|)) (let ((.cse1 (= |id_#in~x| id_~x))) (or (and .cse1 (<= 6 |id_#in~x|)) (and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4) .cse1) (and .cse1 .cse2))) (or (<= 4 |id_#in~x|) .cse0 (not .cse3))))) [2020-07-11 00:51:39,590 INFO L264 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: (let ((.cse0 (<= |id_#in~x| 4)) (.cse3 (= |id_#in~x| id_~x)) (.cse2 (<= 2 |id_#in~x|))) (let ((.cse1 (and (or (and (<= |id_#res| 3) (<= |id_#t~ret0| 2) (<= 3 |id_#res|) (<= 2 |id_#t~ret0|) .cse0) (<= |id_#in~x| 2)) .cse3 .cse2))) (and (or (and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4) (<= 5 |id_#res|) (<= |id_#res| 5)) (<= 6 |id_#in~x|) .cse0) (or (<= 4 |id_#in~x|) .cse1 (not .cse2)) (or (and (<= 3 |id_#in~x|) .cse3) .cse1 (and (= 0 |id_#t~ret0|) (<= 1 |id_#res|) (<= 1 |id_#in~x|) (<= |id_#res| 1) .cse3))))) [2020-07-11 00:51:39,611 INFO L163 areAnnotationChecker]: CFG has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:51:39,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:51:39 BoogieIcfgContainer [2020-07-11 00:51:39,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:51:39,635 INFO L168 Benchmark]: Toolchain (without parser) took 14916.69 ms. Allocated memory was 144.7 MB in the beginning and 379.6 MB in the end (delta: 234.9 MB). Free memory was 103.5 MB in the beginning and 224.6 MB in the end (delta: -121.0 MB). Peak memory consumption was 113.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:39,635 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 144.7 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 00:51:39,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.68 ms. Allocated memory is still 144.7 MB. Free memory was 103.1 MB in the beginning and 93.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:39,639 INFO L168 Benchmark]: Boogie Preprocessor took 114.73 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 93.3 MB in the beginning and 181.3 MB in the end (delta: -88.0 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:39,640 INFO L168 Benchmark]: RCFGBuilder took 368.27 ms. Allocated memory is still 202.4 MB. Free memory was 181.3 MB in the beginning and 163.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:39,644 INFO L168 Benchmark]: TraceAbstraction took 14155.93 ms. Allocated memory was 202.4 MB in the beginning and 379.6 MB in the end (delta: 177.2 MB). Free memory was 163.3 MB in the beginning and 224.6 MB in the end (delta: -61.2 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:39,649 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.17 ms. Allocated memory is still 144.7 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 272.68 ms. Allocated memory is still 144.7 MB. Free memory was 103.1 MB in the beginning and 93.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.73 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 93.3 MB in the beginning and 181.3 MB in the end (delta: -88.0 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 368.27 ms. Allocated memory is still 202.4 MB. Free memory was 181.3 MB in the beginning and 163.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14155.93 ms. Allocated memory was 202.4 MB in the beginning and 379.6 MB in the end (delta: 177.2 MB). Free memory was 163.3 MB in the beginning and 224.6 MB in the end (delta: -61.2 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: 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: 12]: Procedure Contract for id2 Derived contract for procedure id2: (((5 <= \old(x) && x == \old(x)) || (((\old(x) <= 3 || (\result <= 4 && 4 <= \result)) && x == \old(x)) && 3 <= \old(x))) || ((0 == \old(x) && x == \old(x)) && 0 == \result)) || ((x == \old(x) && (\old(x) <= 1 || ((2 <= \result && \old(x) <= 3) && \result <= 2))) && 1 <= \old(x)) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 5 <= input - ProcedureContractResult [Line: 7]: Procedure Contract for id Derived contract for procedure id: ((((\old(x) == x && 2 <= \old(x)) || (1 <= \old(x) && ((((1 <= \result && \result <= 1) && \old(x) <= 2) && \old(x) == x) || (0 == \old(x) && \old(x) == x)))) || (0 == \old(x) && ((((1 <= \result && \result <= 1) && \old(x) <= 2) && \old(x) == x) || (0 == \old(x) && \old(x) == x)))) && ((4 <= \old(x) || (\result <= 3 && 3 <= \result)) || \old(x) <= 2)) && ((6 <= \old(x) || (5 <= \result && \result <= 5)) || \old(x) <= 4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.6s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 260 SDtfs, 193 SDslu, 1669 SDs, 0 SdLazy, 846 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 90 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 88 PreInvPairs, 383 NumberOfFragments, 894 HoareAnnotationTreeSize, 88 FomulaSimplifications, 22256 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 34 FomulaSimplificationsInter, 3126 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 344 ConstructedInterpolants, 0 QuantifiedInterpolants, 47966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 165/224 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...