/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:58:22,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:58:22,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:58:22,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:58:22,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:58:22,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:58:22,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:58:22,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:58:22,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:58:22,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:58:22,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:58:22,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:58:22,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:58:22,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:58:22,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:58:22,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:58:22,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:58:22,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:58:22,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:58:22,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:58:22,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:58:22,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:58:22,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:58:22,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:58:22,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:58:22,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:58:22,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:58:22,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:58:22,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:58:22,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:58:22,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:58:22,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:58:22,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:58:22,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:58:22,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:58:22,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:58:22,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:58:22,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:58:22,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:58:22,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:58:22,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:58:22,478 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:58:22,497 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:58:22,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:58:22,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:58:22,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:58:22,499 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:58:22,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:58:22,499 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:58:22,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:58:22,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:58:22,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:58:22,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:58:22,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:58:22,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:58:22,501 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:58:22,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:58:22,501 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:58:22,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:58:22,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:58:22,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:58:22,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:58:22,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:58:22,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:58:22,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:58:22,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:58:22,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:58:22,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:58:22,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:58:22,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:58:22,503 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:58:22,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:58:22,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:58:22,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:58:22,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:58:22,810 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:58:22,810 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:58:22,811 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-10 14:58:22,893 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adbb7474d/75a45f5b538a462a8def3515d5f2fff3/FLAG8b0911567 [2020-07-10 14:58:23,381 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:58:23,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2020-07-10 14:58:23,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adbb7474d/75a45f5b538a462a8def3515d5f2fff3/FLAG8b0911567 [2020-07-10 14:58:23,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adbb7474d/75a45f5b538a462a8def3515d5f2fff3 [2020-07-10 14:58:23,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:58:23,757 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:58:23,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:58:23,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:58:23,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:58:23,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:58:23" (1/1) ... [2020-07-10 14:58:23,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f18f3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:23, skipping insertion in model container [2020-07-10 14:58:23,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:58:23" (1/1) ... [2020-07-10 14:58:23,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:58:23,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:58:23,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:58:23,966 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:58:23,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:58:23,999 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:58:24,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:24 WrapperNode [2020-07-10 14:58:24,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:58:24,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:58:24,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:58:24,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:58:24,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:24" (1/1) ... [2020-07-10 14:58:24,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:24" (1/1) ... [2020-07-10 14:58:24,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:24" (1/1) ... [2020-07-10 14:58:24,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:24" (1/1) ... [2020-07-10 14:58:24,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:24" (1/1) ... [2020-07-10 14:58:24,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:24" (1/1) ... [2020-07-10 14:58:24,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:24" (1/1) ... [2020-07-10 14:58:24,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:58:24,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:58:24,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:58:24,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:58:24,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58: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-10 14:58:24,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:58:24,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:58:24,169 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-10 14:58:24,169 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-07-10 14:58:24,170 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:58:24,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:58:24,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:58:24,170 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-10 14:58:24,170 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-07-10 14:58:24,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:58:24,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:58:24,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:58:24,442 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:58:24,442 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:58:24,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:58:24 BoogieIcfgContainer [2020-07-10 14:58:24,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:58:24,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:58:24,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:58:24,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:58:24,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:58:23" (1/3) ... [2020-07-10 14:58:24,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e187748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:58:24, skipping insertion in model container [2020-07-10 14:58:24,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:24" (2/3) ... [2020-07-10 14:58:24,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e187748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:58:24, skipping insertion in model container [2020-07-10 14:58:24,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:58:24" (3/3) ... [2020-07-10 14:58:24,465 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2020-07-10 14:58:24,476 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:58:24,486 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:58:24,506 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:58:24,530 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:58:24,530 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:58:24,530 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:58:24,530 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:58:24,531 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:58:24,531 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:58:24,531 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:58:24,531 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:58:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-10 14:58:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 14:58:24,557 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:24,558 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:24,558 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:24,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:24,564 INFO L82 PathProgramCache]: Analyzing trace with hash -550894517, now seen corresponding path program 1 times [2020-07-10 14:58:24,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:24,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607996070] [2020-07-10 14:58:24,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:24,757 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-10 14:58:24,758 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29#true} {29#true} #36#return; {29#true} is VALID [2020-07-10 14:58:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:24,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:24,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:24,827 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:24,829 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#(= 0 |id_#in~x|)} {33#(<= 5 main_~input~0)} #40#return; {30#false} is VALID [2020-07-10 14:58:24,830 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2020-07-10 14:58:24,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-10 14:58:24,831 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #36#return; {29#true} is VALID [2020-07-10 14:58:24,831 INFO L263 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret3 := main(); {29#true} is VALID [2020-07-10 14:58:24,832 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#true} ~input~0 := 5; {33#(<= 5 main_~input~0)} is VALID [2020-07-10 14:58:24,833 INFO L263 TraceCheckUtils]: 5: Hoare triple {33#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {29#true} is VALID [2020-07-10 14:58:24,834 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:24,835 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:24,836 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:24,837 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {39#(= 0 |id_#in~x|)} {33#(<= 5 main_~input~0)} #40#return; {30#false} is VALID [2020-07-10 14:58:24,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {30#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {30#false} is VALID [2020-07-10 14:58:24,838 INFO L280 TraceCheckUtils]: 11: Hoare triple {30#false} assume 5 != ~result~0; {30#false} is VALID [2020-07-10 14:58:24,839 INFO L280 TraceCheckUtils]: 12: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-10 14:58:24,840 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-10 14:58:24,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607996070] [2020-07-10 14:58:24,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:58:24,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:58:24,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111853634] [2020-07-10 14:58:24,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:58:24,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:24,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:58:24,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:24,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:58:24,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:24,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:58:24,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:58:24,907 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2020-07-10 14:58:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:25,147 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-10 14:58:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:58:25,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:58:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:58:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-10 14:58:25,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:58:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-10 14:58:25,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-10 14:58:25,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:25,253 INFO L225 Difference]: With dead ends: 36 [2020-07-10 14:58:25,254 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 14:58:25,258 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-10 14:58:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 14:58:25,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-10 14:58:25,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:25,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-10 14:58:25,322 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 14:58:25,323 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 14:58:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:25,334 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-10 14:58:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-10 14:58:25,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:25,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:25,338 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 14:58:25,339 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 14:58:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:25,351 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-10 14:58:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-10 14:58:25,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:25,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:25,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:25,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 14:58:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-10 14:58:25,369 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2020-07-10 14:58:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:25,370 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-10 14:58:25,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:58:25,370 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-10 14:58:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 14:58:25,374 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:25,374 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:25,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:58:25,375 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:25,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:25,376 INFO L82 PathProgramCache]: Analyzing trace with hash 40504409, now seen corresponding path program 1 times [2020-07-10 14:58:25,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:25,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617661085] [2020-07-10 14:58:25,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:25,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {170#true} assume true; {170#true} is VALID [2020-07-10 14:58:25,475 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {170#true} {170#true} #36#return; {170#true} is VALID [2020-07-10 14:58:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:25,566 INFO L280 TraceCheckUtils]: 0: Hoare triple {170#true} ~x := #in~x; {191#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:25,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {191#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:25,569 INFO L280 TraceCheckUtils]: 2: Hoare triple {192#(= 0 |id2_#in~x|)} assume true; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:25,585 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {192#(= 0 |id2_#in~x|)} {185#(= |id_#in~x| id_~x)} #42#return; {190#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:25,586 INFO L280 TraceCheckUtils]: 0: Hoare triple {170#true} ~x := #in~x; {185#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:25,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {185#(= |id_#in~x| id_~x)} assume !(0 == ~x); {185#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:25,589 INFO L263 TraceCheckUtils]: 2: Hoare triple {185#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {170#true} is VALID [2020-07-10 14:58:25,590 INFO L280 TraceCheckUtils]: 3: Hoare triple {170#true} ~x := #in~x; {191#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:25,591 INFO L280 TraceCheckUtils]: 4: Hoare triple {191#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:25,592 INFO L280 TraceCheckUtils]: 5: Hoare triple {192#(= 0 |id2_#in~x|)} assume true; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:25,594 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {192#(= 0 |id2_#in~x|)} {185#(= |id_#in~x| id_~x)} #42#return; {190#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:25,596 INFO L280 TraceCheckUtils]: 7: Hoare triple {190#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {190#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:25,597 INFO L280 TraceCheckUtils]: 8: Hoare triple {190#(<= |id_#in~x| 1)} assume true; {190#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:25,598 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {190#(<= |id_#in~x| 1)} {174#(<= 5 main_~input~0)} #40#return; {171#false} is VALID [2020-07-10 14:58:25,599 INFO L263 TraceCheckUtils]: 0: Hoare triple {170#true} call ULTIMATE.init(); {170#true} is VALID [2020-07-10 14:58:25,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {170#true} assume true; {170#true} is VALID [2020-07-10 14:58:25,600 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {170#true} {170#true} #36#return; {170#true} is VALID [2020-07-10 14:58:25,600 INFO L263 TraceCheckUtils]: 3: Hoare triple {170#true} call #t~ret3 := main(); {170#true} is VALID [2020-07-10 14:58:25,603 INFO L280 TraceCheckUtils]: 4: Hoare triple {170#true} ~input~0 := 5; {174#(<= 5 main_~input~0)} is VALID [2020-07-10 14:58:25,603 INFO L263 TraceCheckUtils]: 5: Hoare triple {174#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {170#true} is VALID [2020-07-10 14:58:25,604 INFO L280 TraceCheckUtils]: 6: Hoare triple {170#true} ~x := #in~x; {185#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:25,605 INFO L280 TraceCheckUtils]: 7: Hoare triple {185#(= |id_#in~x| id_~x)} assume !(0 == ~x); {185#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:25,606 INFO L263 TraceCheckUtils]: 8: Hoare triple {185#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {170#true} is VALID [2020-07-10 14:58:25,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {170#true} ~x := #in~x; {191#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:25,608 INFO L280 TraceCheckUtils]: 10: Hoare triple {191#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:25,609 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#(= 0 |id2_#in~x|)} assume true; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:25,611 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {192#(= 0 |id2_#in~x|)} {185#(= |id_#in~x| id_~x)} #42#return; {190#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:25,613 INFO L280 TraceCheckUtils]: 13: Hoare triple {190#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {190#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:25,614 INFO L280 TraceCheckUtils]: 14: Hoare triple {190#(<= |id_#in~x| 1)} assume true; {190#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:25,615 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {190#(<= |id_#in~x| 1)} {174#(<= 5 main_~input~0)} #40#return; {171#false} is VALID [2020-07-10 14:58:25,616 INFO L280 TraceCheckUtils]: 16: Hoare triple {171#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {171#false} is VALID [2020-07-10 14:58:25,616 INFO L280 TraceCheckUtils]: 17: Hoare triple {171#false} assume 5 != ~result~0; {171#false} is VALID [2020-07-10 14:58:25,616 INFO L280 TraceCheckUtils]: 18: Hoare triple {171#false} assume !false; {171#false} is VALID [2020-07-10 14:58:25,618 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-10 14:58:25,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617661085] [2020-07-10 14:58:25,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:58:25,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 14:58:25,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009592278] [2020-07-10 14:58:25,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-10 14:58:25,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:25,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 14:58:25,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:25,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 14:58:25,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:25,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 14:58:25,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:58:25,652 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2020-07-10 14:58:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:25,895 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-10 14:58:25,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 14:58:25,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-10 14:58:25,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:58:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-10 14:58:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:58:25,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-10 14:58:25,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2020-07-10 14:58:25,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:25,956 INFO L225 Difference]: With dead ends: 33 [2020-07-10 14:58:25,957 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 14:58:25,958 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-10 14:58:25,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 14:58:25,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-07-10 14:58:25,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:25,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2020-07-10 14:58:25,971 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2020-07-10 14:58:25,971 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2020-07-10 14:58:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:25,975 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-10 14:58:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-10 14:58:25,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:25,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:25,976 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2020-07-10 14:58:25,977 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2020-07-10 14:58:25,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:25,980 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-10 14:58:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-10 14:58:25,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:25,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:25,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:25,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 14:58:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-10 14:58:25,985 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2020-07-10 14:58:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:25,985 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-10 14:58:25,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 14:58:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-10 14:58:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 14:58:25,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:25,987 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] [2020-07-10 14:58:25,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:58:25,988 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:25,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:25,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1029702107, now seen corresponding path program 1 times [2020-07-10 14:58:25,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:25,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106323730] [2020-07-10 14:58:25,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:26,036 INFO L280 TraceCheckUtils]: 0: Hoare triple {335#true} assume true; {335#true} is VALID [2020-07-10 14:58:26,036 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {335#true} {335#true} #36#return; {335#true} is VALID [2020-07-10 14:58:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:26,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:26,169 INFO L280 TraceCheckUtils]: 1: Hoare triple {356#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {374#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:26,171 INFO L280 TraceCheckUtils]: 2: Hoare triple {374#(= 0 |id_#in~x|)} assume true; {374#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:26,173 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {374#(= 0 |id_#in~x|)} {368#(= id2_~x |id2_#in~x|)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:26,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {335#true} ~x := #in~x; {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:26,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {368#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:26,175 INFO L263 TraceCheckUtils]: 2: Hoare triple {368#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {335#true} is VALID [2020-07-10 14:58:26,179 INFO L280 TraceCheckUtils]: 3: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:26,180 INFO L280 TraceCheckUtils]: 4: Hoare triple {356#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {374#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:26,181 INFO L280 TraceCheckUtils]: 5: Hoare triple {374#(= 0 |id_#in~x|)} assume true; {374#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:26,182 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {374#(= 0 |id_#in~x|)} {368#(= id2_~x |id2_#in~x|)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:26,183 INFO L280 TraceCheckUtils]: 7: Hoare triple {373#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:26,184 INFO L280 TraceCheckUtils]: 8: Hoare triple {373#(<= |id2_#in~x| 1)} assume true; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:26,185 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {373#(<= |id2_#in~x| 1)} {356#(= |id_#in~x| id_~x)} #42#return; {367#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:26,187 INFO L280 TraceCheckUtils]: 0: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:26,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {356#(= |id_#in~x| id_~x)} assume !(0 == ~x); {356#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:26,188 INFO L263 TraceCheckUtils]: 2: Hoare triple {356#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {335#true} is VALID [2020-07-10 14:58:26,189 INFO L280 TraceCheckUtils]: 3: Hoare triple {335#true} ~x := #in~x; {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:26,190 INFO L280 TraceCheckUtils]: 4: Hoare triple {368#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:26,190 INFO L263 TraceCheckUtils]: 5: Hoare triple {368#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {335#true} is VALID [2020-07-10 14:58:26,191 INFO L280 TraceCheckUtils]: 6: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:26,192 INFO L280 TraceCheckUtils]: 7: Hoare triple {356#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {374#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:26,193 INFO L280 TraceCheckUtils]: 8: Hoare triple {374#(= 0 |id_#in~x|)} assume true; {374#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:26,198 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {374#(= 0 |id_#in~x|)} {368#(= id2_~x |id2_#in~x|)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:26,199 INFO L280 TraceCheckUtils]: 10: Hoare triple {373#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:26,199 INFO L280 TraceCheckUtils]: 11: Hoare triple {373#(<= |id2_#in~x| 1)} assume true; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:26,201 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {373#(<= |id2_#in~x| 1)} {356#(= |id_#in~x| id_~x)} #42#return; {367#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:26,210 INFO L280 TraceCheckUtils]: 13: Hoare triple {367#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {367#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:26,211 INFO L280 TraceCheckUtils]: 14: Hoare triple {367#(<= |id_#in~x| 2)} assume true; {367#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:26,213 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {367#(<= |id_#in~x| 2)} {339#(<= 5 main_~input~0)} #40#return; {336#false} is VALID [2020-07-10 14:58:26,214 INFO L263 TraceCheckUtils]: 0: Hoare triple {335#true} call ULTIMATE.init(); {335#true} is VALID [2020-07-10 14:58:26,215 INFO L280 TraceCheckUtils]: 1: Hoare triple {335#true} assume true; {335#true} is VALID [2020-07-10 14:58:26,215 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {335#true} {335#true} #36#return; {335#true} is VALID [2020-07-10 14:58:26,215 INFO L263 TraceCheckUtils]: 3: Hoare triple {335#true} call #t~ret3 := main(); {335#true} is VALID [2020-07-10 14:58:26,217 INFO L280 TraceCheckUtils]: 4: Hoare triple {335#true} ~input~0 := 5; {339#(<= 5 main_~input~0)} is VALID [2020-07-10 14:58:26,217 INFO L263 TraceCheckUtils]: 5: Hoare triple {339#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {335#true} is VALID [2020-07-10 14:58:26,218 INFO L280 TraceCheckUtils]: 6: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:26,219 INFO L280 TraceCheckUtils]: 7: Hoare triple {356#(= |id_#in~x| id_~x)} assume !(0 == ~x); {356#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:26,219 INFO L263 TraceCheckUtils]: 8: Hoare triple {356#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {335#true} is VALID [2020-07-10 14:58:26,220 INFO L280 TraceCheckUtils]: 9: Hoare triple {335#true} ~x := #in~x; {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:26,221 INFO L280 TraceCheckUtils]: 10: Hoare triple {368#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:26,221 INFO L263 TraceCheckUtils]: 11: Hoare triple {368#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {335#true} is VALID [2020-07-10 14:58:26,222 INFO L280 TraceCheckUtils]: 12: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:26,223 INFO L280 TraceCheckUtils]: 13: Hoare triple {356#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {374#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:26,223 INFO L280 TraceCheckUtils]: 14: Hoare triple {374#(= 0 |id_#in~x|)} assume true; {374#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:26,225 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {374#(= 0 |id_#in~x|)} {368#(= id2_~x |id2_#in~x|)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:26,230 INFO L280 TraceCheckUtils]: 16: Hoare triple {373#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:26,231 INFO L280 TraceCheckUtils]: 17: Hoare triple {373#(<= |id2_#in~x| 1)} assume true; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:26,234 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {373#(<= |id2_#in~x| 1)} {356#(= |id_#in~x| id_~x)} #42#return; {367#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:26,236 INFO L280 TraceCheckUtils]: 19: Hoare triple {367#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {367#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:26,237 INFO L280 TraceCheckUtils]: 20: Hoare triple {367#(<= |id_#in~x| 2)} assume true; {367#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:26,238 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {367#(<= |id_#in~x| 2)} {339#(<= 5 main_~input~0)} #40#return; {336#false} is VALID [2020-07-10 14:58:26,239 INFO L280 TraceCheckUtils]: 22: Hoare triple {336#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {336#false} is VALID [2020-07-10 14:58:26,239 INFO L280 TraceCheckUtils]: 23: Hoare triple {336#false} assume 5 != ~result~0; {336#false} is VALID [2020-07-10 14:58:26,239 INFO L280 TraceCheckUtils]: 24: Hoare triple {336#false} assume !false; {336#false} is VALID [2020-07-10 14:58:26,241 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-10 14:58:26,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106323730] [2020-07-10 14:58:26,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958093811] [2020-07-10 14:58:26,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:26,298 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 14:58:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:26,319 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:26,500 INFO L263 TraceCheckUtils]: 0: Hoare triple {335#true} call ULTIMATE.init(); {335#true} is VALID [2020-07-10 14:58:26,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {335#true} assume true; {335#true} is VALID [2020-07-10 14:58:26,501 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {335#true} {335#true} #36#return; {335#true} is VALID [2020-07-10 14:58:26,501 INFO L263 TraceCheckUtils]: 3: Hoare triple {335#true} call #t~ret3 := main(); {335#true} is VALID [2020-07-10 14:58:26,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {335#true} ~input~0 := 5; {339#(<= 5 main_~input~0)} is VALID [2020-07-10 14:58:26,503 INFO L263 TraceCheckUtils]: 5: Hoare triple {339#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {335#true} is VALID [2020-07-10 14:58:26,503 INFO L280 TraceCheckUtils]: 6: Hoare triple {335#true} ~x := #in~x; {396#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:26,504 INFO L280 TraceCheckUtils]: 7: Hoare triple {396#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {396#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:26,505 INFO L263 TraceCheckUtils]: 8: Hoare triple {396#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {335#true} is VALID [2020-07-10 14:58:26,506 INFO L280 TraceCheckUtils]: 9: Hoare triple {335#true} ~x := #in~x; {406#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-10 14:58:26,507 INFO L280 TraceCheckUtils]: 10: Hoare triple {406#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {406#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-10 14:58:26,507 INFO L263 TraceCheckUtils]: 11: Hoare triple {406#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {335#true} is VALID [2020-07-10 14:58:26,508 INFO L280 TraceCheckUtils]: 12: Hoare triple {335#true} ~x := #in~x; {396#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:26,509 INFO L280 TraceCheckUtils]: 13: Hoare triple {396#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {419#(<= |id_#in~x| 0)} is VALID [2020-07-10 14:58:26,510 INFO L280 TraceCheckUtils]: 14: Hoare triple {419#(<= |id_#in~x| 0)} assume true; {419#(<= |id_#in~x| 0)} is VALID [2020-07-10 14:58:26,512 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {419#(<= |id_#in~x| 0)} {406#(<= |id2_#in~x| id2_~x)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:26,513 INFO L280 TraceCheckUtils]: 16: Hoare triple {373#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:26,514 INFO L280 TraceCheckUtils]: 17: Hoare triple {373#(<= |id2_#in~x| 1)} assume true; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:26,516 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {373#(<= |id2_#in~x| 1)} {396#(<= |id_#in~x| id_~x)} #42#return; {367#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:26,517 INFO L280 TraceCheckUtils]: 19: Hoare triple {367#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {367#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:26,518 INFO L280 TraceCheckUtils]: 20: Hoare triple {367#(<= |id_#in~x| 2)} assume true; {367#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:26,519 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {367#(<= |id_#in~x| 2)} {339#(<= 5 main_~input~0)} #40#return; {336#false} is VALID [2020-07-10 14:58:26,520 INFO L280 TraceCheckUtils]: 22: Hoare triple {336#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {336#false} is VALID [2020-07-10 14:58:26,520 INFO L280 TraceCheckUtils]: 23: Hoare triple {336#false} assume 5 != ~result~0; {336#false} is VALID [2020-07-10 14:58:26,520 INFO L280 TraceCheckUtils]: 24: Hoare triple {336#false} assume !false; {336#false} is VALID [2020-07-10 14:58:26,522 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-10 14:58:26,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:58:26,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-07-10 14:58:26,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043672255] [2020-07-10 14:58:26,525 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-07-10 14:58:26,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:26,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 14:58:26,578 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-10 14:58:26,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 14:58:26,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:26,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 14:58:26,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-10 14:58:26,580 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 11 states. [2020-07-10 14:58:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:26,911 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-10 14:58:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:58:26,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-07-10 14:58:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 14:58:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2020-07-10 14:58:26,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 14:58:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2020-07-10 14:58:26,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2020-07-10 14:58:26,968 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-10 14:58:26,970 INFO L225 Difference]: With dead ends: 39 [2020-07-10 14:58:26,970 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 14:58:26,971 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-07-10 14:58:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 14:58:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2020-07-10 14:58:26,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:26,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 30 states. [2020-07-10 14:58:26,982 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 30 states. [2020-07-10 14:58:26,983 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 30 states. [2020-07-10 14:58:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:26,986 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-10 14:58:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-10 14:58:26,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:26,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:26,988 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 35 states. [2020-07-10 14:58:26,988 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 35 states. [2020-07-10 14:58:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:26,991 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-10 14:58:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-10 14:58:26,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:26,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:26,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:26,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 14:58:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-10 14:58:26,995 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2020-07-10 14:58:26,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:26,996 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-10 14:58:26,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 14:58:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-10 14:58:26,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 14:58:26,997 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:26,997 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:27,213 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 14:58:27,213 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:27,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash -559715991, now seen corresponding path program 1 times [2020-07-10 14:58:27,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:27,215 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843000641] [2020-07-10 14:58:27,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:27,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-10 14:58:27,253 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {615#true} {615#true} #36#return; {615#true} is VALID [2020-07-10 14:58:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:27,384 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:27,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:27,386 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:27,387 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,388 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,388 INFO L263 TraceCheckUtils]: 2: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-10 14:58:27,389 INFO L280 TraceCheckUtils]: 3: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:27,390 INFO L280 TraceCheckUtils]: 4: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:27,391 INFO L280 TraceCheckUtils]: 5: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:27,392 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,392 INFO L280 TraceCheckUtils]: 7: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,393 INFO L280 TraceCheckUtils]: 8: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,395 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {676#(<= |id_#in~x| 1)} {660#(= id2_~x |id2_#in~x|)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-10 14:58:27,396 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:27,397 INFO L280 TraceCheckUtils]: 1: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:27,398 INFO L263 TraceCheckUtils]: 2: Hoare triple {660#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {615#true} is VALID [2020-07-10 14:58:27,398 INFO L280 TraceCheckUtils]: 3: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,399 INFO L280 TraceCheckUtils]: 4: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,399 INFO L263 TraceCheckUtils]: 5: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-10 14:58:27,400 INFO L280 TraceCheckUtils]: 6: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:27,401 INFO L280 TraceCheckUtils]: 7: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:27,401 INFO L280 TraceCheckUtils]: 8: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:27,403 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,403 INFO L280 TraceCheckUtils]: 10: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,405 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {676#(<= |id_#in~x| 1)} {660#(= id2_~x |id2_#in~x|)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-10 14:58:27,406 INFO L280 TraceCheckUtils]: 13: Hoare triple {671#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-10 14:58:27,407 INFO L280 TraceCheckUtils]: 14: Hoare triple {671#(<= |id2_#in~x| 2)} assume true; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-10 14:58:27,408 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {671#(<= |id2_#in~x| 2)} {642#(= |id_#in~x| id_~x)} #42#return; {659#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:58:27,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,410 INFO L263 TraceCheckUtils]: 2: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-10 14:58:27,411 INFO L280 TraceCheckUtils]: 3: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:27,411 INFO L280 TraceCheckUtils]: 4: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:27,412 INFO L263 TraceCheckUtils]: 5: Hoare triple {660#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {615#true} is VALID [2020-07-10 14:58:27,412 INFO L280 TraceCheckUtils]: 6: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,413 INFO L280 TraceCheckUtils]: 7: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,413 INFO L263 TraceCheckUtils]: 8: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-10 14:58:27,414 INFO L280 TraceCheckUtils]: 9: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:27,414 INFO L280 TraceCheckUtils]: 10: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:27,415 INFO L280 TraceCheckUtils]: 11: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:27,416 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,417 INFO L280 TraceCheckUtils]: 13: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,417 INFO L280 TraceCheckUtils]: 14: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,419 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {676#(<= |id_#in~x| 1)} {660#(= id2_~x |id2_#in~x|)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-10 14:58:27,419 INFO L280 TraceCheckUtils]: 16: Hoare triple {671#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-10 14:58:27,420 INFO L280 TraceCheckUtils]: 17: Hoare triple {671#(<= |id2_#in~x| 2)} assume true; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-10 14:58:27,421 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {671#(<= |id2_#in~x| 2)} {642#(= |id_#in~x| id_~x)} #42#return; {659#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:58:27,422 INFO L280 TraceCheckUtils]: 19: Hoare triple {659#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {659#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:58:27,422 INFO L280 TraceCheckUtils]: 20: Hoare triple {659#(<= |id_#in~x| 3)} assume true; {659#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:58:27,424 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {659#(<= |id_#in~x| 3)} {619#(<= 5 main_~input~0)} #40#return; {616#false} is VALID [2020-07-10 14:58:27,424 INFO L263 TraceCheckUtils]: 0: Hoare triple {615#true} call ULTIMATE.init(); {615#true} is VALID [2020-07-10 14:58:27,425 INFO L280 TraceCheckUtils]: 1: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-10 14:58:27,425 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {615#true} {615#true} #36#return; {615#true} is VALID [2020-07-10 14:58:27,425 INFO L263 TraceCheckUtils]: 3: Hoare triple {615#true} call #t~ret3 := main(); {615#true} is VALID [2020-07-10 14:58:27,426 INFO L280 TraceCheckUtils]: 4: Hoare triple {615#true} ~input~0 := 5; {619#(<= 5 main_~input~0)} is VALID [2020-07-10 14:58:27,426 INFO L263 TraceCheckUtils]: 5: Hoare triple {619#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {615#true} is VALID [2020-07-10 14:58:27,427 INFO L280 TraceCheckUtils]: 6: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,428 INFO L280 TraceCheckUtils]: 7: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,428 INFO L263 TraceCheckUtils]: 8: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-10 14:58:27,428 INFO L280 TraceCheckUtils]: 9: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:27,429 INFO L280 TraceCheckUtils]: 10: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:27,429 INFO L263 TraceCheckUtils]: 11: Hoare triple {660#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {615#true} is VALID [2020-07-10 14:58:27,430 INFO L280 TraceCheckUtils]: 12: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,431 INFO L280 TraceCheckUtils]: 13: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,431 INFO L263 TraceCheckUtils]: 14: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-10 14:58:27,431 INFO L280 TraceCheckUtils]: 15: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:27,432 INFO L280 TraceCheckUtils]: 16: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:27,433 INFO L280 TraceCheckUtils]: 17: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:27,434 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,435 INFO L280 TraceCheckUtils]: 19: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,435 INFO L280 TraceCheckUtils]: 20: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,437 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {676#(<= |id_#in~x| 1)} {660#(= id2_~x |id2_#in~x|)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-10 14:58:27,437 INFO L280 TraceCheckUtils]: 22: Hoare triple {671#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-10 14:58:27,438 INFO L280 TraceCheckUtils]: 23: Hoare triple {671#(<= |id2_#in~x| 2)} assume true; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-10 14:58:27,439 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {671#(<= |id2_#in~x| 2)} {642#(= |id_#in~x| id_~x)} #42#return; {659#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:58:27,440 INFO L280 TraceCheckUtils]: 25: Hoare triple {659#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {659#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:58:27,441 INFO L280 TraceCheckUtils]: 26: Hoare triple {659#(<= |id_#in~x| 3)} assume true; {659#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:58:27,442 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {659#(<= |id_#in~x| 3)} {619#(<= 5 main_~input~0)} #40#return; {616#false} is VALID [2020-07-10 14:58:27,442 INFO L280 TraceCheckUtils]: 28: Hoare triple {616#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {616#false} is VALID [2020-07-10 14:58:27,442 INFO L280 TraceCheckUtils]: 29: Hoare triple {616#false} assume 5 != ~result~0; {616#false} is VALID [2020-07-10 14:58:27,442 INFO L280 TraceCheckUtils]: 30: Hoare triple {616#false} assume !false; {616#false} is VALID [2020-07-10 14:58:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-10 14:58:27,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843000641] [2020-07-10 14:58:27,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998387003] [2020-07-10 14:58:27,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-10 14:58:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:27,472 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:27,483 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:27,607 INFO L263 TraceCheckUtils]: 0: Hoare triple {615#true} call ULTIMATE.init(); {615#true} is VALID [2020-07-10 14:58:27,607 INFO L280 TraceCheckUtils]: 1: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-10 14:58:27,607 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {615#true} {615#true} #36#return; {615#true} is VALID [2020-07-10 14:58:27,608 INFO L263 TraceCheckUtils]: 3: Hoare triple {615#true} call #t~ret3 := main(); {615#true} is VALID [2020-07-10 14:58:27,608 INFO L280 TraceCheckUtils]: 4: Hoare triple {615#true} ~input~0 := 5; {619#(<= 5 main_~input~0)} is VALID [2020-07-10 14:58:27,617 INFO L263 TraceCheckUtils]: 5: Hoare triple {619#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {615#true} is VALID [2020-07-10 14:58:27,620 INFO L280 TraceCheckUtils]: 6: Hoare triple {615#true} ~x := #in~x; {699#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {699#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {699#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,621 INFO L263 TraceCheckUtils]: 8: Hoare triple {699#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-10 14:58:27,621 INFO L280 TraceCheckUtils]: 9: Hoare triple {615#true} ~x := #in~x; {709#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-10 14:58:27,622 INFO L280 TraceCheckUtils]: 10: Hoare triple {709#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {709#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-10 14:58:27,622 INFO L263 TraceCheckUtils]: 11: Hoare triple {709#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {615#true} is VALID [2020-07-10 14:58:27,623 INFO L280 TraceCheckUtils]: 12: Hoare triple {615#true} ~x := #in~x; {699#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,623 INFO L280 TraceCheckUtils]: 13: Hoare triple {699#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {699#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:27,624 INFO L263 TraceCheckUtils]: 14: Hoare triple {699#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-10 14:58:27,624 INFO L280 TraceCheckUtils]: 15: Hoare triple {615#true} ~x := #in~x; {709#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-10 14:58:27,625 INFO L280 TraceCheckUtils]: 16: Hoare triple {709#(<= |id2_#in~x| id2_~x)} assume 0 == ~x;#res := 0; {731#(<= |id2_#in~x| 0)} is VALID [2020-07-10 14:58:27,626 INFO L280 TraceCheckUtils]: 17: Hoare triple {731#(<= |id2_#in~x| 0)} assume true; {731#(<= |id2_#in~x| 0)} is VALID [2020-07-10 14:58:27,627 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {731#(<= |id2_#in~x| 0)} {699#(<= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,628 INFO L280 TraceCheckUtils]: 19: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,628 INFO L280 TraceCheckUtils]: 20: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-10 14:58:27,630 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {676#(<= |id_#in~x| 1)} {709#(<= |id2_#in~x| id2_~x)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-10 14:58:27,630 INFO L280 TraceCheckUtils]: 22: Hoare triple {671#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-10 14:58:27,631 INFO L280 TraceCheckUtils]: 23: Hoare triple {671#(<= |id2_#in~x| 2)} assume true; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-10 14:58:27,632 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {671#(<= |id2_#in~x| 2)} {699#(<= |id_#in~x| id_~x)} #42#return; {659#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:58:27,633 INFO L280 TraceCheckUtils]: 25: Hoare triple {659#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {659#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:58:27,633 INFO L280 TraceCheckUtils]: 26: Hoare triple {659#(<= |id_#in~x| 3)} assume true; {659#(<= |id_#in~x| 3)} is VALID [2020-07-10 14:58:27,635 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {659#(<= |id_#in~x| 3)} {619#(<= 5 main_~input~0)} #40#return; {616#false} is VALID [2020-07-10 14:58:27,635 INFO L280 TraceCheckUtils]: 28: Hoare triple {616#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {616#false} is VALID [2020-07-10 14:58:27,635 INFO L280 TraceCheckUtils]: 29: Hoare triple {616#false} assume 5 != ~result~0; {616#false} is VALID [2020-07-10 14:58:27,635 INFO L280 TraceCheckUtils]: 30: Hoare triple {616#false} assume !false; {616#false} is VALID [2020-07-10 14:58:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-10 14:58:27,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:58:27,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-07-10 14:58:27,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880738129] [2020-07-10 14:58:27,638 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-10 14:58:27,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:27,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 14:58:27,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:27,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 14:58:27,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:27,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 14:58:27,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-07-10 14:58:27,682 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 12 states. [2020-07-10 14:58:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:28,075 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-10 14:58:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 14:58:28,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-10 14:58:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:58:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-10 14:58:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:58:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-10 14:58:28,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 39 transitions. [2020-07-10 14:58:28,141 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-10 14:58:28,145 INFO L225 Difference]: With dead ends: 45 [2020-07-10 14:58:28,145 INFO L226 Difference]: Without dead ends: 41 [2020-07-10 14:58:28,147 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-07-10 14:58:28,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-10 14:58:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2020-07-10 14:58:28,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:28,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 33 states. [2020-07-10 14:58:28,161 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 33 states. [2020-07-10 14:58:28,161 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 33 states. [2020-07-10 14:58:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:28,164 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-10 14:58:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-10 14:58:28,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:28,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:28,165 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 41 states. [2020-07-10 14:58:28,165 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 41 states. [2020-07-10 14:58:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:28,168 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-10 14:58:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-10 14:58:28,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:28,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:28,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:28,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 14:58:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-07-10 14:58:28,171 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2020-07-10 14:58:28,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:28,172 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-07-10 14:58:28,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 14:58:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-10 14:58:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 14:58:28,173 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:28,173 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:28,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:28,387 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:28,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:28,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2003326827, now seen corresponding path program 2 times [2020-07-10 14:58:28,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:28,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074544700] [2020-07-10 14:58:28,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:28,424 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-10 14:58:28,424 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {959#true} {959#true} #36#return; {959#true} is VALID [2020-07-10 14:58:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:28,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:28,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:28,562 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,563 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,564 INFO L263 TraceCheckUtils]: 2: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,565 INFO L280 TraceCheckUtils]: 3: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,565 INFO L280 TraceCheckUtils]: 4: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:28,566 INFO L280 TraceCheckUtils]: 5: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:28,567 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,568 INFO L280 TraceCheckUtils]: 7: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,568 INFO L280 TraceCheckUtils]: 8: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,570 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,572 INFO L263 TraceCheckUtils]: 2: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,572 INFO L280 TraceCheckUtils]: 3: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,573 INFO L280 TraceCheckUtils]: 4: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,573 INFO L263 TraceCheckUtils]: 5: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,574 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,574 INFO L280 TraceCheckUtils]: 7: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:28,575 INFO L280 TraceCheckUtils]: 8: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:28,576 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,577 INFO L280 TraceCheckUtils]: 10: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,577 INFO L280 TraceCheckUtils]: 11: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,578 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,579 INFO L280 TraceCheckUtils]: 13: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,580 INFO L280 TraceCheckUtils]: 14: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,581 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-10 14:58:28,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,583 INFO L263 TraceCheckUtils]: 2: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,584 INFO L280 TraceCheckUtils]: 3: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,584 INFO L280 TraceCheckUtils]: 4: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,584 INFO L263 TraceCheckUtils]: 5: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,585 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,586 INFO L280 TraceCheckUtils]: 7: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,586 INFO L263 TraceCheckUtils]: 8: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,586 INFO L280 TraceCheckUtils]: 9: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,587 INFO L280 TraceCheckUtils]: 10: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:28,588 INFO L280 TraceCheckUtils]: 11: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:28,589 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,589 INFO L280 TraceCheckUtils]: 13: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,590 INFO L280 TraceCheckUtils]: 14: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,591 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,592 INFO L280 TraceCheckUtils]: 16: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,592 INFO L280 TraceCheckUtils]: 17: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,594 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-10 14:58:28,595 INFO L280 TraceCheckUtils]: 19: Hoare triple {1033#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-10 14:58:28,596 INFO L280 TraceCheckUtils]: 20: Hoare triple {1033#(<= |id2_#in~x| 3)} assume true; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-10 14:58:28,597 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1033#(<= |id2_#in~x| 3)} {992#(= |id_#in~x| id_~x)} #42#return; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:58:28,599 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,601 INFO L263 TraceCheckUtils]: 2: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,601 INFO L280 TraceCheckUtils]: 3: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,602 INFO L263 TraceCheckUtils]: 5: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,604 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,604 INFO L280 TraceCheckUtils]: 7: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,605 INFO L263 TraceCheckUtils]: 8: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,607 INFO L280 TraceCheckUtils]: 10: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,608 INFO L263 TraceCheckUtils]: 11: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,608 INFO L280 TraceCheckUtils]: 12: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,610 INFO L280 TraceCheckUtils]: 13: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:28,614 INFO L280 TraceCheckUtils]: 14: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:28,617 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,618 INFO L280 TraceCheckUtils]: 16: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,618 INFO L280 TraceCheckUtils]: 17: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,620 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,621 INFO L280 TraceCheckUtils]: 19: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,622 INFO L280 TraceCheckUtils]: 20: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,623 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-10 14:58:28,624 INFO L280 TraceCheckUtils]: 22: Hoare triple {1033#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-10 14:58:28,624 INFO L280 TraceCheckUtils]: 23: Hoare triple {1033#(<= |id2_#in~x| 3)} assume true; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-10 14:58:28,625 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1033#(<= |id2_#in~x| 3)} {992#(= |id_#in~x| id_~x)} #42#return; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:58:28,626 INFO L280 TraceCheckUtils]: 25: Hoare triple {1015#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:58:28,627 INFO L280 TraceCheckUtils]: 26: Hoare triple {1015#(<= |id_#in~x| 4)} assume true; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:58:28,629 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1015#(<= |id_#in~x| 4)} {963#(<= 5 main_~input~0)} #40#return; {960#false} is VALID [2020-07-10 14:58:28,630 INFO L263 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2020-07-10 14:58:28,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-10 14:58:28,630 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #36#return; {959#true} is VALID [2020-07-10 14:58:28,631 INFO L263 TraceCheckUtils]: 3: Hoare triple {959#true} call #t~ret3 := main(); {959#true} is VALID [2020-07-10 14:58:28,631 INFO L280 TraceCheckUtils]: 4: Hoare triple {959#true} ~input~0 := 5; {963#(<= 5 main_~input~0)} is VALID [2020-07-10 14:58:28,632 INFO L263 TraceCheckUtils]: 5: Hoare triple {963#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {959#true} is VALID [2020-07-10 14:58:28,632 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,633 INFO L280 TraceCheckUtils]: 7: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,640 INFO L263 TraceCheckUtils]: 8: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,641 INFO L280 TraceCheckUtils]: 9: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,642 INFO L280 TraceCheckUtils]: 10: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,643 INFO L263 TraceCheckUtils]: 11: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,645 INFO L280 TraceCheckUtils]: 12: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,646 INFO L280 TraceCheckUtils]: 13: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,647 INFO L263 TraceCheckUtils]: 14: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,650 INFO L280 TraceCheckUtils]: 15: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,651 INFO L280 TraceCheckUtils]: 16: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:28,651 INFO L263 TraceCheckUtils]: 17: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,652 INFO L280 TraceCheckUtils]: 18: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,653 INFO L280 TraceCheckUtils]: 19: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:28,654 INFO L280 TraceCheckUtils]: 20: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:28,655 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,656 INFO L280 TraceCheckUtils]: 22: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,657 INFO L280 TraceCheckUtils]: 23: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,659 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,659 INFO L280 TraceCheckUtils]: 25: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,660 INFO L280 TraceCheckUtils]: 26: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,662 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-10 14:58:28,663 INFO L280 TraceCheckUtils]: 28: Hoare triple {1033#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-10 14:58:28,664 INFO L280 TraceCheckUtils]: 29: Hoare triple {1033#(<= |id2_#in~x| 3)} assume true; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-10 14:58:28,665 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1033#(<= |id2_#in~x| 3)} {992#(= |id_#in~x| id_~x)} #42#return; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:58:28,666 INFO L280 TraceCheckUtils]: 31: Hoare triple {1015#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:58:28,667 INFO L280 TraceCheckUtils]: 32: Hoare triple {1015#(<= |id_#in~x| 4)} assume true; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:58:28,668 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1015#(<= |id_#in~x| 4)} {963#(<= 5 main_~input~0)} #40#return; {960#false} is VALID [2020-07-10 14:58:28,669 INFO L280 TraceCheckUtils]: 34: Hoare triple {960#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {960#false} is VALID [2020-07-10 14:58:28,669 INFO L280 TraceCheckUtils]: 35: Hoare triple {960#false} assume 5 != ~result~0; {960#false} is VALID [2020-07-10 14:58:28,669 INFO L280 TraceCheckUtils]: 36: Hoare triple {960#false} assume !false; {960#false} is VALID [2020-07-10 14:58:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-10 14:58:28,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074544700] [2020-07-10 14:58:28,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39164259] [2020-07-10 14:58:28,672 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:28,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 14:58:28,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:58:28,715 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-10 14:58:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:28,727 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:28,878 INFO L263 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2020-07-10 14:58:28,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-10 14:58:28,878 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #36#return; {959#true} is VALID [2020-07-10 14:58:28,878 INFO L263 TraceCheckUtils]: 3: Hoare triple {959#true} call #t~ret3 := main(); {959#true} is VALID [2020-07-10 14:58:28,879 INFO L280 TraceCheckUtils]: 4: Hoare triple {959#true} ~input~0 := 5; {963#(<= 5 main_~input~0)} is VALID [2020-07-10 14:58:28,879 INFO L263 TraceCheckUtils]: 5: Hoare triple {963#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {959#true} is VALID [2020-07-10 14:58:28,880 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,881 INFO L280 TraceCheckUtils]: 7: Hoare triple {1072#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,881 INFO L263 TraceCheckUtils]: 8: Hoare triple {1072#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,881 INFO L280 TraceCheckUtils]: 9: Hoare triple {959#true} ~x := #in~x; {1082#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-10 14:58:28,882 INFO L280 TraceCheckUtils]: 10: Hoare triple {1082#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {1082#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-10 14:58:28,882 INFO L263 TraceCheckUtils]: 11: Hoare triple {1082#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,883 INFO L280 TraceCheckUtils]: 12: Hoare triple {959#true} ~x := #in~x; {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,884 INFO L280 TraceCheckUtils]: 13: Hoare triple {1072#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,884 INFO L263 TraceCheckUtils]: 14: Hoare triple {1072#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,885 INFO L280 TraceCheckUtils]: 15: Hoare triple {959#true} ~x := #in~x; {1082#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-10 14:58:28,885 INFO L280 TraceCheckUtils]: 16: Hoare triple {1082#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {1082#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-10 14:58:28,885 INFO L263 TraceCheckUtils]: 17: Hoare triple {1082#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-10 14:58:28,891 INFO L280 TraceCheckUtils]: 18: Hoare triple {959#true} ~x := #in~x; {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:28,892 INFO L280 TraceCheckUtils]: 19: Hoare triple {1072#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1113#(<= |id_#in~x| 0)} is VALID [2020-07-10 14:58:28,893 INFO L280 TraceCheckUtils]: 20: Hoare triple {1113#(<= |id_#in~x| 0)} assume true; {1113#(<= |id_#in~x| 0)} is VALID [2020-07-10 14:58:28,895 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1113#(<= |id_#in~x| 0)} {1082#(<= |id2_#in~x| id2_~x)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,896 INFO L280 TraceCheckUtils]: 22: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,896 INFO L280 TraceCheckUtils]: 23: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-10 14:58:28,897 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {1072#(<= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,898 INFO L280 TraceCheckUtils]: 25: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,899 INFO L280 TraceCheckUtils]: 26: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-10 14:58:28,900 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1082#(<= |id2_#in~x| id2_~x)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-10 14:58:28,900 INFO L280 TraceCheckUtils]: 28: Hoare triple {1033#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-10 14:58:28,901 INFO L280 TraceCheckUtils]: 29: Hoare triple {1033#(<= |id2_#in~x| 3)} assume true; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-10 14:58:28,903 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1033#(<= |id2_#in~x| 3)} {1072#(<= |id_#in~x| id_~x)} #42#return; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:58:28,903 INFO L280 TraceCheckUtils]: 31: Hoare triple {1015#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:58:28,904 INFO L280 TraceCheckUtils]: 32: Hoare triple {1015#(<= |id_#in~x| 4)} assume true; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-10 14:58:28,905 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1015#(<= |id_#in~x| 4)} {963#(<= 5 main_~input~0)} #40#return; {960#false} is VALID [2020-07-10 14:58:28,905 INFO L280 TraceCheckUtils]: 34: Hoare triple {960#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {960#false} is VALID [2020-07-10 14:58:28,905 INFO L280 TraceCheckUtils]: 35: Hoare triple {960#false} assume 5 != ~result~0; {960#false} is VALID [2020-07-10 14:58:28,905 INFO L280 TraceCheckUtils]: 36: Hoare triple {960#false} assume !false; {960#false} is VALID [2020-07-10 14:58:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-10 14:58:28,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:58:28,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2020-07-10 14:58:28,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319073600] [2020-07-10 14:58:28,909 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-07-10 14:58:28,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:28,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 14:58:28,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:28,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 14:58:28,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:28,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 14:58:28,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-10 14:58:28,967 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 13 states. [2020-07-10 14:58:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:29,253 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2020-07-10 14:58:29,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 14:58:29,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-07-10 14:58:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 14:58:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-10 14:58:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 14:58:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-10 14:58:29,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2020-07-10 14:58:29,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:29,318 INFO L225 Difference]: With dead ends: 51 [2020-07-10 14:58:29,319 INFO L226 Difference]: Without dead ends: 47 [2020-07-10 14:58:29,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2020-07-10 14:58:29,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-10 14:58:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2020-07-10 14:58:29,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:29,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 36 states. [2020-07-10 14:58:29,334 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 36 states. [2020-07-10 14:58:29,334 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 36 states. [2020-07-10 14:58:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:29,337 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2020-07-10 14:58:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-07-10 14:58:29,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:29,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:29,339 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 47 states. [2020-07-10 14:58:29,339 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 47 states. [2020-07-10 14:58:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:29,343 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2020-07-10 14:58:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-07-10 14:58:29,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:29,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:29,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:29,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 14:58:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-10 14:58:29,348 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 37 [2020-07-10 14:58:29,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:29,348 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-10 14:58:29,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 14:58:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-10 14:58:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 14:58:29,349 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:29,350 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:29,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:29,556 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:29,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:29,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1197899385, now seen corresponding path program 2 times [2020-07-10 14:58:29,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:29,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834052585] [2020-07-10 14:58:29,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:29,631 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} assume true; {1373#true} is VALID [2020-07-10 14:58:29,631 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1373#true} {1373#true} #36#return; {1373#true} is VALID [2020-07-10 14:58:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:29,930 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:29,932 INFO L280 TraceCheckUtils]: 2: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:29,933 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:29,933 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,934 INFO L263 TraceCheckUtils]: 2: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,934 INFO L280 TraceCheckUtils]: 3: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,935 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:29,936 INFO L280 TraceCheckUtils]: 5: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:29,937 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:29,938 INFO L280 TraceCheckUtils]: 7: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:29,938 INFO L280 TraceCheckUtils]: 8: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:29,939 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-10 14:58:29,940 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,940 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,940 INFO L263 TraceCheckUtils]: 2: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,941 INFO L280 TraceCheckUtils]: 3: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,941 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,941 INFO L263 TraceCheckUtils]: 5: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,941 INFO L280 TraceCheckUtils]: 6: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,942 INFO L280 TraceCheckUtils]: 7: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:29,943 INFO L280 TraceCheckUtils]: 8: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:29,944 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:29,946 INFO L280 TraceCheckUtils]: 10: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:29,946 INFO L280 TraceCheckUtils]: 11: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:29,947 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-10 14:58:29,948 INFO L280 TraceCheckUtils]: 13: Hoare triple {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-10 14:58:29,949 INFO L280 TraceCheckUtils]: 14: Hoare triple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-10 14:58:29,950 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1373#true} #42#return; {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-10 14:58:29,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,951 INFO L263 TraceCheckUtils]: 2: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,952 INFO L280 TraceCheckUtils]: 3: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,952 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,952 INFO L263 TraceCheckUtils]: 5: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,953 INFO L280 TraceCheckUtils]: 6: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,953 INFO L280 TraceCheckUtils]: 7: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,953 INFO L263 TraceCheckUtils]: 8: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,954 INFO L280 TraceCheckUtils]: 9: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,955 INFO L280 TraceCheckUtils]: 10: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:29,956 INFO L280 TraceCheckUtils]: 11: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:29,957 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:29,959 INFO L280 TraceCheckUtils]: 13: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:29,960 INFO L280 TraceCheckUtils]: 14: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:29,961 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-10 14:58:29,963 INFO L280 TraceCheckUtils]: 16: Hoare triple {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-10 14:58:29,963 INFO L280 TraceCheckUtils]: 17: Hoare triple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-10 14:58:29,965 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1373#true} #42#return; {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-10 14:58:29,966 INFO L280 TraceCheckUtils]: 19: Hoare triple {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:58:29,967 INFO L280 TraceCheckUtils]: 20: Hoare triple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:58:29,968 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1373#true} #34#return; {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-10 14:58:29,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,970 INFO L263 TraceCheckUtils]: 2: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,971 INFO L280 TraceCheckUtils]: 3: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,971 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,971 INFO L263 TraceCheckUtils]: 5: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,971 INFO L280 TraceCheckUtils]: 6: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,971 INFO L280 TraceCheckUtils]: 7: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,972 INFO L263 TraceCheckUtils]: 8: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,972 INFO L280 TraceCheckUtils]: 9: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,972 INFO L280 TraceCheckUtils]: 10: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,972 INFO L263 TraceCheckUtils]: 11: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,973 INFO L280 TraceCheckUtils]: 12: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,973 INFO L280 TraceCheckUtils]: 13: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:29,974 INFO L280 TraceCheckUtils]: 14: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:29,975 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:29,976 INFO L280 TraceCheckUtils]: 16: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:29,977 INFO L280 TraceCheckUtils]: 17: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:29,978 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-10 14:58:29,980 INFO L280 TraceCheckUtils]: 19: Hoare triple {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-10 14:58:29,981 INFO L280 TraceCheckUtils]: 20: Hoare triple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-10 14:58:29,982 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1373#true} #42#return; {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-10 14:58:29,983 INFO L280 TraceCheckUtils]: 22: Hoare triple {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:58:29,984 INFO L280 TraceCheckUtils]: 23: Hoare triple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:58:29,985 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1373#true} #34#return; {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-10 14:58:29,986 INFO L280 TraceCheckUtils]: 25: Hoare triple {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-10 14:58:29,987 INFO L280 TraceCheckUtils]: 26: Hoare triple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-10 14:58:29,988 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1373#true} #42#return; {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-10 14:58:29,991 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,991 INFO L263 TraceCheckUtils]: 2: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,992 INFO L280 TraceCheckUtils]: 3: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,992 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,992 INFO L263 TraceCheckUtils]: 5: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,992 INFO L280 TraceCheckUtils]: 6: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,993 INFO L280 TraceCheckUtils]: 7: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,993 INFO L263 TraceCheckUtils]: 8: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,993 INFO L280 TraceCheckUtils]: 9: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,994 INFO L280 TraceCheckUtils]: 10: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,994 INFO L263 TraceCheckUtils]: 11: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,994 INFO L280 TraceCheckUtils]: 12: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,994 INFO L280 TraceCheckUtils]: 13: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:29,995 INFO L263 TraceCheckUtils]: 14: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:29,995 INFO L280 TraceCheckUtils]: 15: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:29,996 INFO L280 TraceCheckUtils]: 16: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:29,997 INFO L280 TraceCheckUtils]: 17: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:29,998 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:29,999 INFO L280 TraceCheckUtils]: 19: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:30,000 INFO L280 TraceCheckUtils]: 20: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:30,001 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-10 14:58:30,002 INFO L280 TraceCheckUtils]: 22: Hoare triple {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-10 14:58:30,003 INFO L280 TraceCheckUtils]: 23: Hoare triple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-10 14:58:30,004 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1373#true} #42#return; {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-10 14:58:30,005 INFO L280 TraceCheckUtils]: 25: Hoare triple {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:58:30,005 INFO L280 TraceCheckUtils]: 26: Hoare triple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:58:30,006 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1373#true} #34#return; {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-10 14:58:30,007 INFO L280 TraceCheckUtils]: 28: Hoare triple {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-10 14:58:30,008 INFO L280 TraceCheckUtils]: 29: Hoare triple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-10 14:58:30,019 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1373#true} #42#return; {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-10 14:58:30,022 INFO L280 TraceCheckUtils]: 31: Hoare triple {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-10 14:58:30,028 INFO L280 TraceCheckUtils]: 32: Hoare triple {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-10 14:58:30,030 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1373#true} #40#return; {1411#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} is VALID [2020-07-10 14:58:30,032 INFO L263 TraceCheckUtils]: 0: Hoare triple {1373#true} call ULTIMATE.init(); {1373#true} is VALID [2020-07-10 14:58:30,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume true; {1373#true} is VALID [2020-07-10 14:58:30,032 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1373#true} {1373#true} #36#return; {1373#true} is VALID [2020-07-10 14:58:30,032 INFO L263 TraceCheckUtils]: 3: Hoare triple {1373#true} call #t~ret3 := main(); {1373#true} is VALID [2020-07-10 14:58:30,033 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} ~input~0 := 5; {1373#true} is VALID [2020-07-10 14:58:30,033 INFO L263 TraceCheckUtils]: 5: Hoare triple {1373#true} call #t~ret2 := id(~input~0); {1373#true} is VALID [2020-07-10 14:58:30,033 INFO L280 TraceCheckUtils]: 6: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:30,033 INFO L280 TraceCheckUtils]: 7: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:30,033 INFO L263 TraceCheckUtils]: 8: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:30,033 INFO L280 TraceCheckUtils]: 9: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:30,034 INFO L280 TraceCheckUtils]: 10: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:30,034 INFO L263 TraceCheckUtils]: 11: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-10 14:58:30,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:30,034 INFO L280 TraceCheckUtils]: 13: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:30,034 INFO L263 TraceCheckUtils]: 14: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:30,035 INFO L280 TraceCheckUtils]: 15: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:30,035 INFO L280 TraceCheckUtils]: 16: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:30,035 INFO L263 TraceCheckUtils]: 17: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-10 14:58:30,035 INFO L280 TraceCheckUtils]: 18: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:30,035 INFO L280 TraceCheckUtils]: 19: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:30,035 INFO L263 TraceCheckUtils]: 20: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:30,036 INFO L280 TraceCheckUtils]: 21: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:30,038 INFO L280 TraceCheckUtils]: 22: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:30,039 INFO L280 TraceCheckUtils]: 23: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:30,040 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:30,041 INFO L280 TraceCheckUtils]: 25: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:30,042 INFO L280 TraceCheckUtils]: 26: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:30,043 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-10 14:58:30,045 INFO L280 TraceCheckUtils]: 28: Hoare triple {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-10 14:58:30,045 INFO L280 TraceCheckUtils]: 29: Hoare triple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-10 14:58:30,047 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1373#true} #42#return; {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-10 14:58:30,048 INFO L280 TraceCheckUtils]: 31: Hoare triple {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:58:30,049 INFO L280 TraceCheckUtils]: 32: Hoare triple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:58:30,050 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1373#true} #34#return; {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-10 14:58:30,052 INFO L280 TraceCheckUtils]: 34: Hoare triple {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-10 14:58:30,053 INFO L280 TraceCheckUtils]: 35: Hoare triple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-10 14:58:30,054 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1373#true} #42#return; {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-10 14:58:30,055 INFO L280 TraceCheckUtils]: 37: Hoare triple {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-10 14:58:30,056 INFO L280 TraceCheckUtils]: 38: Hoare triple {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-10 14:58:30,057 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1373#true} #40#return; {1411#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} is VALID [2020-07-10 14:58:30,057 INFO L280 TraceCheckUtils]: 40: Hoare triple {1411#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {1412#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-10 14:58:30,058 INFO L280 TraceCheckUtils]: 41: Hoare triple {1412#(and (< 4 main_~result~0) (<= main_~result~0 5))} assume 5 != ~result~0; {1374#false} is VALID [2020-07-10 14:58:30,058 INFO L280 TraceCheckUtils]: 42: Hoare triple {1374#false} assume !false; {1374#false} is VALID [2020-07-10 14:58:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-10 14:58:30,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834052585] [2020-07-10 14:58:30,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991455827] [2020-07-10 14:58:30,064 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:30,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 14:58:30,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:58:30,111 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-10 14:58:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:30,130 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:30,331 INFO L263 TraceCheckUtils]: 0: Hoare triple {1373#true} call ULTIMATE.init(); {1373#true} is VALID [2020-07-10 14:58:30,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#true} assume true; {1373#true} is VALID [2020-07-10 14:58:30,332 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1373#true} {1373#true} #36#return; {1373#true} is VALID [2020-07-10 14:58:30,332 INFO L263 TraceCheckUtils]: 3: Hoare triple {1373#true} call #t~ret3 := main(); {1373#true} is VALID [2020-07-10 14:58:30,332 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#true} ~input~0 := 5; {1373#true} is VALID [2020-07-10 14:58:30,332 INFO L263 TraceCheckUtils]: 5: Hoare triple {1373#true} call #t~ret2 := id(~input~0); {1373#true} is VALID [2020-07-10 14:58:30,332 INFO L280 TraceCheckUtils]: 6: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:30,333 INFO L280 TraceCheckUtils]: 7: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:30,333 INFO L263 TraceCheckUtils]: 8: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:30,333 INFO L280 TraceCheckUtils]: 9: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:30,333 INFO L280 TraceCheckUtils]: 10: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:30,333 INFO L263 TraceCheckUtils]: 11: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-10 14:58:30,334 INFO L280 TraceCheckUtils]: 12: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:30,334 INFO L280 TraceCheckUtils]: 13: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:30,334 INFO L263 TraceCheckUtils]: 14: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:30,334 INFO L280 TraceCheckUtils]: 15: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:30,334 INFO L280 TraceCheckUtils]: 16: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:30,334 INFO L263 TraceCheckUtils]: 17: Hoare triple {1373#true} call #t~ret1 := id(~x - 1); {1373#true} is VALID [2020-07-10 14:58:30,335 INFO L280 TraceCheckUtils]: 18: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:30,335 INFO L280 TraceCheckUtils]: 19: Hoare triple {1373#true} assume !(0 == ~x); {1373#true} is VALID [2020-07-10 14:58:30,335 INFO L263 TraceCheckUtils]: 20: Hoare triple {1373#true} call #t~ret0 := id2(~x - 1); {1373#true} is VALID [2020-07-10 14:58:30,337 INFO L280 TraceCheckUtils]: 21: Hoare triple {1373#true} ~x := #in~x; {1373#true} is VALID [2020-07-10 14:58:30,338 INFO L280 TraceCheckUtils]: 22: Hoare triple {1373#true} assume 0 == ~x;#res := 0; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:30,338 INFO L280 TraceCheckUtils]: 23: Hoare triple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} assume true; {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} is VALID [2020-07-10 14:58:30,339 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1503#(and (<= 0 |id2_#res|) (<= |id2_#res| 0))} {1373#true} #42#return; {1501#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:30,340 INFO L280 TraceCheckUtils]: 25: Hoare triple {1501#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:30,341 INFO L280 TraceCheckUtils]: 26: Hoare triple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-10 14:58:30,342 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1502#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1373#true} #34#return; {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} is VALID [2020-07-10 14:58:30,343 INFO L280 TraceCheckUtils]: 28: Hoare triple {1495#(and (<= 1 |id2_#t~ret1|) (<= |id2_#t~ret1| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-10 14:58:30,344 INFO L280 TraceCheckUtils]: 29: Hoare triple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} assume true; {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} is VALID [2020-07-10 14:58:30,345 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1496#(and (<= 2 |id2_#res|) (<= |id2_#res| 2))} {1373#true} #42#return; {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-10 14:58:30,346 INFO L280 TraceCheckUtils]: 31: Hoare triple {1483#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:58:30,346 INFO L280 TraceCheckUtils]: 32: Hoare triple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-10 14:58:30,347 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1484#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1373#true} #34#return; {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} is VALID [2020-07-10 14:58:30,352 INFO L280 TraceCheckUtils]: 34: Hoare triple {1465#(and (<= |id2_#t~ret1| 3) (<= 3 |id2_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-10 14:58:30,353 INFO L280 TraceCheckUtils]: 35: Hoare triple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} assume true; {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} is VALID [2020-07-10 14:58:30,354 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1466#(and (<= |id2_#res| 4) (<= 4 |id2_#res|))} {1373#true} #42#return; {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-10 14:58:30,355 INFO L280 TraceCheckUtils]: 37: Hoare triple {1441#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-10 14:58:30,356 INFO L280 TraceCheckUtils]: 38: Hoare triple {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-10 14:58:30,357 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1442#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1373#true} #40#return; {1411#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} is VALID [2020-07-10 14:58:30,358 INFO L280 TraceCheckUtils]: 40: Hoare triple {1411#(and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {1412#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-10 14:58:30,359 INFO L280 TraceCheckUtils]: 41: Hoare triple {1412#(and (< 4 main_~result~0) (<= main_~result~0 5))} assume 5 != ~result~0; {1374#false} is VALID [2020-07-10 14:58:30,359 INFO L280 TraceCheckUtils]: 42: Hoare triple {1374#false} assume !false; {1374#false} is VALID [2020-07-10 14:58:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-10 14:58:30,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:58:30,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2020-07-10 14:58:30,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042551956] [2020-07-10 14:58:30,363 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2020-07-10 14:58:30,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:30,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 14:58:30,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:30,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 14:58:30,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:30,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 14:58:30,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-10 14:58:30,413 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 15 states. [2020-07-10 14:58:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:30,962 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2020-07-10 14:58:30,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 14:58:30,963 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2020-07-10 14:58:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:58:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2020-07-10 14:58:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:58:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2020-07-10 14:58:30,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 45 transitions. [2020-07-10 14:58:31,031 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-10 14:58:31,033 INFO L225 Difference]: With dead ends: 57 [2020-07-10 14:58:31,035 INFO L226 Difference]: Without dead ends: 53 [2020-07-10 14:58:31,036 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-10 14:58:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-10 14:58:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2020-07-10 14:58:31,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:31,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 39 states. [2020-07-10 14:58:31,049 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 39 states. [2020-07-10 14:58:31,049 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 39 states. [2020-07-10 14:58:31,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:31,057 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-10 14:58:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-10 14:58:31,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:31,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:31,058 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 53 states. [2020-07-10 14:58:31,058 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 53 states. [2020-07-10 14:58:31,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:31,063 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-10 14:58:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-10 14:58:31,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:31,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:31,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:31,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:31,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 14:58:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-07-10 14:58:31,067 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 43 [2020-07-10 14:58:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:31,068 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-07-10 14:58:31,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 14:58:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-10 14:58:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 14:58:31,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:31,069 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:31,282 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:31,283 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:31,284 INFO L82 PathProgramCache]: Analyzing trace with hash 706413819, now seen corresponding path program 3 times [2020-07-10 14:58:31,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:31,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554745369] [2020-07-10 14:58:31,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:31,316 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} assume true; {1852#true} is VALID [2020-07-10 14:58:31,317 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1852#true} {1852#true} #36#return; {1852#true} is VALID [2020-07-10 14:58:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:31,482 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,483 INFO L280 TraceCheckUtils]: 1: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,485 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,486 INFO L263 TraceCheckUtils]: 2: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,487 INFO L280 TraceCheckUtils]: 3: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,487 INFO L280 TraceCheckUtils]: 4: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,488 INFO L280 TraceCheckUtils]: 5: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,489 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,489 INFO L280 TraceCheckUtils]: 7: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,490 INFO L280 TraceCheckUtils]: 8: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,491 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,492 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,493 INFO L263 TraceCheckUtils]: 2: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,493 INFO L280 TraceCheckUtils]: 3: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,494 INFO L280 TraceCheckUtils]: 4: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,494 INFO L263 TraceCheckUtils]: 5: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,495 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,495 INFO L280 TraceCheckUtils]: 7: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,496 INFO L280 TraceCheckUtils]: 8: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,497 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,497 INFO L280 TraceCheckUtils]: 10: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,498 INFO L280 TraceCheckUtils]: 11: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,499 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,500 INFO L280 TraceCheckUtils]: 13: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,500 INFO L280 TraceCheckUtils]: 14: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,502 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,502 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,503 INFO L263 TraceCheckUtils]: 2: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,504 INFO L280 TraceCheckUtils]: 3: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,504 INFO L280 TraceCheckUtils]: 4: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,504 INFO L263 TraceCheckUtils]: 5: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,505 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,506 INFO L280 TraceCheckUtils]: 7: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,506 INFO L263 TraceCheckUtils]: 8: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,506 INFO L280 TraceCheckUtils]: 9: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,507 INFO L280 TraceCheckUtils]: 10: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,508 INFO L280 TraceCheckUtils]: 11: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,509 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,509 INFO L280 TraceCheckUtils]: 13: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,510 INFO L280 TraceCheckUtils]: 14: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,511 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,511 INFO L280 TraceCheckUtils]: 16: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,512 INFO L280 TraceCheckUtils]: 17: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,513 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,514 INFO L280 TraceCheckUtils]: 19: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,514 INFO L280 TraceCheckUtils]: 20: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume true; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,515 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2002#(<= 3 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,517 INFO L280 TraceCheckUtils]: 1: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,517 INFO L263 TraceCheckUtils]: 2: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,518 INFO L280 TraceCheckUtils]: 3: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,518 INFO L280 TraceCheckUtils]: 4: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,519 INFO L263 TraceCheckUtils]: 5: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,519 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,520 INFO L280 TraceCheckUtils]: 7: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,520 INFO L263 TraceCheckUtils]: 8: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,520 INFO L280 TraceCheckUtils]: 9: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,521 INFO L280 TraceCheckUtils]: 10: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,521 INFO L263 TraceCheckUtils]: 11: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,522 INFO L280 TraceCheckUtils]: 12: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,522 INFO L280 TraceCheckUtils]: 13: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,523 INFO L280 TraceCheckUtils]: 14: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,524 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,524 INFO L280 TraceCheckUtils]: 16: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,525 INFO L280 TraceCheckUtils]: 17: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,526 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,527 INFO L280 TraceCheckUtils]: 19: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,527 INFO L280 TraceCheckUtils]: 20: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,528 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,529 INFO L280 TraceCheckUtils]: 22: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,529 INFO L280 TraceCheckUtils]: 23: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume true; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,530 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2002#(<= 3 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,531 INFO L280 TraceCheckUtils]: 25: Hoare triple {1985#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,532 INFO L280 TraceCheckUtils]: 26: Hoare triple {1985#(<= 4 |id_#in~x|)} assume true; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,533 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1985#(<= 4 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,534 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,535 INFO L263 TraceCheckUtils]: 2: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,535 INFO L280 TraceCheckUtils]: 3: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,536 INFO L280 TraceCheckUtils]: 4: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,536 INFO L263 TraceCheckUtils]: 5: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,537 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,537 INFO L280 TraceCheckUtils]: 7: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,537 INFO L263 TraceCheckUtils]: 8: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,538 INFO L280 TraceCheckUtils]: 9: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,538 INFO L280 TraceCheckUtils]: 10: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,539 INFO L263 TraceCheckUtils]: 11: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,539 INFO L280 TraceCheckUtils]: 12: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,540 INFO L280 TraceCheckUtils]: 13: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,540 INFO L263 TraceCheckUtils]: 14: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,540 INFO L280 TraceCheckUtils]: 15: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,541 INFO L280 TraceCheckUtils]: 16: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,541 INFO L280 TraceCheckUtils]: 17: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,543 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,543 INFO L280 TraceCheckUtils]: 19: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,544 INFO L280 TraceCheckUtils]: 20: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,545 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,545 INFO L280 TraceCheckUtils]: 22: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,546 INFO L280 TraceCheckUtils]: 23: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,547 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,548 INFO L280 TraceCheckUtils]: 25: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,548 INFO L280 TraceCheckUtils]: 26: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume true; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,549 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2002#(<= 3 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,550 INFO L280 TraceCheckUtils]: 28: Hoare triple {1985#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,550 INFO L280 TraceCheckUtils]: 29: Hoare triple {1985#(<= 4 |id_#in~x|)} assume true; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,552 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1985#(<= 4 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,552 INFO L280 TraceCheckUtils]: 31: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,553 INFO L280 TraceCheckUtils]: 32: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume true; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,554 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1962#(<= 5 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:58:31,555 INFO L280 TraceCheckUtils]: 0: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,556 INFO L280 TraceCheckUtils]: 1: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,556 INFO L263 TraceCheckUtils]: 2: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,557 INFO L280 TraceCheckUtils]: 3: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,557 INFO L280 TraceCheckUtils]: 4: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,557 INFO L263 TraceCheckUtils]: 5: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,558 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,558 INFO L280 TraceCheckUtils]: 7: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,559 INFO L263 TraceCheckUtils]: 8: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,559 INFO L280 TraceCheckUtils]: 9: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,559 INFO L280 TraceCheckUtils]: 10: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,560 INFO L263 TraceCheckUtils]: 11: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,560 INFO L280 TraceCheckUtils]: 12: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,561 INFO L280 TraceCheckUtils]: 13: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,561 INFO L263 TraceCheckUtils]: 14: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,561 INFO L280 TraceCheckUtils]: 15: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,562 INFO L280 TraceCheckUtils]: 16: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,562 INFO L263 TraceCheckUtils]: 17: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,563 INFO L280 TraceCheckUtils]: 18: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,563 INFO L280 TraceCheckUtils]: 19: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,564 INFO L280 TraceCheckUtils]: 20: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,565 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,565 INFO L280 TraceCheckUtils]: 22: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,566 INFO L280 TraceCheckUtils]: 23: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,567 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,568 INFO L280 TraceCheckUtils]: 25: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,568 INFO L280 TraceCheckUtils]: 26: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,569 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,570 INFO L280 TraceCheckUtils]: 28: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,570 INFO L280 TraceCheckUtils]: 29: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume true; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,571 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2002#(<= 3 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,572 INFO L280 TraceCheckUtils]: 31: Hoare triple {1985#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,572 INFO L280 TraceCheckUtils]: 32: Hoare triple {1985#(<= 4 |id_#in~x|)} assume true; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,573 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1985#(<= 4 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,574 INFO L280 TraceCheckUtils]: 34: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,574 INFO L280 TraceCheckUtils]: 35: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume true; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,576 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1962#(<= 5 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:58:31,576 INFO L280 TraceCheckUtils]: 37: Hoare triple {1932#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:58:31,577 INFO L280 TraceCheckUtils]: 38: Hoare triple {1932#(<= 6 |id_#in~x|)} assume true; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:58:31,578 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1932#(<= 6 |id_#in~x|)} {1856#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #40#return; {1853#false} is VALID [2020-07-10 14:58:31,579 INFO L263 TraceCheckUtils]: 0: Hoare triple {1852#true} call ULTIMATE.init(); {1852#true} is VALID [2020-07-10 14:58:31,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {1852#true} assume true; {1852#true} is VALID [2020-07-10 14:58:31,580 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1852#true} {1852#true} #36#return; {1852#true} is VALID [2020-07-10 14:58:31,580 INFO L263 TraceCheckUtils]: 3: Hoare triple {1852#true} call #t~ret3 := main(); {1852#true} is VALID [2020-07-10 14:58:31,581 INFO L280 TraceCheckUtils]: 4: Hoare triple {1852#true} ~input~0 := 5; {1856#(and (<= main_~input~0 5) (<= 5 main_~input~0))} is VALID [2020-07-10 14:58:31,581 INFO L263 TraceCheckUtils]: 5: Hoare triple {1856#(and (<= main_~input~0 5) (<= 5 main_~input~0))} call #t~ret2 := id(~input~0); {1852#true} is VALID [2020-07-10 14:58:31,581 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,582 INFO L280 TraceCheckUtils]: 7: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,582 INFO L263 TraceCheckUtils]: 8: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,583 INFO L280 TraceCheckUtils]: 9: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,583 INFO L280 TraceCheckUtils]: 10: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,583 INFO L263 TraceCheckUtils]: 11: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,584 INFO L280 TraceCheckUtils]: 12: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,584 INFO L280 TraceCheckUtils]: 13: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,584 INFO L263 TraceCheckUtils]: 14: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,585 INFO L280 TraceCheckUtils]: 15: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,585 INFO L280 TraceCheckUtils]: 16: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,586 INFO L263 TraceCheckUtils]: 17: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,586 INFO L280 TraceCheckUtils]: 18: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,587 INFO L280 TraceCheckUtils]: 19: Hoare triple {1897#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,587 INFO L263 TraceCheckUtils]: 20: Hoare triple {1897#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,587 INFO L280 TraceCheckUtils]: 21: Hoare triple {1852#true} ~x := #in~x; {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,588 INFO L280 TraceCheckUtils]: 22: Hoare triple {1933#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1933#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,588 INFO L263 TraceCheckUtils]: 23: Hoare triple {1933#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,589 INFO L280 TraceCheckUtils]: 24: Hoare triple {1852#true} ~x := #in~x; {1897#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:31,589 INFO L280 TraceCheckUtils]: 25: Hoare triple {1897#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,590 INFO L280 TraceCheckUtils]: 26: Hoare triple {2019#(= 0 |id_#in~x|)} assume true; {2019#(= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,591 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2019#(= 0 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,591 INFO L280 TraceCheckUtils]: 28: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,592 INFO L280 TraceCheckUtils]: 29: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,593 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,594 INFO L280 TraceCheckUtils]: 31: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,594 INFO L280 TraceCheckUtils]: 32: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,595 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,596 INFO L280 TraceCheckUtils]: 34: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,596 INFO L280 TraceCheckUtils]: 35: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume true; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,597 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2002#(<= 3 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,598 INFO L280 TraceCheckUtils]: 37: Hoare triple {1985#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,598 INFO L280 TraceCheckUtils]: 38: Hoare triple {1985#(<= 4 |id_#in~x|)} assume true; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,599 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1985#(<= 4 |id_#in~x|)} {1933#(= id2_~x |id2_#in~x|)} #34#return; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,600 INFO L280 TraceCheckUtils]: 40: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,601 INFO L280 TraceCheckUtils]: 41: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume true; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,602 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1962#(<= 5 |id2_#in~x|)} {1897#(= |id_#in~x| id_~x)} #42#return; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:58:31,602 INFO L280 TraceCheckUtils]: 43: Hoare triple {1932#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:58:31,603 INFO L280 TraceCheckUtils]: 44: Hoare triple {1932#(<= 6 |id_#in~x|)} assume true; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:58:31,604 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1932#(<= 6 |id_#in~x|)} {1856#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #40#return; {1853#false} is VALID [2020-07-10 14:58:31,604 INFO L280 TraceCheckUtils]: 46: Hoare triple {1853#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {1853#false} is VALID [2020-07-10 14:58:31,604 INFO L280 TraceCheckUtils]: 47: Hoare triple {1853#false} assume 5 != ~result~0; {1853#false} is VALID [2020-07-10 14:58:31,604 INFO L280 TraceCheckUtils]: 48: Hoare triple {1853#false} assume !false; {1853#false} is VALID [2020-07-10 14:58:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-10 14:58:31,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554745369] [2020-07-10 14:58:31,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029091480] [2020-07-10 14:58:31,607 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:31,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-10 14:58:31,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:58:31,645 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-10 14:58:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:31,664 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:31,918 INFO L263 TraceCheckUtils]: 0: Hoare triple {1852#true} call ULTIMATE.init(); {1852#true} is VALID [2020-07-10 14:58:31,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {1852#true} assume true; {1852#true} is VALID [2020-07-10 14:58:31,919 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1852#true} {1852#true} #36#return; {1852#true} is VALID [2020-07-10 14:58:31,919 INFO L263 TraceCheckUtils]: 3: Hoare triple {1852#true} call #t~ret3 := main(); {1852#true} is VALID [2020-07-10 14:58:31,920 INFO L280 TraceCheckUtils]: 4: Hoare triple {1852#true} ~input~0 := 5; {2035#(<= main_~input~0 5)} is VALID [2020-07-10 14:58:31,921 INFO L263 TraceCheckUtils]: 5: Hoare triple {2035#(<= main_~input~0 5)} call #t~ret2 := id(~input~0); {1852#true} is VALID [2020-07-10 14:58:31,921 INFO L280 TraceCheckUtils]: 6: Hoare triple {1852#true} ~x := #in~x; {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:31,922 INFO L280 TraceCheckUtils]: 7: Hoare triple {2042#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:31,922 INFO L263 TraceCheckUtils]: 8: Hoare triple {2042#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,922 INFO L280 TraceCheckUtils]: 9: Hoare triple {1852#true} ~x := #in~x; {2052#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,923 INFO L280 TraceCheckUtils]: 10: Hoare triple {2052#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2052#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,923 INFO L263 TraceCheckUtils]: 11: Hoare triple {2052#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,924 INFO L280 TraceCheckUtils]: 12: Hoare triple {1852#true} ~x := #in~x; {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:31,924 INFO L280 TraceCheckUtils]: 13: Hoare triple {2042#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:31,924 INFO L263 TraceCheckUtils]: 14: Hoare triple {2042#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,925 INFO L280 TraceCheckUtils]: 15: Hoare triple {1852#true} ~x := #in~x; {2052#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,925 INFO L280 TraceCheckUtils]: 16: Hoare triple {2052#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2052#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,925 INFO L263 TraceCheckUtils]: 17: Hoare triple {2052#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,926 INFO L280 TraceCheckUtils]: 18: Hoare triple {1852#true} ~x := #in~x; {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:31,929 INFO L280 TraceCheckUtils]: 19: Hoare triple {2042#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:31,929 INFO L263 TraceCheckUtils]: 20: Hoare triple {2042#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,930 INFO L280 TraceCheckUtils]: 21: Hoare triple {1852#true} ~x := #in~x; {2052#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,931 INFO L280 TraceCheckUtils]: 22: Hoare triple {2052#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2052#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:31,932 INFO L263 TraceCheckUtils]: 23: Hoare triple {2052#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1852#true} is VALID [2020-07-10 14:58:31,933 INFO L280 TraceCheckUtils]: 24: Hoare triple {1852#true} ~x := #in~x; {2042#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:31,934 INFO L280 TraceCheckUtils]: 25: Hoare triple {2042#(<= id_~x |id_#in~x|)} assume 0 == ~x;#res := 0; {2101#(<= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,935 INFO L280 TraceCheckUtils]: 26: Hoare triple {2101#(<= 0 |id_#in~x|)} assume true; {2101#(<= 0 |id_#in~x|)} is VALID [2020-07-10 14:58:31,936 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2101#(<= 0 |id_#in~x|)} {2052#(<= id2_~x |id2_#in~x|)} #34#return; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,936 INFO L280 TraceCheckUtils]: 28: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,937 INFO L280 TraceCheckUtils]: 29: Hoare triple {2018#(<= 1 |id2_#in~x|)} assume true; {2018#(<= 1 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,938 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2018#(<= 1 |id2_#in~x|)} {2042#(<= id_~x |id_#in~x|)} #42#return; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,938 INFO L280 TraceCheckUtils]: 31: Hoare triple {2013#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,939 INFO L280 TraceCheckUtils]: 32: Hoare triple {2013#(<= 2 |id_#in~x|)} assume true; {2013#(<= 2 |id_#in~x|)} is VALID [2020-07-10 14:58:31,940 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2013#(<= 2 |id_#in~x|)} {2052#(<= id2_~x |id2_#in~x|)} #34#return; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,940 INFO L280 TraceCheckUtils]: 34: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,941 INFO L280 TraceCheckUtils]: 35: Hoare triple {2002#(<= 3 |id2_#in~x|)} assume true; {2002#(<= 3 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,942 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2002#(<= 3 |id2_#in~x|)} {2042#(<= id_~x |id_#in~x|)} #42#return; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,942 INFO L280 TraceCheckUtils]: 37: Hoare triple {1985#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,943 INFO L280 TraceCheckUtils]: 38: Hoare triple {1985#(<= 4 |id_#in~x|)} assume true; {1985#(<= 4 |id_#in~x|)} is VALID [2020-07-10 14:58:31,944 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1985#(<= 4 |id_#in~x|)} {2052#(<= id2_~x |id2_#in~x|)} #34#return; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,945 INFO L280 TraceCheckUtils]: 40: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,945 INFO L280 TraceCheckUtils]: 41: Hoare triple {1962#(<= 5 |id2_#in~x|)} assume true; {1962#(<= 5 |id2_#in~x|)} is VALID [2020-07-10 14:58:31,946 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1962#(<= 5 |id2_#in~x|)} {2042#(<= id_~x |id_#in~x|)} #42#return; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:58:31,947 INFO L280 TraceCheckUtils]: 43: Hoare triple {1932#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:58:31,947 INFO L280 TraceCheckUtils]: 44: Hoare triple {1932#(<= 6 |id_#in~x|)} assume true; {1932#(<= 6 |id_#in~x|)} is VALID [2020-07-10 14:58:31,948 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1932#(<= 6 |id_#in~x|)} {2035#(<= main_~input~0 5)} #40#return; {1853#false} is VALID [2020-07-10 14:58:31,948 INFO L280 TraceCheckUtils]: 46: Hoare triple {1853#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {1853#false} is VALID [2020-07-10 14:58:31,948 INFO L280 TraceCheckUtils]: 47: Hoare triple {1853#false} assume 5 != ~result~0; {1853#false} is VALID [2020-07-10 14:58:31,949 INFO L280 TraceCheckUtils]: 48: Hoare triple {1853#false} assume !false; {1853#false} is VALID [2020-07-10 14:58:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-10 14:58:31,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 14:58:31,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 16 [2020-07-10 14:58:31,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632127149] [2020-07-10 14:58:31,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2020-07-10 14:58:31,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:31,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 14:58:31,994 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-10 14:58:31,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 14:58:31,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:31,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 14:58:31,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-07-10 14:58:31,995 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 12 states. [2020-07-10 14:58:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:32,449 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2020-07-10 14:58:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 14:58:32,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2020-07-10 14:58:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:58:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2020-07-10 14:58:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:58:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2020-07-10 14:58:32,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 48 transitions. [2020-07-10 14:58:32,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:32,521 INFO L225 Difference]: With dead ends: 63 [2020-07-10 14:58:32,522 INFO L226 Difference]: Without dead ends: 39 [2020-07-10 14:58:32,523 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2020-07-10 14:58:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-10 14:58:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-10 14:58:32,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:32,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2020-07-10 14:58:32,534 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-10 14:58:32,534 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-10 14:58:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:32,536 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-10 14:58:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-07-10 14:58:32,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:32,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:32,537 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-10 14:58:32,537 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-10 14:58:32,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:32,539 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-10 14:58:32,539 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-07-10 14:58:32,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:32,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:32,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:32,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 14:58:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-07-10 14:58:32,542 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 49 [2020-07-10 14:58:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:32,543 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-07-10 14:58:32,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 14:58:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-07-10 14:58:32,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-10 14:58:32,544 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:32,544 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:32,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-10 14:58:32,758 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:32,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:32,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1492956279, now seen corresponding path program 3 times [2020-07-10 14:58:32,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:32,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711568888] [2020-07-10 14:58:32,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:32,792 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} assume true; {2382#true} is VALID [2020-07-10 14:58:32,792 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2382#true} {2382#true} #36#return; {2382#true} is VALID [2020-07-10 14:58:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:33,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,035 INFO L280 TraceCheckUtils]: 2: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,036 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,037 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,038 INFO L263 TraceCheckUtils]: 2: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,038 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,039 INFO L280 TraceCheckUtils]: 4: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,039 INFO L280 TraceCheckUtils]: 5: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,040 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,041 INFO L280 TraceCheckUtils]: 7: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,041 INFO L280 TraceCheckUtils]: 8: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,043 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,044 INFO L263 TraceCheckUtils]: 2: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,045 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,045 INFO L280 TraceCheckUtils]: 4: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,046 INFO L263 TraceCheckUtils]: 5: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,046 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,047 INFO L280 TraceCheckUtils]: 7: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,047 INFO L280 TraceCheckUtils]: 8: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,048 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,049 INFO L280 TraceCheckUtils]: 10: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,050 INFO L280 TraceCheckUtils]: 11: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,051 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,052 INFO L280 TraceCheckUtils]: 13: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,052 INFO L280 TraceCheckUtils]: 14: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,054 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,055 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,056 INFO L263 TraceCheckUtils]: 2: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,056 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,057 INFO L280 TraceCheckUtils]: 4: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,057 INFO L263 TraceCheckUtils]: 5: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,058 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,058 INFO L280 TraceCheckUtils]: 7: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,059 INFO L263 TraceCheckUtils]: 8: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,078 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,079 INFO L280 TraceCheckUtils]: 10: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,079 INFO L280 TraceCheckUtils]: 11: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,081 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,081 INFO L280 TraceCheckUtils]: 13: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,082 INFO L280 TraceCheckUtils]: 14: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,083 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,084 INFO L280 TraceCheckUtils]: 16: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,084 INFO L280 TraceCheckUtils]: 17: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,085 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,086 INFO L280 TraceCheckUtils]: 19: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,087 INFO L280 TraceCheckUtils]: 20: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,088 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,089 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,091 INFO L263 TraceCheckUtils]: 2: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,092 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,092 INFO L280 TraceCheckUtils]: 4: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,093 INFO L263 TraceCheckUtils]: 5: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,093 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,094 INFO L280 TraceCheckUtils]: 7: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,094 INFO L263 TraceCheckUtils]: 8: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,094 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,095 INFO L280 TraceCheckUtils]: 10: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,095 INFO L263 TraceCheckUtils]: 11: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,096 INFO L280 TraceCheckUtils]: 12: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,096 INFO L280 TraceCheckUtils]: 13: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,097 INFO L280 TraceCheckUtils]: 14: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,098 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,098 INFO L280 TraceCheckUtils]: 16: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,099 INFO L280 TraceCheckUtils]: 17: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,100 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,100 INFO L280 TraceCheckUtils]: 19: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,101 INFO L280 TraceCheckUtils]: 20: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,102 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,102 INFO L280 TraceCheckUtils]: 22: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,103 INFO L280 TraceCheckUtils]: 23: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,104 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,104 INFO L280 TraceCheckUtils]: 25: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,105 INFO L280 TraceCheckUtils]: 26: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume true; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,106 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2562#(<= 4 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,107 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,108 INFO L263 TraceCheckUtils]: 2: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,109 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,109 INFO L280 TraceCheckUtils]: 4: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,109 INFO L263 TraceCheckUtils]: 5: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,110 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,110 INFO L280 TraceCheckUtils]: 7: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,111 INFO L263 TraceCheckUtils]: 8: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,111 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,111 INFO L280 TraceCheckUtils]: 10: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,112 INFO L263 TraceCheckUtils]: 11: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,112 INFO L280 TraceCheckUtils]: 12: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,113 INFO L280 TraceCheckUtils]: 13: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,113 INFO L263 TraceCheckUtils]: 14: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,113 INFO L280 TraceCheckUtils]: 15: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,114 INFO L280 TraceCheckUtils]: 16: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,115 INFO L280 TraceCheckUtils]: 17: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,116 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,116 INFO L280 TraceCheckUtils]: 19: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,117 INFO L280 TraceCheckUtils]: 20: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,118 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,118 INFO L280 TraceCheckUtils]: 22: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,119 INFO L280 TraceCheckUtils]: 23: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,120 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,120 INFO L280 TraceCheckUtils]: 25: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,121 INFO L280 TraceCheckUtils]: 26: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,122 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,122 INFO L280 TraceCheckUtils]: 28: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,123 INFO L280 TraceCheckUtils]: 29: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume true; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,124 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2562#(<= 4 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,124 INFO L280 TraceCheckUtils]: 31: Hoare triple {2539#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,125 INFO L280 TraceCheckUtils]: 32: Hoare triple {2539#(<= 5 |id_#in~x|)} assume true; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,126 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2539#(<= 5 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,128 INFO L263 TraceCheckUtils]: 2: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,129 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,129 INFO L280 TraceCheckUtils]: 4: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,129 INFO L263 TraceCheckUtils]: 5: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,130 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,130 INFO L280 TraceCheckUtils]: 7: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,130 INFO L263 TraceCheckUtils]: 8: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,131 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,131 INFO L280 TraceCheckUtils]: 10: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,132 INFO L263 TraceCheckUtils]: 11: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,132 INFO L280 TraceCheckUtils]: 12: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,133 INFO L280 TraceCheckUtils]: 13: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,133 INFO L263 TraceCheckUtils]: 14: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,134 INFO L280 TraceCheckUtils]: 15: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,134 INFO L280 TraceCheckUtils]: 16: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,134 INFO L263 TraceCheckUtils]: 17: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,135 INFO L280 TraceCheckUtils]: 18: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,135 INFO L280 TraceCheckUtils]: 19: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,136 INFO L280 TraceCheckUtils]: 20: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,137 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,137 INFO L280 TraceCheckUtils]: 22: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,138 INFO L280 TraceCheckUtils]: 23: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,139 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,140 INFO L280 TraceCheckUtils]: 25: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,140 INFO L280 TraceCheckUtils]: 26: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,141 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,142 INFO L280 TraceCheckUtils]: 28: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,142 INFO L280 TraceCheckUtils]: 29: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,143 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,144 INFO L280 TraceCheckUtils]: 31: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,144 INFO L280 TraceCheckUtils]: 32: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume true; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,145 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2562#(<= 4 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,146 INFO L280 TraceCheckUtils]: 34: Hoare triple {2539#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,146 INFO L280 TraceCheckUtils]: 35: Hoare triple {2539#(<= 5 |id_#in~x|)} assume true; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,147 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2539#(<= 5 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,148 INFO L280 TraceCheckUtils]: 37: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,148 INFO L280 TraceCheckUtils]: 38: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume true; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,150 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2510#(<= 6 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-10 14:58:33,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,152 INFO L280 TraceCheckUtils]: 1: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,153 INFO L263 TraceCheckUtils]: 2: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,153 INFO L280 TraceCheckUtils]: 3: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,154 INFO L280 TraceCheckUtils]: 4: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,154 INFO L263 TraceCheckUtils]: 5: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,154 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,155 INFO L280 TraceCheckUtils]: 7: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,155 INFO L263 TraceCheckUtils]: 8: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,156 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,156 INFO L280 TraceCheckUtils]: 10: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,156 INFO L263 TraceCheckUtils]: 11: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,157 INFO L280 TraceCheckUtils]: 12: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,157 INFO L280 TraceCheckUtils]: 13: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,158 INFO L263 TraceCheckUtils]: 14: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,158 INFO L280 TraceCheckUtils]: 15: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,159 INFO L280 TraceCheckUtils]: 16: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,159 INFO L263 TraceCheckUtils]: 17: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,160 INFO L280 TraceCheckUtils]: 18: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,160 INFO L280 TraceCheckUtils]: 19: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,161 INFO L263 TraceCheckUtils]: 20: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,161 INFO L280 TraceCheckUtils]: 21: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,162 INFO L280 TraceCheckUtils]: 22: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,162 INFO L280 TraceCheckUtils]: 23: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,163 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,163 INFO L280 TraceCheckUtils]: 25: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,164 INFO L280 TraceCheckUtils]: 26: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,165 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,166 INFO L280 TraceCheckUtils]: 28: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,166 INFO L280 TraceCheckUtils]: 29: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,167 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,168 INFO L280 TraceCheckUtils]: 31: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,168 INFO L280 TraceCheckUtils]: 32: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,169 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,170 INFO L280 TraceCheckUtils]: 34: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,170 INFO L280 TraceCheckUtils]: 35: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume true; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,171 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2562#(<= 4 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,172 INFO L280 TraceCheckUtils]: 37: Hoare triple {2539#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,172 INFO L280 TraceCheckUtils]: 38: Hoare triple {2539#(<= 5 |id_#in~x|)} assume true; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,173 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2539#(<= 5 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,173 INFO L280 TraceCheckUtils]: 40: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,174 INFO L280 TraceCheckUtils]: 41: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume true; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,175 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2510#(<= 6 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-10 14:58:33,175 INFO L280 TraceCheckUtils]: 43: Hoare triple {2474#(<= 7 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-10 14:58:33,176 INFO L280 TraceCheckUtils]: 44: Hoare triple {2474#(<= 7 |id_#in~x|)} assume true; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-10 14:58:33,177 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2474#(<= 7 |id_#in~x|)} {2386#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #40#return; {2383#false} is VALID [2020-07-10 14:58:33,179 INFO L263 TraceCheckUtils]: 0: Hoare triple {2382#true} call ULTIMATE.init(); {2382#true} is VALID [2020-07-10 14:58:33,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {2382#true} assume true; {2382#true} is VALID [2020-07-10 14:58:33,179 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2382#true} {2382#true} #36#return; {2382#true} is VALID [2020-07-10 14:58:33,179 INFO L263 TraceCheckUtils]: 3: Hoare triple {2382#true} call #t~ret3 := main(); {2382#true} is VALID [2020-07-10 14:58:33,180 INFO L280 TraceCheckUtils]: 4: Hoare triple {2382#true} ~input~0 := 5; {2386#(and (<= main_~input~0 5) (<= 5 main_~input~0))} is VALID [2020-07-10 14:58:33,180 INFO L263 TraceCheckUtils]: 5: Hoare triple {2386#(and (<= main_~input~0 5) (<= 5 main_~input~0))} call #t~ret2 := id(~input~0); {2382#true} is VALID [2020-07-10 14:58:33,181 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,181 INFO L280 TraceCheckUtils]: 7: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,182 INFO L263 TraceCheckUtils]: 8: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,182 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,182 INFO L280 TraceCheckUtils]: 10: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,183 INFO L263 TraceCheckUtils]: 11: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,183 INFO L280 TraceCheckUtils]: 12: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,184 INFO L280 TraceCheckUtils]: 13: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,184 INFO L263 TraceCheckUtils]: 14: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,184 INFO L280 TraceCheckUtils]: 15: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,185 INFO L280 TraceCheckUtils]: 16: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,185 INFO L263 TraceCheckUtils]: 17: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,185 INFO L280 TraceCheckUtils]: 18: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,186 INFO L280 TraceCheckUtils]: 19: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,186 INFO L263 TraceCheckUtils]: 20: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,187 INFO L280 TraceCheckUtils]: 21: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,187 INFO L280 TraceCheckUtils]: 22: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,187 INFO L263 TraceCheckUtils]: 23: Hoare triple {2475#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,188 INFO L280 TraceCheckUtils]: 24: Hoare triple {2382#true} ~x := #in~x; {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,188 INFO L280 TraceCheckUtils]: 25: Hoare triple {2433#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2433#(= |id_#in~x| id_~x)} is VALID [2020-07-10 14:58:33,188 INFO L263 TraceCheckUtils]: 26: Hoare triple {2433#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,189 INFO L280 TraceCheckUtils]: 27: Hoare triple {2382#true} ~x := #in~x; {2475#(= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,190 INFO L280 TraceCheckUtils]: 28: Hoare triple {2475#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,190 INFO L280 TraceCheckUtils]: 29: Hoare triple {2596#(= 0 |id2_#in~x|)} assume true; {2596#(= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,191 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2596#(= 0 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,191 INFO L280 TraceCheckUtils]: 31: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,192 INFO L280 TraceCheckUtils]: 32: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,193 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,194 INFO L280 TraceCheckUtils]: 34: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,194 INFO L280 TraceCheckUtils]: 35: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,195 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,196 INFO L280 TraceCheckUtils]: 37: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,196 INFO L280 TraceCheckUtils]: 38: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,197 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,197 INFO L280 TraceCheckUtils]: 40: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,198 INFO L280 TraceCheckUtils]: 41: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume true; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,199 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2562#(<= 4 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,199 INFO L280 TraceCheckUtils]: 43: Hoare triple {2539#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,200 INFO L280 TraceCheckUtils]: 44: Hoare triple {2539#(<= 5 |id_#in~x|)} assume true; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,201 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2539#(<= 5 |id_#in~x|)} {2475#(= id2_~x |id2_#in~x|)} #34#return; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,201 INFO L280 TraceCheckUtils]: 46: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,202 INFO L280 TraceCheckUtils]: 47: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume true; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,203 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2510#(<= 6 |id2_#in~x|)} {2433#(= |id_#in~x| id_~x)} #42#return; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-10 14:58:33,203 INFO L280 TraceCheckUtils]: 49: Hoare triple {2474#(<= 7 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-10 14:58:33,204 INFO L280 TraceCheckUtils]: 50: Hoare triple {2474#(<= 7 |id_#in~x|)} assume true; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-10 14:58:33,205 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2474#(<= 7 |id_#in~x|)} {2386#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #40#return; {2383#false} is VALID [2020-07-10 14:58:33,205 INFO L280 TraceCheckUtils]: 52: Hoare triple {2383#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {2383#false} is VALID [2020-07-10 14:58:33,205 INFO L280 TraceCheckUtils]: 53: Hoare triple {2383#false} assume 5 != ~result~0; {2383#false} is VALID [2020-07-10 14:58:33,205 INFO L280 TraceCheckUtils]: 54: Hoare triple {2383#false} assume !false; {2383#false} is VALID [2020-07-10 14:58:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-07-10 14:58:33,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711568888] [2020-07-10 14:58:33,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499451764] [2020-07-10 14:58:33,208 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:33,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-10 14:58:33,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:58:33,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-10 14:58:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:33,265 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:33,495 INFO L263 TraceCheckUtils]: 0: Hoare triple {2382#true} call ULTIMATE.init(); {2382#true} is VALID [2020-07-10 14:58:33,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {2382#true} assume true; {2382#true} is VALID [2020-07-10 14:58:33,496 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2382#true} {2382#true} #36#return; {2382#true} is VALID [2020-07-10 14:58:33,496 INFO L263 TraceCheckUtils]: 3: Hoare triple {2382#true} call #t~ret3 := main(); {2382#true} is VALID [2020-07-10 14:58:33,496 INFO L280 TraceCheckUtils]: 4: Hoare triple {2382#true} ~input~0 := 5; {2612#(<= main_~input~0 5)} is VALID [2020-07-10 14:58:33,497 INFO L263 TraceCheckUtils]: 5: Hoare triple {2612#(<= main_~input~0 5)} call #t~ret2 := id(~input~0); {2382#true} is VALID [2020-07-10 14:58:33,497 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#true} ~x := #in~x; {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:33,497 INFO L280 TraceCheckUtils]: 7: Hoare triple {2619#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:33,497 INFO L263 TraceCheckUtils]: 8: Hoare triple {2619#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,498 INFO L280 TraceCheckUtils]: 9: Hoare triple {2382#true} ~x := #in~x; {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,498 INFO L280 TraceCheckUtils]: 10: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,498 INFO L263 TraceCheckUtils]: 11: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,499 INFO L280 TraceCheckUtils]: 12: Hoare triple {2382#true} ~x := #in~x; {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:33,499 INFO L280 TraceCheckUtils]: 13: Hoare triple {2619#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:33,499 INFO L263 TraceCheckUtils]: 14: Hoare triple {2619#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,500 INFO L280 TraceCheckUtils]: 15: Hoare triple {2382#true} ~x := #in~x; {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,500 INFO L280 TraceCheckUtils]: 16: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,500 INFO L263 TraceCheckUtils]: 17: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,500 INFO L280 TraceCheckUtils]: 18: Hoare triple {2382#true} ~x := #in~x; {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:33,501 INFO L280 TraceCheckUtils]: 19: Hoare triple {2619#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:33,501 INFO L263 TraceCheckUtils]: 20: Hoare triple {2619#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,501 INFO L280 TraceCheckUtils]: 21: Hoare triple {2382#true} ~x := #in~x; {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,502 INFO L280 TraceCheckUtils]: 22: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} assume !(0 == ~x); {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,502 INFO L263 TraceCheckUtils]: 23: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,502 INFO L280 TraceCheckUtils]: 24: Hoare triple {2382#true} ~x := #in~x; {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:33,503 INFO L280 TraceCheckUtils]: 25: Hoare triple {2619#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {2619#(<= id_~x |id_#in~x|)} is VALID [2020-07-10 14:58:33,503 INFO L263 TraceCheckUtils]: 26: Hoare triple {2619#(<= id_~x |id_#in~x|)} call #t~ret0 := id2(~x - 1); {2382#true} is VALID [2020-07-10 14:58:33,503 INFO L280 TraceCheckUtils]: 27: Hoare triple {2382#true} ~x := #in~x; {2629#(<= id2_~x |id2_#in~x|)} is VALID [2020-07-10 14:58:33,504 INFO L280 TraceCheckUtils]: 28: Hoare triple {2629#(<= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {2687#(<= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,504 INFO L280 TraceCheckUtils]: 29: Hoare triple {2687#(<= 0 |id2_#in~x|)} assume true; {2687#(<= 0 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,505 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2687#(<= 0 |id2_#in~x|)} {2619#(<= id_~x |id_#in~x|)} #42#return; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,505 INFO L280 TraceCheckUtils]: 31: Hoare triple {2595#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,506 INFO L280 TraceCheckUtils]: 32: Hoare triple {2595#(<= 1 |id_#in~x|)} assume true; {2595#(<= 1 |id_#in~x|)} is VALID [2020-07-10 14:58:33,507 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2595#(<= 1 |id_#in~x|)} {2629#(<= id2_~x |id2_#in~x|)} #34#return; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,507 INFO L280 TraceCheckUtils]: 34: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,508 INFO L280 TraceCheckUtils]: 35: Hoare triple {2590#(<= 2 |id2_#in~x|)} assume true; {2590#(<= 2 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,509 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2590#(<= 2 |id2_#in~x|)} {2619#(<= id_~x |id_#in~x|)} #42#return; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,510 INFO L280 TraceCheckUtils]: 37: Hoare triple {2579#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,511 INFO L280 TraceCheckUtils]: 38: Hoare triple {2579#(<= 3 |id_#in~x|)} assume true; {2579#(<= 3 |id_#in~x|)} is VALID [2020-07-10 14:58:33,518 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2579#(<= 3 |id_#in~x|)} {2629#(<= id2_~x |id2_#in~x|)} #34#return; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,519 INFO L280 TraceCheckUtils]: 40: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,519 INFO L280 TraceCheckUtils]: 41: Hoare triple {2562#(<= 4 |id2_#in~x|)} assume true; {2562#(<= 4 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,520 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2562#(<= 4 |id2_#in~x|)} {2619#(<= id_~x |id_#in~x|)} #42#return; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,521 INFO L280 TraceCheckUtils]: 43: Hoare triple {2539#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,521 INFO L280 TraceCheckUtils]: 44: Hoare triple {2539#(<= 5 |id_#in~x|)} assume true; {2539#(<= 5 |id_#in~x|)} is VALID [2020-07-10 14:58:33,522 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2539#(<= 5 |id_#in~x|)} {2629#(<= id2_~x |id2_#in~x|)} #34#return; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,523 INFO L280 TraceCheckUtils]: 46: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,523 INFO L280 TraceCheckUtils]: 47: Hoare triple {2510#(<= 6 |id2_#in~x|)} assume true; {2510#(<= 6 |id2_#in~x|)} is VALID [2020-07-10 14:58:33,525 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2510#(<= 6 |id2_#in~x|)} {2619#(<= id_~x |id_#in~x|)} #42#return; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-10 14:58:33,525 INFO L280 TraceCheckUtils]: 49: Hoare triple {2474#(<= 7 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-10 14:58:33,526 INFO L280 TraceCheckUtils]: 50: Hoare triple {2474#(<= 7 |id_#in~x|)} assume true; {2474#(<= 7 |id_#in~x|)} is VALID [2020-07-10 14:58:33,526 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2474#(<= 7 |id_#in~x|)} {2612#(<= main_~input~0 5)} #40#return; {2383#false} is VALID [2020-07-10 14:58:33,527 INFO L280 TraceCheckUtils]: 52: Hoare triple {2383#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {2383#false} is VALID [2020-07-10 14:58:33,527 INFO L280 TraceCheckUtils]: 53: Hoare triple {2383#false} assume 5 != ~result~0; {2383#false} is VALID [2020-07-10 14:58:33,527 INFO L280 TraceCheckUtils]: 54: Hoare triple {2383#false} assume !false; {2383#false} is VALID [2020-07-10 14:58:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-07-10 14:58:33,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 14:58:33,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 17 [2020-07-10 14:58:33,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934448679] [2020-07-10 14:58:33,531 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-07-10 14:58:33,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:33,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 14:58:33,573 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-10 14:58:33,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 14:58:33,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:33,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 14:58:33,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-07-10 14:58:33,575 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-07-10 14:58:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:34,056 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-10 14:58:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 14:58:34,056 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-07-10 14:58:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 14:58:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2020-07-10 14:58:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 14:58:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2020-07-10 14:58:34,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2020-07-10 14:58:34,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:34,130 INFO L225 Difference]: With dead ends: 39 [2020-07-10 14:58:34,130 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 14:58:34,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2020-07-10 14:58:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 14:58:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 14:58:34,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:34,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:34,133 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:34,133 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:34,133 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:58:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:58:34,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:34,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:34,134 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:34,134 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:34,134 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:58:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:58:34,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:34,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:34,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:34,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 14:58:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 14:58:34,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-07-10 14:58:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:34,136 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 14:58:34,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 14:58:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:58:34,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:34,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:34,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 14:58:34,391 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 14:58:34,391 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:58:34,391 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2020-07-10 14:58:34,391 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-10 14:58:34,391 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-10 14:58:34,391 INFO L268 CegarLoopResult]: For program point id2EXIT(lines 12 15) no Hoare annotation was computed. [2020-07-10 14:58:34,391 INFO L271 CegarLoopResult]: At program point id2ENTRY(lines 12 15) the Hoare annotation is: true [2020-07-10 14:58:34,391 INFO L268 CegarLoopResult]: For program point id2FINAL(lines 12 15) no Hoare annotation was computed. [2020-07-10 14:58:34,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:58:34,392 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 14:58:34,392 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 14:58:34,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 14:58:34,392 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2020-07-10 14:58:34,392 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 17 23) the Hoare annotation is: true [2020-07-10 14:58:34,392 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 17 23) no Hoare annotation was computed. [2020-07-10 14:58:34,392 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-10 14:58:34,392 INFO L268 CegarLoopResult]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-07-10 14:58:34,393 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-07-10 14:58:34,393 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-10 14:58:34,393 INFO L268 CegarLoopResult]: For program point L20-2(lines 17 23) no Hoare annotation was computed. [2020-07-10 14:58:34,393 INFO L268 CegarLoopResult]: For program point idFINAL(lines 7 10) no Hoare annotation was computed. [2020-07-10 14:58:34,393 INFO L268 CegarLoopResult]: For program point idEXIT(lines 7 10) no Hoare annotation was computed. [2020-07-10 14:58:34,393 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-10 14:58:34,393 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 14:58:34,393 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-10 14:58:34,393 INFO L271 CegarLoopResult]: At program point idENTRY(lines 7 10) the Hoare annotation is: true [2020-07-10 14:58:34,397 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:58:34,397 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 14:58:34,397 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 14:58:34,398 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:58:34,398 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 14:58:34,398 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 14:58:34,398 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:58:34,398 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-10 14:58:34,398 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 14:58:34,398 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 14:58:34,398 WARN L170 areAnnotationChecker]: id2FINAL has no Hoare annotation [2020-07-10 14:58:34,398 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-10 14:58:34,398 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:58:34,398 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-10 14:58:34,398 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-10 14:58:34,398 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-10 14:58:34,399 WARN L170 areAnnotationChecker]: id2EXIT has no Hoare annotation [2020-07-10 14:58:34,399 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-10 14:58:34,399 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 14:58:34,399 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 14:58:34,399 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-10 14:58:34,399 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-10 14:58:34,399 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-10 14:58:34,399 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 14:58:34,399 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 14:58:34,399 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-10 14:58:34,399 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:58:34,399 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 14:58:34,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:58:34 BoogieIcfgContainer [2020-07-10 14:58:34,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:58:34,404 INFO L168 Benchmark]: Toolchain (without parser) took 10646.61 ms. Allocated memory was 138.4 MB in the beginning and 325.6 MB in the end (delta: 187.2 MB). Free memory was 102.5 MB in the beginning and 280.0 MB in the end (delta: -177.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:34,404 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 14:58:34,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.32 ms. Allocated memory is still 138.4 MB. Free memory was 102.3 MB in the beginning and 92.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:34,405 INFO L168 Benchmark]: Boogie Preprocessor took 30.27 ms. Allocated memory is still 138.4 MB. Free memory was 92.6 MB in the beginning and 91.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:34,406 INFO L168 Benchmark]: RCFGBuilder took 416.65 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 91.2 MB in the beginning and 165.3 MB in the end (delta: -74.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:34,407 INFO L168 Benchmark]: TraceAbstraction took 9947.72 ms. Allocated memory was 201.9 MB in the beginning and 325.6 MB in the end (delta: 123.7 MB). Free memory was 165.3 MB in the beginning and 280.0 MB in the end (delta: -114.8 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:34,410 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 242.32 ms. Allocated memory is still 138.4 MB. Free memory was 102.3 MB in the beginning and 92.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.27 ms. Allocated memory is still 138.4 MB. Free memory was 92.6 MB in the beginning and 91.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 416.65 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 91.2 MB in the beginning and 165.3 MB in the end (delta: -74.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9947.72 ms. Allocated memory was 201.9 MB in the beginning and 325.6 MB in the end (delta: 123.7 MB). Free memory was 165.3 MB in the beginning and 280.0 MB in the end (delta: -114.8 MB). Peak memory consumption was 9.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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.8s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 179 SDtfs, 89 SDslu, 1129 SDs, 0 SdLazy, 516 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 418 GetRequests, 304 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 19 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 512 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 52080 SizeOfPredicates, 33 NumberOfNonLiveVariables, 564 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 282/360 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...