/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/id_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:22:06,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:22:06,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:22:06,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:22:06,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:22:06,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:22:06,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:22:06,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:22:06,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:22:06,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:22:06,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:22:06,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:22:06,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:22:06,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:22:06,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:22:06,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:22:06,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:22:06,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:22:06,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:22:06,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:22:06,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:22:06,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:22:06,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:22:06,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:22:06,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:22:06,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:22:06,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:22:06,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:22:06,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:22:06,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:22:06,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:22:06,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:22:06,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:22:06,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:22:06,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:22:06,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:22:06,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:22:06,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:22:06,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:22:06,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:22:06,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:22:06,649 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-17 22:22:06,663 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:22:06,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:22:06,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:22:06,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:22:06,665 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:22:06,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:22:06,665 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:22:06,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:22:06,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:22:06,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:22:06,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:22:06,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:22:06,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:22:06,667 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:22:06,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:22:06,667 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:22:06,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:22:06,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:22:06,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:22:06,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:22:06,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:22:06,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:22:06,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:22:06,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:22:06,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:22:06,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:22:06,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:22:06,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:22:06,670 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:22:06,670 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:22:06,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:22:06,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:22:06,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:22:06,966 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:22:06,966 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:22:06,967 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c [2020-07-17 22:22:07,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fad56a06/2113c0d8c5cf4cc9a3a3d98f5b9b9207/FLAG0ae016471 [2020-07-17 22:22:07,449 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:22:07,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c [2020-07-17 22:22:07,455 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fad56a06/2113c0d8c5cf4cc9a3a3d98f5b9b9207/FLAG0ae016471 [2020-07-17 22:22:07,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fad56a06/2113c0d8c5cf4cc9a3a3d98f5b9b9207 [2020-07-17 22:22:07,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:22:07,828 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:22:07,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:22:07,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:22:07,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:22:07,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:22:07" (1/1) ... [2020-07-17 22:22:07,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e3cc8d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:07, skipping insertion in model container [2020-07-17 22:22:07,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:22:07" (1/1) ... [2020-07-17 22:22:07,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:22:07,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:22:07,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:22:08,000 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:22:08,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:22:08,030 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:22:08,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:08 WrapperNode [2020-07-17 22:22:08,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:22:08,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:22:08,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:22:08,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:22:08,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:08" (1/1) ... [2020-07-17 22:22:08,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:08" (1/1) ... [2020-07-17 22:22:08,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:08" (1/1) ... [2020-07-17 22:22:08,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:08" (1/1) ... [2020-07-17 22:22:08,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:08" (1/1) ... [2020-07-17 22:22:08,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:08" (1/1) ... [2020-07-17 22:22:08,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:08" (1/1) ... [2020-07-17 22:22:08,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:22:08,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:22:08,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:22:08,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:22:08,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:08" (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-17 22:22:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:22:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:22:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-17 22:22:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:22:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:22:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:22:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-17 22:22:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:22:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:22:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:22:08,493 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:22:08,494 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:22:08,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:22:08 BoogieIcfgContainer [2020-07-17 22:22:08,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:22:08,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:22:08,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:22:08,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:22:08,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:22:07" (1/3) ... [2020-07-17 22:22:08,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408a8c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:22:08, skipping insertion in model container [2020-07-17 22:22:08,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:22:08" (2/3) ... [2020-07-17 22:22:08,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408a8c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:22:08, skipping insertion in model container [2020-07-17 22:22:08,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:22:08" (3/3) ... [2020-07-17 22:22:08,510 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i5_o5-2.c [2020-07-17 22:22:08,524 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:22:08,535 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:22:08,570 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:22:08,627 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:22:08,628 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:22:08,628 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:22:08,628 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:22:08,628 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:22:08,628 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:22:08,629 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:22:08,629 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:22:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-17 22:22:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:22:08,672 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:22:08,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:22:08,674 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:22:08,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:22:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-07-17 22:22:08,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:22:08,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638857611] [2020-07-17 22:22:08,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:22:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:08,966 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:22:08,967 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-17 22:22:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:09,017 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} ~x := #in~x; {32#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:09,018 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {33#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:09,019 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#(= 0 |id_#in~x|)} assume true; {33#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:09,022 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {33#(= 0 |id_#in~x|)} {27#(<= 5 main_~input~0)} #30#return; {24#false} is VALID [2020-07-17 22:22:09,022 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-17 22:22:09,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:22:09,023 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-17 22:22:09,024 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2020-07-17 22:22:09,025 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} ~input~0 := 5; {27#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:09,026 INFO L263 TraceCheckUtils]: 5: Hoare triple {27#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {23#true} is VALID [2020-07-17 22:22:09,027 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#true} ~x := #in~x; {32#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:09,028 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {33#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:09,029 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#(= 0 |id_#in~x|)} assume true; {33#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:09,031 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {33#(= 0 |id_#in~x|)} {27#(<= 5 main_~input~0)} #30#return; {24#false} is VALID [2020-07-17 22:22:09,032 INFO L280 TraceCheckUtils]: 10: Hoare triple {24#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {24#false} is VALID [2020-07-17 22:22:09,032 INFO L280 TraceCheckUtils]: 11: Hoare triple {24#false} assume 5 != ~result~0; {24#false} is VALID [2020-07-17 22:22:09,032 INFO L280 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-17 22:22:09,034 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-17 22:22:09,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638857611] [2020-07-17 22:22:09,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:22:09,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:22:09,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154605141] [2020-07-17 22:22:09,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:22:09,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:22:09,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:22:09,084 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-17 22:22:09,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:22:09,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:22:09,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:22:09,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:22:09,097 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-07-17 22:22:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:09,338 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:22:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:22:09,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:22:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:22:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:22:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-17 22:22:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:22:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-17 22:22:09,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-17 22:22:09,426 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-17 22:22:09,438 INFO L225 Difference]: With dead ends: 30 [2020-07-17 22:22:09,438 INFO L226 Difference]: Without dead ends: 18 [2020-07-17 22:22:09,442 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-17 22:22:09,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-17 22:22:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-17 22:22:09,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:22:09,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-17 22:22:09,487 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:22:09,487 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:22:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:09,492 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-17 22:22:09,492 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:22:09,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:09,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:09,493 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:22:09,493 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:22:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:09,497 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-17 22:22:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:22:09,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:09,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:09,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:22:09,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:22:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:22:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-17 22:22:09,504 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-17 22:22:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:22:09,504 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-17 22:22:09,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:22:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:22:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:22:09,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:22:09,506 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:22:09,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:22:09,506 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:22:09,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:22:09,507 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-07-17 22:22:09,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:22:09,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802648815] [2020-07-17 22:22:09,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:22:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:09,563 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:22:09,564 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-17 22:22:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:09,670 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:09,671 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {157#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:09,672 INFO L280 TraceCheckUtils]: 2: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:09,674 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {157#(= 0 |id_#in~x|)} {151#(= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:09,676 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:09,677 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#(= |id_#in~x| id_~x)} assume !(0 == ~x); {151#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:09,677 INFO L263 TraceCheckUtils]: 2: Hoare triple {151#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-17 22:22:09,678 INFO L280 TraceCheckUtils]: 3: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:09,679 INFO L280 TraceCheckUtils]: 4: Hoare triple {151#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {157#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:09,680 INFO L280 TraceCheckUtils]: 5: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:09,682 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {157#(= 0 |id_#in~x|)} {151#(= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:09,683 INFO L280 TraceCheckUtils]: 7: Hoare triple {156#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {156#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:09,684 INFO L280 TraceCheckUtils]: 8: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:09,686 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-17 22:22:09,687 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-17 22:22:09,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:22:09,688 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-17 22:22:09,688 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-17 22:22:09,689 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#true} ~input~0 := 5; {140#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:09,690 INFO L263 TraceCheckUtils]: 5: Hoare triple {140#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {136#true} is VALID [2020-07-17 22:22:09,691 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:09,692 INFO L280 TraceCheckUtils]: 7: Hoare triple {151#(= |id_#in~x| id_~x)} assume !(0 == ~x); {151#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:09,692 INFO L263 TraceCheckUtils]: 8: Hoare triple {151#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-17 22:22:09,693 INFO L280 TraceCheckUtils]: 9: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:09,694 INFO L280 TraceCheckUtils]: 10: Hoare triple {151#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {157#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:09,695 INFO L280 TraceCheckUtils]: 11: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:09,697 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {157#(= 0 |id_#in~x|)} {151#(= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:09,698 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {156#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:09,699 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:09,700 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-17 22:22:09,701 INFO L280 TraceCheckUtils]: 16: Hoare triple {137#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {137#false} is VALID [2020-07-17 22:22:09,701 INFO L280 TraceCheckUtils]: 17: Hoare triple {137#false} assume 5 != ~result~0; {137#false} is VALID [2020-07-17 22:22:09,702 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-17 22:22:09,703 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-17 22:22:09,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802648815] [2020-07-17 22:22:09,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047803312] [2020-07-17 22:22:09,704 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-17 22:22:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:09,759 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:22:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:09,772 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:22:09,894 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-17 22:22:09,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:22:09,894 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-17 22:22:09,895 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-17 22:22:09,896 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#true} ~input~0 := 5; {140#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:09,896 INFO L263 TraceCheckUtils]: 5: Hoare triple {140#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {136#true} is VALID [2020-07-17 22:22:09,897 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#true} ~x := #in~x; {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:09,897 INFO L280 TraceCheckUtils]: 7: Hoare triple {179#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:09,898 INFO L263 TraceCheckUtils]: 8: Hoare triple {179#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-17 22:22:09,898 INFO L280 TraceCheckUtils]: 9: Hoare triple {136#true} ~x := #in~x; {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:09,899 INFO L280 TraceCheckUtils]: 10: Hoare triple {179#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {192#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:22:09,900 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#(<= |id_#in~x| 0)} assume true; {192#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:22:09,902 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {192#(<= |id_#in~x| 0)} {179#(<= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:09,903 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {156#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:09,903 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:09,905 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-17 22:22:09,905 INFO L280 TraceCheckUtils]: 16: Hoare triple {137#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {137#false} is VALID [2020-07-17 22:22:09,905 INFO L280 TraceCheckUtils]: 17: Hoare triple {137#false} assume 5 != ~result~0; {137#false} is VALID [2020-07-17 22:22:09,906 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-17 22:22:09,907 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-17 22:22:09,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:22:09,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-17 22:22:09,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611062374] [2020-07-17 22:22:09,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-17 22:22:09,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:22:09,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:22:09,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:22:09,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:22:09,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:22:09,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:22:09,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:22:09,952 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2020-07-17 22:22:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:10,103 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-17 22:22:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:22:10,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-17 22:22:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:22:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:22:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-17 22:22:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:22:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-17 22:22:10,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-17 22:22:10,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:22:10,152 INFO L225 Difference]: With dead ends: 25 [2020-07-17 22:22:10,152 INFO L226 Difference]: Without dead ends: 21 [2020-07-17 22:22:10,153 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:22:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-17 22:22:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-17 22:22:10,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:22:10,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-17 22:22:10,163 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:22:10,163 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:22:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:10,166 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-17 22:22:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:22:10,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:10,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:10,168 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:22:10,168 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:22:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:10,171 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-17 22:22:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:22:10,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:10,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:10,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:22:10,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:22:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:22:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-17 22:22:10,175 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-07-17 22:22:10,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:22:10,175 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-17 22:22:10,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:22:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:22:10,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:22:10,177 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:22:10,177 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:22:10,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:22:10,391 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:22:10,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:22:10,392 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-07-17 22:22:10,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:22:10,392 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369414282] [2020-07-17 22:22:10,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:22:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:10,464 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-17 22:22:10,467 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-17 22:22:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:10,592 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:10,593 INFO L280 TraceCheckUtils]: 2: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:10,595 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:10,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,596 INFO L263 TraceCheckUtils]: 2: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:10,597 INFO L280 TraceCheckUtils]: 3: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,598 INFO L280 TraceCheckUtils]: 4: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:10,599 INFO L280 TraceCheckUtils]: 5: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:10,600 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:10,601 INFO L280 TraceCheckUtils]: 7: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:10,601 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:10,602 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {359#(<= |id_#in~x| 1)} {343#(= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:10,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,610 INFO L263 TraceCheckUtils]: 2: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:10,610 INFO L280 TraceCheckUtils]: 3: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,611 INFO L280 TraceCheckUtils]: 4: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,612 INFO L263 TraceCheckUtils]: 5: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:10,612 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,613 INFO L280 TraceCheckUtils]: 7: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:10,614 INFO L280 TraceCheckUtils]: 8: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:10,615 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:10,617 INFO L280 TraceCheckUtils]: 10: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:10,618 INFO L280 TraceCheckUtils]: 11: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:10,620 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {359#(<= |id_#in~x| 1)} {343#(= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:10,622 INFO L280 TraceCheckUtils]: 13: Hoare triple {354#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {354#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:10,623 INFO L280 TraceCheckUtils]: 14: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:10,625 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-17 22:22:10,626 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-17 22:22:10,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-17 22:22:10,626 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-17 22:22:10,627 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret2 := main(); {322#true} is VALID [2020-07-17 22:22:10,628 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} ~input~0 := 5; {326#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:10,629 INFO L263 TraceCheckUtils]: 5: Hoare triple {326#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {322#true} is VALID [2020-07-17 22:22:10,630 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,631 INFO L280 TraceCheckUtils]: 7: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,632 INFO L263 TraceCheckUtils]: 8: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:10,633 INFO L280 TraceCheckUtils]: 9: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,633 INFO L280 TraceCheckUtils]: 10: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,634 INFO L263 TraceCheckUtils]: 11: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:10,634 INFO L280 TraceCheckUtils]: 12: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,635 INFO L280 TraceCheckUtils]: 13: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:10,636 INFO L280 TraceCheckUtils]: 14: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:10,637 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:10,638 INFO L280 TraceCheckUtils]: 16: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:10,639 INFO L280 TraceCheckUtils]: 17: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:10,640 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {359#(<= |id_#in~x| 1)} {343#(= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:10,641 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {354#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:10,642 INFO L280 TraceCheckUtils]: 20: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:10,643 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-17 22:22:10,644 INFO L280 TraceCheckUtils]: 22: Hoare triple {323#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {323#false} is VALID [2020-07-17 22:22:10,644 INFO L280 TraceCheckUtils]: 23: Hoare triple {323#false} assume 5 != ~result~0; {323#false} is VALID [2020-07-17 22:22:10,644 INFO L280 TraceCheckUtils]: 24: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-17 22:22:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:22:10,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369414282] [2020-07-17 22:22:10,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928685259] [2020-07-17 22:22:10,646 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-17 22:22:10,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:22:10,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:22:10,672 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:22:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:10,683 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:22:10,788 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-17 22:22:10,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-17 22:22:10,789 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-17 22:22:10,789 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret2 := main(); {322#true} is VALID [2020-07-17 22:22:10,790 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} ~input~0 := 5; {326#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:10,791 INFO L263 TraceCheckUtils]: 5: Hoare triple {326#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {322#true} is VALID [2020-07-17 22:22:10,791 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,792 INFO L280 TraceCheckUtils]: 7: Hoare triple {382#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,792 INFO L263 TraceCheckUtils]: 8: Hoare triple {382#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:10,793 INFO L280 TraceCheckUtils]: 9: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,794 INFO L280 TraceCheckUtils]: 10: Hoare triple {382#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,794 INFO L263 TraceCheckUtils]: 11: Hoare triple {382#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-17 22:22:10,795 INFO L280 TraceCheckUtils]: 12: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:10,796 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {404#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:22:10,796 INFO L280 TraceCheckUtils]: 14: Hoare triple {404#(<= |id_#in~x| 0)} assume true; {404#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:22:10,799 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {404#(<= |id_#in~x| 0)} {382#(<= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:10,799 INFO L280 TraceCheckUtils]: 16: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:10,800 INFO L280 TraceCheckUtils]: 17: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:10,801 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {359#(<= |id_#in~x| 1)} {382#(<= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:10,802 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {354#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:10,803 INFO L280 TraceCheckUtils]: 20: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:10,804 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-17 22:22:10,804 INFO L280 TraceCheckUtils]: 22: Hoare triple {323#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {323#false} is VALID [2020-07-17 22:22:10,805 INFO L280 TraceCheckUtils]: 23: Hoare triple {323#false} assume 5 != ~result~0; {323#false} is VALID [2020-07-17 22:22:10,805 INFO L280 TraceCheckUtils]: 24: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-17 22:22:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:22:10,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:22:10,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-17 22:22:10,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050329947] [2020-07-17 22:22:10,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-17 22:22:10,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:22:10,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:22:10,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:22:10,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:22:10,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:22:10,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:22:10,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:22:10,849 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2020-07-17 22:22:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:11,005 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-17 22:22:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:22:11,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-17 22:22:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:22:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:22:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-17 22:22:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:22:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-17 22:22:11,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2020-07-17 22:22:11,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:22:11,058 INFO L225 Difference]: With dead ends: 28 [2020-07-17 22:22:11,058 INFO L226 Difference]: Without dead ends: 24 [2020-07-17 22:22:11,059 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:22:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-17 22:22:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-17 22:22:11,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:22:11,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-17 22:22:11,067 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:22:11,067 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:22:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:11,070 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-17 22:22:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-17 22:22:11,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:11,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:11,071 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:22:11,071 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:22:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:11,075 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-17 22:22:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-17 22:22:11,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:11,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:11,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:22:11,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:22:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:22:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-17 22:22:11,080 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-07-17 22:22:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:22:11,081 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-17 22:22:11,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:22:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-17 22:22:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:22:11,085 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:22:11,085 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:22:11,286 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:22:11,287 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:22:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:22:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-07-17 22:22:11,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:22:11,289 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825049291] [2020-07-17 22:22:11,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:22:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:11,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-17 22:22:11,330 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-17 22:22:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:11,462 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,463 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:11,464 INFO L280 TraceCheckUtils]: 2: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:11,465 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,466 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,467 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,467 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:11,468 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,468 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:11,469 INFO L280 TraceCheckUtils]: 5: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:11,470 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,471 INFO L280 TraceCheckUtils]: 7: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,472 INFO L280 TraceCheckUtils]: 8: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,473 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:11,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,475 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,475 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:11,476 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,477 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,477 INFO L263 TraceCheckUtils]: 5: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:11,477 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,478 INFO L280 TraceCheckUtils]: 7: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:11,479 INFO L280 TraceCheckUtils]: 8: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:11,480 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,481 INFO L280 TraceCheckUtils]: 10: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,482 INFO L280 TraceCheckUtils]: 11: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,483 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:11,484 INFO L280 TraceCheckUtils]: 13: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:11,484 INFO L280 TraceCheckUtils]: 14: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:11,486 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {612#(<= |id_#in~x| 2)} {584#(= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:11,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,488 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:11,489 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,489 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,490 INFO L263 TraceCheckUtils]: 5: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:11,490 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,491 INFO L280 TraceCheckUtils]: 7: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,491 INFO L263 TraceCheckUtils]: 8: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:11,492 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,493 INFO L280 TraceCheckUtils]: 10: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:11,493 INFO L280 TraceCheckUtils]: 11: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:11,495 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,496 INFO L280 TraceCheckUtils]: 13: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,496 INFO L280 TraceCheckUtils]: 14: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,498 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:11,498 INFO L280 TraceCheckUtils]: 16: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:11,499 INFO L280 TraceCheckUtils]: 17: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:11,501 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {612#(<= |id_#in~x| 2)} {584#(= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:11,501 INFO L280 TraceCheckUtils]: 19: Hoare triple {601#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {601#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:11,502 INFO L280 TraceCheckUtils]: 20: Hoare triple {601#(<= |id_#in~x| 3)} assume true; {601#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:11,503 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {601#(<= |id_#in~x| 3)} {561#(<= 5 main_~input~0)} #30#return; {558#false} is VALID [2020-07-17 22:22:11,504 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {557#true} is VALID [2020-07-17 22:22:11,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-17 22:22:11,505 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-17 22:22:11,505 INFO L263 TraceCheckUtils]: 3: Hoare triple {557#true} call #t~ret2 := main(); {557#true} is VALID [2020-07-17 22:22:11,506 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} ~input~0 := 5; {561#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:11,506 INFO L263 TraceCheckUtils]: 5: Hoare triple {561#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {557#true} is VALID [2020-07-17 22:22:11,507 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,507 INFO L280 TraceCheckUtils]: 7: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,508 INFO L263 TraceCheckUtils]: 8: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:11,508 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,509 INFO L280 TraceCheckUtils]: 10: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,509 INFO L263 TraceCheckUtils]: 11: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:11,510 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,510 INFO L280 TraceCheckUtils]: 13: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,511 INFO L263 TraceCheckUtils]: 14: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:11,511 INFO L280 TraceCheckUtils]: 15: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,512 INFO L280 TraceCheckUtils]: 16: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:11,513 INFO L280 TraceCheckUtils]: 17: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:11,514 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,515 INFO L280 TraceCheckUtils]: 19: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,515 INFO L280 TraceCheckUtils]: 20: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,517 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:11,518 INFO L280 TraceCheckUtils]: 22: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:11,518 INFO L280 TraceCheckUtils]: 23: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:11,520 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {612#(<= |id_#in~x| 2)} {584#(= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:11,520 INFO L280 TraceCheckUtils]: 25: Hoare triple {601#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {601#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:11,521 INFO L280 TraceCheckUtils]: 26: Hoare triple {601#(<= |id_#in~x| 3)} assume true; {601#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:11,522 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {601#(<= |id_#in~x| 3)} {561#(<= 5 main_~input~0)} #30#return; {558#false} is VALID [2020-07-17 22:22:11,523 INFO L280 TraceCheckUtils]: 28: Hoare triple {558#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {558#false} is VALID [2020-07-17 22:22:11,523 INFO L280 TraceCheckUtils]: 29: Hoare triple {558#false} assume 5 != ~result~0; {558#false} is VALID [2020-07-17 22:22:11,523 INFO L280 TraceCheckUtils]: 30: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-17 22:22:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-17 22:22:11,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825049291] [2020-07-17 22:22:11,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943099705] [2020-07-17 22:22:11,525 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 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-17 22:22:11,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-17 22:22:11,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:22:11,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-17 22:22:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:11,562 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:22:11,692 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {557#true} is VALID [2020-07-17 22:22:11,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-17 22:22:11,693 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-17 22:22:11,693 INFO L263 TraceCheckUtils]: 3: Hoare triple {557#true} call #t~ret2 := main(); {557#true} is VALID [2020-07-17 22:22:11,694 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} ~input~0 := 5; {561#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:11,695 INFO L263 TraceCheckUtils]: 5: Hoare triple {561#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {557#true} is VALID [2020-07-17 22:22:11,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,696 INFO L280 TraceCheckUtils]: 7: Hoare triple {640#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,696 INFO L263 TraceCheckUtils]: 8: Hoare triple {640#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:11,697 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,698 INFO L280 TraceCheckUtils]: 10: Hoare triple {640#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,698 INFO L263 TraceCheckUtils]: 11: Hoare triple {640#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:11,699 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#true} ~x := #in~x; {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,699 INFO L280 TraceCheckUtils]: 13: Hoare triple {640#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,700 INFO L263 TraceCheckUtils]: 14: Hoare triple {640#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-17 22:22:11,700 INFO L280 TraceCheckUtils]: 15: Hoare triple {557#true} ~x := #in~x; {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:11,701 INFO L280 TraceCheckUtils]: 16: Hoare triple {640#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {671#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:22:11,702 INFO L280 TraceCheckUtils]: 17: Hoare triple {671#(<= |id_#in~x| 0)} assume true; {671#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:22:11,703 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {671#(<= |id_#in~x| 0)} {640#(<= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,704 INFO L280 TraceCheckUtils]: 19: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,705 INFO L280 TraceCheckUtils]: 20: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:11,706 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {617#(<= |id_#in~x| 1)} {640#(<= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:11,707 INFO L280 TraceCheckUtils]: 22: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:11,708 INFO L280 TraceCheckUtils]: 23: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:11,709 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {612#(<= |id_#in~x| 2)} {640#(<= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:11,710 INFO L280 TraceCheckUtils]: 25: Hoare triple {601#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {601#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:11,710 INFO L280 TraceCheckUtils]: 26: Hoare triple {601#(<= |id_#in~x| 3)} assume true; {601#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:11,712 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {601#(<= |id_#in~x| 3)} {561#(<= 5 main_~input~0)} #30#return; {558#false} is VALID [2020-07-17 22:22:11,712 INFO L280 TraceCheckUtils]: 28: Hoare triple {558#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {558#false} is VALID [2020-07-17 22:22:11,712 INFO L280 TraceCheckUtils]: 29: Hoare triple {558#false} assume 5 != ~result~0; {558#false} is VALID [2020-07-17 22:22:11,712 INFO L280 TraceCheckUtils]: 30: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-17 22:22:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-17 22:22:11,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:22:11,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-17 22:22:11,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467041533] [2020-07-17 22:22:11,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-17 22:22:11,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:22:11,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:22:11,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:22:11,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:22:11,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:22:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:22:11,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:22:11,757 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2020-07-17 22:22:11,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:11,987 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-17 22:22:11,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:22:11,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-17 22:22:11,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:22:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:22:11,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2020-07-17 22:22:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:22:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2020-07-17 22:22:11,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2020-07-17 22:22:12,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:22:12,038 INFO L225 Difference]: With dead ends: 31 [2020-07-17 22:22:12,038 INFO L226 Difference]: Without dead ends: 27 [2020-07-17 22:22:12,039 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:22:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-17 22:22:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-17 22:22:12,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:22:12,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-17 22:22:12,050 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:22:12,050 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:22:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:12,052 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-17 22:22:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-17 22:22:12,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:12,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:12,053 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:22:12,053 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:22:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:12,056 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-17 22:22:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-17 22:22:12,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:12,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:12,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:22:12,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:22:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:22:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-17 22:22:12,059 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-07-17 22:22:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:22:12,059 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-17 22:22:12,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:22:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-17 22:22:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:22:12,061 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:22:12,061 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:22:12,273 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:22:12,273 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:22:12,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:22:12,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-07-17 22:22:12,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:22:12,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820173593] [2020-07-17 22:22:12,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:22:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:12,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} assume true; {847#true} is VALID [2020-07-17 22:22:12,333 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {847#true} {847#true} #26#return; {847#true} is VALID [2020-07-17 22:22:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:12,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,611 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:12,612 INFO L280 TraceCheckUtils]: 2: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:12,613 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,614 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,615 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,615 INFO L263 TraceCheckUtils]: 2: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,616 INFO L280 TraceCheckUtils]: 3: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,617 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:12,618 INFO L280 TraceCheckUtils]: 5: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:12,619 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,621 INFO L280 TraceCheckUtils]: 8: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,623 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,626 INFO L263 TraceCheckUtils]: 2: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,628 INFO L280 TraceCheckUtils]: 3: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,628 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,629 INFO L263 TraceCheckUtils]: 5: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,630 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,631 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:12,631 INFO L280 TraceCheckUtils]: 8: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:12,633 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,636 INFO L280 TraceCheckUtils]: 10: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,636 INFO L280 TraceCheckUtils]: 11: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,638 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,639 INFO L280 TraceCheckUtils]: 13: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,640 INFO L280 TraceCheckUtils]: 14: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,642 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {931#(<= |id_#in~x| 2)} {880#(= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:12,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,647 INFO L263 TraceCheckUtils]: 2: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,649 INFO L280 TraceCheckUtils]: 3: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,650 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,650 INFO L263 TraceCheckUtils]: 5: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,651 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,652 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,652 INFO L263 TraceCheckUtils]: 8: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,653 INFO L280 TraceCheckUtils]: 9: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,654 INFO L280 TraceCheckUtils]: 10: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:12,657 INFO L280 TraceCheckUtils]: 11: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:12,663 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,664 INFO L280 TraceCheckUtils]: 13: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,665 INFO L280 TraceCheckUtils]: 14: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,668 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,669 INFO L280 TraceCheckUtils]: 16: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,669 INFO L280 TraceCheckUtils]: 17: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,671 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {931#(<= |id_#in~x| 2)} {880#(= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:12,671 INFO L280 TraceCheckUtils]: 19: Hoare triple {920#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {920#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:12,672 INFO L280 TraceCheckUtils]: 20: Hoare triple {920#(<= |id_#in~x| 3)} assume true; {920#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:12,673 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {920#(<= |id_#in~x| 3)} {880#(= |id_#in~x| id_~x)} #32#return; {903#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:22:12,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,675 INFO L263 TraceCheckUtils]: 2: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,676 INFO L280 TraceCheckUtils]: 3: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,677 INFO L263 TraceCheckUtils]: 5: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,678 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,678 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,678 INFO L263 TraceCheckUtils]: 8: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,679 INFO L280 TraceCheckUtils]: 9: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,680 INFO L280 TraceCheckUtils]: 10: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,680 INFO L263 TraceCheckUtils]: 11: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,681 INFO L280 TraceCheckUtils]: 12: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,684 INFO L280 TraceCheckUtils]: 13: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:12,684 INFO L280 TraceCheckUtils]: 14: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:12,686 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,687 INFO L280 TraceCheckUtils]: 16: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,687 INFO L280 TraceCheckUtils]: 17: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,689 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,689 INFO L280 TraceCheckUtils]: 19: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,690 INFO L280 TraceCheckUtils]: 20: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,691 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {931#(<= |id_#in~x| 2)} {880#(= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:12,692 INFO L280 TraceCheckUtils]: 22: Hoare triple {920#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {920#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:12,692 INFO L280 TraceCheckUtils]: 23: Hoare triple {920#(<= |id_#in~x| 3)} assume true; {920#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:12,694 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {920#(<= |id_#in~x| 3)} {880#(= |id_#in~x| id_~x)} #32#return; {903#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:22:12,695 INFO L280 TraceCheckUtils]: 25: Hoare triple {903#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {903#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:22:12,695 INFO L280 TraceCheckUtils]: 26: Hoare triple {903#(<= |id_#in~x| 4)} assume true; {903#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:22:12,696 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {903#(<= |id_#in~x| 4)} {851#(<= 5 main_~input~0)} #30#return; {848#false} is VALID [2020-07-17 22:22:12,698 INFO L263 TraceCheckUtils]: 0: Hoare triple {847#true} call ULTIMATE.init(); {847#true} is VALID [2020-07-17 22:22:12,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {847#true} assume true; {847#true} is VALID [2020-07-17 22:22:12,698 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {847#true} {847#true} #26#return; {847#true} is VALID [2020-07-17 22:22:12,699 INFO L263 TraceCheckUtils]: 3: Hoare triple {847#true} call #t~ret2 := main(); {847#true} is VALID [2020-07-17 22:22:12,699 INFO L280 TraceCheckUtils]: 4: Hoare triple {847#true} ~input~0 := 5; {851#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:12,700 INFO L263 TraceCheckUtils]: 5: Hoare triple {851#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {847#true} is VALID [2020-07-17 22:22:12,700 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,701 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,701 INFO L263 TraceCheckUtils]: 8: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,702 INFO L280 TraceCheckUtils]: 9: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,702 INFO L280 TraceCheckUtils]: 10: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,703 INFO L263 TraceCheckUtils]: 11: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,703 INFO L280 TraceCheckUtils]: 12: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,704 INFO L280 TraceCheckUtils]: 13: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,704 INFO L263 TraceCheckUtils]: 14: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,705 INFO L280 TraceCheckUtils]: 15: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,705 INFO L280 TraceCheckUtils]: 16: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,705 INFO L263 TraceCheckUtils]: 17: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,706 INFO L280 TraceCheckUtils]: 18: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,707 INFO L280 TraceCheckUtils]: 19: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:12,707 INFO L280 TraceCheckUtils]: 20: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:12,709 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,710 INFO L280 TraceCheckUtils]: 22: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,711 INFO L280 TraceCheckUtils]: 23: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,715 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,716 INFO L280 TraceCheckUtils]: 25: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,719 INFO L280 TraceCheckUtils]: 26: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,721 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {931#(<= |id_#in~x| 2)} {880#(= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:12,723 INFO L280 TraceCheckUtils]: 28: Hoare triple {920#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {920#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:12,726 INFO L280 TraceCheckUtils]: 29: Hoare triple {920#(<= |id_#in~x| 3)} assume true; {920#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:12,730 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {920#(<= |id_#in~x| 3)} {880#(= |id_#in~x| id_~x)} #32#return; {903#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:22:12,738 INFO L280 TraceCheckUtils]: 31: Hoare triple {903#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {903#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:22:12,739 INFO L280 TraceCheckUtils]: 32: Hoare triple {903#(<= |id_#in~x| 4)} assume true; {903#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:22:12,740 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {903#(<= |id_#in~x| 4)} {851#(<= 5 main_~input~0)} #30#return; {848#false} is VALID [2020-07-17 22:22:12,741 INFO L280 TraceCheckUtils]: 34: Hoare triple {848#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {848#false} is VALID [2020-07-17 22:22:12,741 INFO L280 TraceCheckUtils]: 35: Hoare triple {848#false} assume 5 != ~result~0; {848#false} is VALID [2020-07-17 22:22:12,741 INFO L280 TraceCheckUtils]: 36: Hoare triple {848#false} assume !false; {848#false} is VALID [2020-07-17 22:22:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-17 22:22:12,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820173593] [2020-07-17 22:22:12,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046124091] [2020-07-17 22:22:12,745 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-17 22:22:12,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:22:12,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:22:12,768 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-17 22:22:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:12,778 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:22:12,951 INFO L263 TraceCheckUtils]: 0: Hoare triple {847#true} call ULTIMATE.init(); {847#true} is VALID [2020-07-17 22:22:12,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {847#true} assume true; {847#true} is VALID [2020-07-17 22:22:12,952 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {847#true} {847#true} #26#return; {847#true} is VALID [2020-07-17 22:22:12,952 INFO L263 TraceCheckUtils]: 3: Hoare triple {847#true} call #t~ret2 := main(); {847#true} is VALID [2020-07-17 22:22:12,953 INFO L280 TraceCheckUtils]: 4: Hoare triple {847#true} ~input~0 := 5; {851#(<= 5 main_~input~0)} is VALID [2020-07-17 22:22:12,953 INFO L263 TraceCheckUtils]: 5: Hoare triple {851#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {847#true} is VALID [2020-07-17 22:22:12,954 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,954 INFO L280 TraceCheckUtils]: 7: Hoare triple {959#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,955 INFO L263 TraceCheckUtils]: 8: Hoare triple {959#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,955 INFO L280 TraceCheckUtils]: 9: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,956 INFO L280 TraceCheckUtils]: 10: Hoare triple {959#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,956 INFO L263 TraceCheckUtils]: 11: Hoare triple {959#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,957 INFO L280 TraceCheckUtils]: 12: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,957 INFO L280 TraceCheckUtils]: 13: Hoare triple {959#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,958 INFO L263 TraceCheckUtils]: 14: Hoare triple {959#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,958 INFO L280 TraceCheckUtils]: 15: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,959 INFO L280 TraceCheckUtils]: 16: Hoare triple {959#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,959 INFO L263 TraceCheckUtils]: 17: Hoare triple {959#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-17 22:22:12,960 INFO L280 TraceCheckUtils]: 18: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:12,961 INFO L280 TraceCheckUtils]: 19: Hoare triple {959#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {999#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:22:12,961 INFO L280 TraceCheckUtils]: 20: Hoare triple {999#(<= |id_#in~x| 0)} assume true; {999#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:22:12,963 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {999#(<= |id_#in~x| 0)} {959#(<= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,963 INFO L280 TraceCheckUtils]: 22: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,964 INFO L280 TraceCheckUtils]: 23: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:22:12,965 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {936#(<= |id_#in~x| 1)} {959#(<= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,966 INFO L280 TraceCheckUtils]: 25: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,967 INFO L280 TraceCheckUtils]: 26: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:22:12,968 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {931#(<= |id_#in~x| 2)} {959#(<= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:12,969 INFO L280 TraceCheckUtils]: 28: Hoare triple {920#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {920#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:12,969 INFO L280 TraceCheckUtils]: 29: Hoare triple {920#(<= |id_#in~x| 3)} assume true; {920#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:22:12,971 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {920#(<= |id_#in~x| 3)} {959#(<= |id_#in~x| id_~x)} #32#return; {903#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:22:12,972 INFO L280 TraceCheckUtils]: 31: Hoare triple {903#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {903#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:22:12,972 INFO L280 TraceCheckUtils]: 32: Hoare triple {903#(<= |id_#in~x| 4)} assume true; {903#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:22:12,973 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {903#(<= |id_#in~x| 4)} {851#(<= 5 main_~input~0)} #30#return; {848#false} is VALID [2020-07-17 22:22:12,974 INFO L280 TraceCheckUtils]: 34: Hoare triple {848#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {848#false} is VALID [2020-07-17 22:22:12,974 INFO L280 TraceCheckUtils]: 35: Hoare triple {848#false} assume 5 != ~result~0; {848#false} is VALID [2020-07-17 22:22:12,974 INFO L280 TraceCheckUtils]: 36: Hoare triple {848#false} assume !false; {848#false} is VALID [2020-07-17 22:22:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-17 22:22:12,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:22:12,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-07-17 22:22:12,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664813820] [2020-07-17 22:22:12,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-17 22:22:12,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:22:12,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:22:13,044 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-17 22:22:13,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:22:13,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:22:13,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:22:13,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:22:13,046 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 11 states. [2020-07-17 22:22:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:13,273 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-17 22:22:13,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:22:13,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-17 22:22:13,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:22:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:22:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-17 22:22:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:22:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-17 22:22:13,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2020-07-17 22:22:13,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:22:13,341 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:22:13,341 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:22:13,342 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:22:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:22:13,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 22:22:13,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:22:13,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-17 22:22:13,352 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:22:13,352 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:22:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:13,356 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-17 22:22:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-17 22:22:13,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:13,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:13,357 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:22:13,357 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:22:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:13,360 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-17 22:22:13,360 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-17 22:22:13,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:13,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:13,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:22:13,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:22:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:22:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-17 22:22:13,363 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-07-17 22:22:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:22:13,363 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-17 22:22:13,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:22:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-17 22:22:13,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-17 22:22:13,365 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:22:13,365 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:22:13,580 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:22:13,581 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:22:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:22:13,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-07-17 22:22:13,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:22:13,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300381219] [2020-07-17 22:22:13,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:22:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:13,653 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} assume true; {1198#true} is VALID [2020-07-17 22:22:13,653 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1198#true} {1198#true} #26#return; {1198#true} is VALID [2020-07-17 22:22:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:13,974 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:13,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:13,976 INFO L280 TraceCheckUtils]: 2: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:13,977 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:22:13,978 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:13,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:13,978 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:13,978 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:13,979 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:13,980 INFO L280 TraceCheckUtils]: 5: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:13,982 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:22:13,983 INFO L280 TraceCheckUtils]: 7: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:13,984 INFO L280 TraceCheckUtils]: 8: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:13,985 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-17 22:22:13,986 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:13,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:13,987 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:13,987 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:13,987 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:13,988 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:13,988 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:13,990 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:13,991 INFO L280 TraceCheckUtils]: 8: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:13,993 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:22:13,994 INFO L280 TraceCheckUtils]: 10: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:13,995 INFO L280 TraceCheckUtils]: 11: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:13,997 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-17 22:22:13,998 INFO L280 TraceCheckUtils]: 13: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-17 22:22:13,999 INFO L280 TraceCheckUtils]: 14: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-17 22:22:14,001 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,002 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,002 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,003 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,003 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,003 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,003 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,004 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,004 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,004 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,005 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,006 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:14,007 INFO L280 TraceCheckUtils]: 11: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:14,009 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:22:14,010 INFO L280 TraceCheckUtils]: 13: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:14,011 INFO L280 TraceCheckUtils]: 14: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:14,012 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,014 INFO L280 TraceCheckUtils]: 16: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-17 22:22:14,015 INFO L280 TraceCheckUtils]: 17: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-17 22:22:14,017 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,018 INFO L280 TraceCheckUtils]: 19: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:22:14,019 INFO L280 TraceCheckUtils]: 20: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:22:14,021 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,023 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,023 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,024 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,024 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,024 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,025 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,025 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,025 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,026 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,026 INFO L263 TraceCheckUtils]: 11: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,026 INFO L280 TraceCheckUtils]: 12: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,027 INFO L280 TraceCheckUtils]: 13: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:14,028 INFO L280 TraceCheckUtils]: 14: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:14,030 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:22:14,031 INFO L280 TraceCheckUtils]: 16: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:14,032 INFO L280 TraceCheckUtils]: 17: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:14,034 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,035 INFO L280 TraceCheckUtils]: 19: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-17 22:22:14,036 INFO L280 TraceCheckUtils]: 20: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-17 22:22:14,037 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,038 INFO L280 TraceCheckUtils]: 22: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:22:14,039 INFO L280 TraceCheckUtils]: 23: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:22:14,041 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,043 INFO L280 TraceCheckUtils]: 25: Hoare triple {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-17 22:22:14,044 INFO L280 TraceCheckUtils]: 26: Hoare triple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-17 22:22:14,046 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1198#true} #32#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-17 22:22:14,049 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,050 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,050 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,050 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,051 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,051 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,051 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,052 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,052 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,052 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,052 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,053 INFO L263 TraceCheckUtils]: 11: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,053 INFO L280 TraceCheckUtils]: 12: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,053 INFO L280 TraceCheckUtils]: 13: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,053 INFO L263 TraceCheckUtils]: 14: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,053 INFO L280 TraceCheckUtils]: 15: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,054 INFO L280 TraceCheckUtils]: 16: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:14,055 INFO L280 TraceCheckUtils]: 17: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:14,056 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:22:14,057 INFO L280 TraceCheckUtils]: 19: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:14,058 INFO L280 TraceCheckUtils]: 20: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:14,059 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,060 INFO L280 TraceCheckUtils]: 22: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-17 22:22:14,061 INFO L280 TraceCheckUtils]: 23: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-17 22:22:14,062 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,064 INFO L280 TraceCheckUtils]: 25: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:22:14,065 INFO L280 TraceCheckUtils]: 26: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:22:14,066 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,068 INFO L280 TraceCheckUtils]: 28: Hoare triple {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-17 22:22:14,068 INFO L280 TraceCheckUtils]: 29: Hoare triple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-17 22:22:14,070 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1198#true} #32#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-17 22:22:14,072 INFO L280 TraceCheckUtils]: 31: Hoare triple {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-17 22:22:14,073 INFO L280 TraceCheckUtils]: 32: Hoare triple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-17 22:22:14,074 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1198#true} #30#return; {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} is VALID [2020-07-17 22:22:14,078 INFO L263 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2020-07-17 22:22:14,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume true; {1198#true} is VALID [2020-07-17 22:22:14,078 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1198#true} {1198#true} #26#return; {1198#true} is VALID [2020-07-17 22:22:14,078 INFO L263 TraceCheckUtils]: 3: Hoare triple {1198#true} call #t~ret2 := main(); {1198#true} is VALID [2020-07-17 22:22:14,079 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} ~input~0 := 5; {1198#true} is VALID [2020-07-17 22:22:14,079 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret1 := id(~input~0); {1198#true} is VALID [2020-07-17 22:22:14,079 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,080 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,080 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,080 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,080 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,081 INFO L263 TraceCheckUtils]: 11: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,081 INFO L280 TraceCheckUtils]: 12: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,081 INFO L280 TraceCheckUtils]: 13: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,082 INFO L263 TraceCheckUtils]: 14: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,082 INFO L280 TraceCheckUtils]: 15: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,082 INFO L280 TraceCheckUtils]: 16: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,082 INFO L263 TraceCheckUtils]: 17: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,083 INFO L280 TraceCheckUtils]: 18: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,083 INFO L280 TraceCheckUtils]: 19: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,083 INFO L263 TraceCheckUtils]: 20: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,084 INFO L280 TraceCheckUtils]: 21: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,085 INFO L280 TraceCheckUtils]: 22: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:14,086 INFO L280 TraceCheckUtils]: 23: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:14,088 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:22:14,089 INFO L280 TraceCheckUtils]: 25: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:14,090 INFO L280 TraceCheckUtils]: 26: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:14,091 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,093 INFO L280 TraceCheckUtils]: 28: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-17 22:22:14,094 INFO L280 TraceCheckUtils]: 29: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-17 22:22:14,096 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,097 INFO L280 TraceCheckUtils]: 31: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:22:14,098 INFO L280 TraceCheckUtils]: 32: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:22:14,100 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,101 INFO L280 TraceCheckUtils]: 34: Hoare triple {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-17 22:22:14,102 INFO L280 TraceCheckUtils]: 35: Hoare triple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-17 22:22:14,103 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1198#true} #32#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-17 22:22:14,104 INFO L280 TraceCheckUtils]: 37: Hoare triple {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-17 22:22:14,105 INFO L280 TraceCheckUtils]: 38: Hoare triple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-17 22:22:14,107 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1198#true} #30#return; {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} is VALID [2020-07-17 22:22:14,108 INFO L280 TraceCheckUtils]: 40: Hoare triple {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {1237#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-17 22:22:14,109 INFO L280 TraceCheckUtils]: 41: Hoare triple {1237#(and (< 4 main_~result~0) (<= main_~result~0 5))} assume 5 != ~result~0; {1199#false} is VALID [2020-07-17 22:22:14,109 INFO L280 TraceCheckUtils]: 42: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2020-07-17 22:22:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-17 22:22:14,113 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300381219] [2020-07-17 22:22:14,113 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476741473] [2020-07-17 22:22:14,113 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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-17 22:22:14,159 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-17 22:22:14,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:22:14,162 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-17 22:22:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:14,188 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:22:14,416 INFO L263 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2020-07-17 22:22:14,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume true; {1198#true} is VALID [2020-07-17 22:22:14,417 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1198#true} {1198#true} #26#return; {1198#true} is VALID [2020-07-17 22:22:14,417 INFO L263 TraceCheckUtils]: 3: Hoare triple {1198#true} call #t~ret2 := main(); {1198#true} is VALID [2020-07-17 22:22:14,417 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} ~input~0 := 5; {1198#true} is VALID [2020-07-17 22:22:14,418 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret1 := id(~input~0); {1198#true} is VALID [2020-07-17 22:22:14,418 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,418 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,418 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,418 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,419 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,419 INFO L263 TraceCheckUtils]: 11: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,419 INFO L280 TraceCheckUtils]: 12: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,419 INFO L280 TraceCheckUtils]: 13: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,419 INFO L263 TraceCheckUtils]: 14: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,420 INFO L280 TraceCheckUtils]: 15: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,420 INFO L280 TraceCheckUtils]: 16: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,420 INFO L263 TraceCheckUtils]: 17: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,420 INFO L280 TraceCheckUtils]: 18: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,420 INFO L280 TraceCheckUtils]: 19: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-17 22:22:14,421 INFO L263 TraceCheckUtils]: 20: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-17 22:22:14,421 INFO L280 TraceCheckUtils]: 21: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-17 22:22:14,423 INFO L280 TraceCheckUtils]: 22: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:14,424 INFO L280 TraceCheckUtils]: 23: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:22:14,425 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:22:14,426 INFO L280 TraceCheckUtils]: 25: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:14,427 INFO L280 TraceCheckUtils]: 26: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-17 22:22:14,429 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,430 INFO L280 TraceCheckUtils]: 28: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-17 22:22:14,431 INFO L280 TraceCheckUtils]: 29: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-17 22:22:14,432 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,433 INFO L280 TraceCheckUtils]: 31: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:22:14,434 INFO L280 TraceCheckUtils]: 32: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-17 22:22:14,436 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-17 22:22:14,437 INFO L280 TraceCheckUtils]: 34: Hoare triple {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-17 22:22:14,438 INFO L280 TraceCheckUtils]: 35: Hoare triple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-17 22:22:14,443 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1198#true} #32#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-17 22:22:14,444 INFO L280 TraceCheckUtils]: 37: Hoare triple {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-17 22:22:14,445 INFO L280 TraceCheckUtils]: 38: Hoare triple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-17 22:22:14,446 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1198#true} #30#return; {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} is VALID [2020-07-17 22:22:14,447 INFO L280 TraceCheckUtils]: 40: Hoare triple {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {1237#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-17 22:22:14,447 INFO L280 TraceCheckUtils]: 41: Hoare triple {1237#(and (< 4 main_~result~0) (<= main_~result~0 5))} assume 5 != ~result~0; {1199#false} is VALID [2020-07-17 22:22:14,448 INFO L280 TraceCheckUtils]: 42: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2020-07-17 22:22:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-17 22:22:14,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:22:14,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2020-07-17 22:22:14,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035589475] [2020-07-17 22:22:14,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2020-07-17 22:22:14,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:22:14,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-17 22:22:14,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:22:14,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 22:22:14,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:22:14,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 22:22:14,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:22:14,499 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2020-07-17 22:22:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:15,039 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-07-17 22:22:15,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 22:22:15,039 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2020-07-17 22:22:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:22:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:22:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2020-07-17 22:22:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:22:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2020-07-17 22:22:15,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 38 transitions. [2020-07-17 22:22:15,099 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-17 22:22:15,100 INFO L225 Difference]: With dead ends: 37 [2020-07-17 22:22:15,101 INFO L226 Difference]: Without dead ends: 33 [2020-07-17 22:22:15,101 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-17 22:22:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-17 22:22:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-17 22:22:15,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:22:15,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-17 22:22:15,113 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-17 22:22:15,113 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-17 22:22:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:15,117 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-17 22:22:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-17 22:22:15,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:15,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:15,118 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-17 22:22:15,118 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-17 22:22:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:15,126 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-17 22:22:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-17 22:22:15,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:15,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:15,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:22:15,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:22:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:22:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-17 22:22:15,133 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-07-17 22:22:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:22:15,134 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-17 22:22:15,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 22:22:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-17 22:22:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-17 22:22:15,135 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:22:15,135 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:22:15,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-17 22:22:15,337 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:22:15,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:22:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2020-07-17 22:22:15,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:22:15,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724837983] [2020-07-17 22:22:15,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:22:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:15,374 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} assume true; {1607#true} is VALID [2020-07-17 22:22:15,374 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1607#true} {1607#true} #26#return; {1607#true} is VALID [2020-07-17 22:22:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:15,587 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,590 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,591 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,591 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,592 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,592 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,593 INFO L280 TraceCheckUtils]: 5: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,594 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,595 INFO L280 TraceCheckUtils]: 7: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,595 INFO L280 TraceCheckUtils]: 8: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,597 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,598 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,598 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,600 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,601 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,601 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,602 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,604 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,604 INFO L280 TraceCheckUtils]: 8: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,605 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,606 INFO L280 TraceCheckUtils]: 10: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,606 INFO L280 TraceCheckUtils]: 11: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,608 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,608 INFO L280 TraceCheckUtils]: 13: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,609 INFO L280 TraceCheckUtils]: 14: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,610 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,612 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,613 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,613 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,614 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,614 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,615 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,617 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,617 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,618 INFO L280 TraceCheckUtils]: 11: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,619 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,620 INFO L280 TraceCheckUtils]: 13: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,620 INFO L280 TraceCheckUtils]: 14: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,622 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,623 INFO L280 TraceCheckUtils]: 16: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,623 INFO L280 TraceCheckUtils]: 17: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,625 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,626 INFO L280 TraceCheckUtils]: 19: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,626 INFO L280 TraceCheckUtils]: 20: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,628 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:15,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,630 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,631 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,631 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,631 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,632 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,633 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,633 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,633 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,634 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,634 INFO L263 TraceCheckUtils]: 11: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,635 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,635 INFO L280 TraceCheckUtils]: 13: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,636 INFO L280 TraceCheckUtils]: 14: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,637 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,638 INFO L280 TraceCheckUtils]: 16: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,638 INFO L280 TraceCheckUtils]: 17: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,640 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,640 INFO L280 TraceCheckUtils]: 19: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,641 INFO L280 TraceCheckUtils]: 20: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,642 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,643 INFO L280 TraceCheckUtils]: 22: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,644 INFO L280 TraceCheckUtils]: 23: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,645 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:15,645 INFO L280 TraceCheckUtils]: 25: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:15,646 INFO L280 TraceCheckUtils]: 26: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:15,647 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:22:15,649 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,650 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,651 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,651 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,652 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,653 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,653 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,654 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,654 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,655 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,655 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,655 INFO L263 TraceCheckUtils]: 11: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,656 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,656 INFO L280 TraceCheckUtils]: 13: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,657 INFO L263 TraceCheckUtils]: 14: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,657 INFO L280 TraceCheckUtils]: 15: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,658 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,658 INFO L280 TraceCheckUtils]: 17: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,660 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,660 INFO L280 TraceCheckUtils]: 19: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,661 INFO L280 TraceCheckUtils]: 20: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,662 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,662 INFO L280 TraceCheckUtils]: 22: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,663 INFO L280 TraceCheckUtils]: 23: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,664 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,665 INFO L280 TraceCheckUtils]: 25: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,665 INFO L280 TraceCheckUtils]: 26: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,667 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:15,667 INFO L280 TraceCheckUtils]: 28: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:15,668 INFO L280 TraceCheckUtils]: 29: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:15,669 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:22:15,670 INFO L280 TraceCheckUtils]: 31: Hoare triple {1716#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:22:15,671 INFO L280 TraceCheckUtils]: 32: Hoare triple {1716#(<= 5 |id_#in~x|)} assume true; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:22:15,672 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1716#(<= 5 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:22:15,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,675 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,676 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,677 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,677 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,678 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,678 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,679 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,679 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,680 INFO L263 TraceCheckUtils]: 11: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,680 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,681 INFO L280 TraceCheckUtils]: 13: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,681 INFO L263 TraceCheckUtils]: 14: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,682 INFO L280 TraceCheckUtils]: 15: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,683 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,683 INFO L263 TraceCheckUtils]: 17: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,683 INFO L280 TraceCheckUtils]: 18: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,684 INFO L280 TraceCheckUtils]: 19: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,685 INFO L280 TraceCheckUtils]: 20: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,686 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,687 INFO L280 TraceCheckUtils]: 22: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,687 INFO L280 TraceCheckUtils]: 23: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,689 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,689 INFO L280 TraceCheckUtils]: 25: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,690 INFO L280 TraceCheckUtils]: 26: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,691 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,692 INFO L280 TraceCheckUtils]: 28: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,692 INFO L280 TraceCheckUtils]: 29: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,694 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:15,696 INFO L280 TraceCheckUtils]: 31: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:15,696 INFO L280 TraceCheckUtils]: 32: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:15,697 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:22:15,698 INFO L280 TraceCheckUtils]: 34: Hoare triple {1716#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:22:15,699 INFO L280 TraceCheckUtils]: 35: Hoare triple {1716#(<= 5 |id_#in~x|)} assume true; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:22:15,700 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1716#(<= 5 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:22:15,700 INFO L280 TraceCheckUtils]: 37: Hoare triple {1687#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:22:15,701 INFO L280 TraceCheckUtils]: 38: Hoare triple {1687#(<= 6 |id_#in~x|)} assume true; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:22:15,703 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1687#(<= 6 |id_#in~x|)} {1611#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #30#return; {1608#false} is VALID [2020-07-17 22:22:15,705 INFO L263 TraceCheckUtils]: 0: Hoare triple {1607#true} call ULTIMATE.init(); {1607#true} is VALID [2020-07-17 22:22:15,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {1607#true} assume true; {1607#true} is VALID [2020-07-17 22:22:15,705 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1607#true} {1607#true} #26#return; {1607#true} is VALID [2020-07-17 22:22:15,705 INFO L263 TraceCheckUtils]: 3: Hoare triple {1607#true} call #t~ret2 := main(); {1607#true} is VALID [2020-07-17 22:22:15,706 INFO L280 TraceCheckUtils]: 4: Hoare triple {1607#true} ~input~0 := 5; {1611#(and (<= main_~input~0 5) (<= 5 main_~input~0))} is VALID [2020-07-17 22:22:15,707 INFO L263 TraceCheckUtils]: 5: Hoare triple {1611#(and (<= main_~input~0 5) (<= 5 main_~input~0))} call #t~ret1 := id(~input~0); {1607#true} is VALID [2020-07-17 22:22:15,707 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,708 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,708 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,709 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,709 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,709 INFO L263 TraceCheckUtils]: 11: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,710 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,712 INFO L280 TraceCheckUtils]: 13: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,712 INFO L263 TraceCheckUtils]: 14: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,713 INFO L280 TraceCheckUtils]: 15: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,713 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,713 INFO L263 TraceCheckUtils]: 17: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,714 INFO L280 TraceCheckUtils]: 18: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,715 INFO L280 TraceCheckUtils]: 19: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,715 INFO L263 TraceCheckUtils]: 20: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,715 INFO L280 TraceCheckUtils]: 21: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,716 INFO L280 TraceCheckUtils]: 22: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,716 INFO L263 TraceCheckUtils]: 23: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:15,717 INFO L280 TraceCheckUtils]: 24: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:22:15,717 INFO L280 TraceCheckUtils]: 25: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,718 INFO L280 TraceCheckUtils]: 26: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:15,719 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,719 INFO L280 TraceCheckUtils]: 28: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,720 INFO L280 TraceCheckUtils]: 29: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:15,721 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,721 INFO L280 TraceCheckUtils]: 31: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,722 INFO L280 TraceCheckUtils]: 32: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:15,723 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,724 INFO L280 TraceCheckUtils]: 34: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,724 INFO L280 TraceCheckUtils]: 35: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:15,725 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:15,726 INFO L280 TraceCheckUtils]: 37: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:15,726 INFO L280 TraceCheckUtils]: 38: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:15,728 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:22:15,728 INFO L280 TraceCheckUtils]: 40: Hoare triple {1716#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:22:15,729 INFO L280 TraceCheckUtils]: 41: Hoare triple {1716#(<= 5 |id_#in~x|)} assume true; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:22:15,730 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1716#(<= 5 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:22:15,730 INFO L280 TraceCheckUtils]: 43: Hoare triple {1687#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:22:15,731 INFO L280 TraceCheckUtils]: 44: Hoare triple {1687#(<= 6 |id_#in~x|)} assume true; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:22:15,732 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1687#(<= 6 |id_#in~x|)} {1611#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #30#return; {1608#false} is VALID [2020-07-17 22:22:15,732 INFO L280 TraceCheckUtils]: 46: Hoare triple {1608#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {1608#false} is VALID [2020-07-17 22:22:15,732 INFO L280 TraceCheckUtils]: 47: Hoare triple {1608#false} assume 5 != ~result~0; {1608#false} is VALID [2020-07-17 22:22:15,732 INFO L280 TraceCheckUtils]: 48: Hoare triple {1608#false} assume !false; {1608#false} is VALID [2020-07-17 22:22:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-07-17 22:22:15,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724837983] [2020-07-17 22:22:15,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732250366] [2020-07-17 22:22:15,736 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-17 22:22:15,796 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-17 22:22:15,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:22:15,798 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-17 22:22:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:22:15,815 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:22:16,024 INFO L263 TraceCheckUtils]: 0: Hoare triple {1607#true} call ULTIMATE.init(); {1607#true} is VALID [2020-07-17 22:22:16,024 INFO L280 TraceCheckUtils]: 1: Hoare triple {1607#true} assume true; {1607#true} is VALID [2020-07-17 22:22:16,024 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1607#true} {1607#true} #26#return; {1607#true} is VALID [2020-07-17 22:22:16,025 INFO L263 TraceCheckUtils]: 3: Hoare triple {1607#true} call #t~ret2 := main(); {1607#true} is VALID [2020-07-17 22:22:16,025 INFO L280 TraceCheckUtils]: 4: Hoare triple {1607#true} ~input~0 := 5; {1789#(<= main_~input~0 5)} is VALID [2020-07-17 22:22:16,026 INFO L263 TraceCheckUtils]: 5: Hoare triple {1789#(<= main_~input~0 5)} call #t~ret1 := id(~input~0); {1607#true} is VALID [2020-07-17 22:22:16,026 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:22:16,031 INFO L280 TraceCheckUtils]: 7: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:22:16,032 INFO L263 TraceCheckUtils]: 8: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:16,034 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:22:16,034 INFO L280 TraceCheckUtils]: 10: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:22:16,034 INFO L263 TraceCheckUtils]: 11: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:16,035 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:22:16,036 INFO L280 TraceCheckUtils]: 13: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:22:16,036 INFO L263 TraceCheckUtils]: 14: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:16,036 INFO L280 TraceCheckUtils]: 15: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:22:16,037 INFO L280 TraceCheckUtils]: 16: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:22:16,037 INFO L263 TraceCheckUtils]: 17: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:16,038 INFO L280 TraceCheckUtils]: 18: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:22:16,038 INFO L280 TraceCheckUtils]: 19: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:22:16,038 INFO L263 TraceCheckUtils]: 20: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:16,039 INFO L280 TraceCheckUtils]: 21: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:22:16,039 INFO L280 TraceCheckUtils]: 22: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:22:16,040 INFO L263 TraceCheckUtils]: 23: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-17 22:22:16,040 INFO L280 TraceCheckUtils]: 24: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-17 22:22:16,041 INFO L280 TraceCheckUtils]: 25: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume 0 == ~x;#res := 0; {1854#(<= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:16,041 INFO L280 TraceCheckUtils]: 26: Hoare triple {1854#(<= 0 |id_#in~x|)} assume true; {1854#(<= 0 |id_#in~x|)} is VALID [2020-07-17 22:22:16,043 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1854#(<= 0 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:16,043 INFO L280 TraceCheckUtils]: 28: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:16,044 INFO L280 TraceCheckUtils]: 29: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-17 22:22:16,045 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:16,046 INFO L280 TraceCheckUtils]: 31: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:16,046 INFO L280 TraceCheckUtils]: 32: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-17 22:22:16,047 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:16,048 INFO L280 TraceCheckUtils]: 34: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:16,049 INFO L280 TraceCheckUtils]: 35: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-17 22:22:16,050 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:16,051 INFO L280 TraceCheckUtils]: 37: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:16,051 INFO L280 TraceCheckUtils]: 38: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-17 22:22:16,053 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:22:16,053 INFO L280 TraceCheckUtils]: 40: Hoare triple {1716#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:22:16,054 INFO L280 TraceCheckUtils]: 41: Hoare triple {1716#(<= 5 |id_#in~x|)} assume true; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-17 22:22:16,055 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1716#(<= 5 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:22:16,056 INFO L280 TraceCheckUtils]: 43: Hoare triple {1687#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:22:16,056 INFO L280 TraceCheckUtils]: 44: Hoare triple {1687#(<= 6 |id_#in~x|)} assume true; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-17 22:22:16,057 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1687#(<= 6 |id_#in~x|)} {1789#(<= main_~input~0 5)} #30#return; {1608#false} is VALID [2020-07-17 22:22:16,058 INFO L280 TraceCheckUtils]: 46: Hoare triple {1608#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {1608#false} is VALID [2020-07-17 22:22:16,058 INFO L280 TraceCheckUtils]: 47: Hoare triple {1608#false} assume 5 != ~result~0; {1608#false} is VALID [2020-07-17 22:22:16,058 INFO L280 TraceCheckUtils]: 48: Hoare triple {1608#false} assume !false; {1608#false} is VALID [2020-07-17 22:22:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-07-17 22:22:16,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:22:16,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 14 [2020-07-17 22:22:16,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037735445] [2020-07-17 22:22:16,065 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-07-17 22:22:16,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:22:16,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:22:16,107 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-17 22:22:16,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:22:16,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:22:16,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:22:16,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:22:16,108 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-07-17 22:22:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:16,435 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-17 22:22:16,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:22:16,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-07-17 22:22:16,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:22:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:22:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2020-07-17 22:22:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:22:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2020-07-17 22:22:16,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 34 transitions. [2020-07-17 22:22:16,491 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-17 22:22:16,491 INFO L225 Difference]: With dead ends: 33 [2020-07-17 22:22:16,491 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:22:16,493 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2020-07-17 22:22:16,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:22:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:22:16,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:22:16,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:22:16,494 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:22:16,494 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:22:16,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:16,494 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:22:16,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:22:16,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:16,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:16,495 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:22:16,495 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:22:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:22:16,495 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:22:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:22:16,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:16,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:22:16,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:22:16,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:22:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:22:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:22:16,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2020-07-17 22:22:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:22:16,497 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:22:16,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:22:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:22:16,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:22:16,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:22:16,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:22:16,751 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:22:16,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:22:16,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:22:16,751 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:22:16,752 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:22:16,752 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:22:16,752 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2020-07-17 22:22:16,752 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-07-17 22:22:16,752 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 9 15) no Hoare annotation was computed. [2020-07-17 22:22:16,752 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-17 22:22:16,753 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-07-17 22:22:16,753 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-07-17 22:22:16,753 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-17 22:22:16,753 INFO L268 CegarLoopResult]: For program point L12-2(lines 9 15) no Hoare annotation was computed. [2020-07-17 22:22:16,753 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2020-07-17 22:22:16,753 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2020-07-17 22:22:16,753 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-07-17 22:22:16,753 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-17 22:22:16,753 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-17 22:22:16,754 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-07-17 22:22:16,758 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:22:16,759 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:22:16,759 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:22:16,759 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:22:16,760 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-17 22:22:16,760 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:22:16,760 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:22:16,760 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:22:16,760 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-17 22:22:16,760 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-17 22:22:16,760 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-17 22:22:16,760 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-17 22:22:16,760 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-17 22:22:16,761 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-17 22:22:16,761 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-17 22:22:16,761 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-17 22:22:16,761 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:22:16,761 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:22:16,761 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-17 22:22:16,761 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:22:16,761 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:22:16,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:22:16 BoogieIcfgContainer [2020-07-17 22:22:16,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:22:16,767 INFO L168 Benchmark]: Toolchain (without parser) took 8939.16 ms. Allocated memory was 145.8 MB in the beginning and 287.8 MB in the end (delta: 142.1 MB). Free memory was 102.6 MB in the beginning and 221.7 MB in the end (delta: -119.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:22:16,767 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.8 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:22:16,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.59 ms. Allocated memory is still 145.8 MB. Free memory was 102.2 MB in the beginning and 93.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:22:16,768 INFO L168 Benchmark]: Boogie Preprocessor took 29.80 ms. Allocated memory is still 145.8 MB. Free memory was 93.0 MB in the beginning and 91.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:22:16,769 INFO L168 Benchmark]: RCFGBuilder took 437.43 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 91.6 MB in the beginning and 169.2 MB in the end (delta: -77.7 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:22:16,770 INFO L168 Benchmark]: TraceAbstraction took 8262.78 ms. Allocated memory was 203.4 MB in the beginning and 287.8 MB in the end (delta: 84.4 MB). Free memory was 168.6 MB in the beginning and 221.7 MB in the end (delta: -53.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:22:16,772 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 145.8 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 202.59 ms. Allocated memory is still 145.8 MB. Free memory was 102.2 MB in the beginning and 93.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.80 ms. Allocated memory is still 145.8 MB. Free memory was 93.0 MB in the beginning and 91.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 437.43 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 91.6 MB in the beginning and 169.2 MB in the end (delta: -77.7 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8262.78 ms. Allocated memory was 203.4 MB in the beginning and 287.8 MB in the end (delta: 84.4 MB). Free memory was 168.6 MB in the beginning and 221.7 MB in the end (delta: -53.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.0s, OverallIterations: 7, TraceHistogramMax: 7, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 115 SDtfs, 78 SDslu, 549 SDs, 0 SdLazy, 276 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 261 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 15 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 421 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 38256 SizeOfPredicates, 27 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 396/588 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...