/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:21:23,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:21:23,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:21:23,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:21:23,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:21:23,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:21:23,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:21:23,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:21:23,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:21:23,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:21:23,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:21:23,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:21:23,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:21:23,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:21:23,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:21:23,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:21:23,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:21:23,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:21:23,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:21:23,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:21:23,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:21:23,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:21:23,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:21:23,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:21:23,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:21:23,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:21:23,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:21:23,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:21:23,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:21:23,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:21:23,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:21:23,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:21:23,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:21:23,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:21:23,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:21:23,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:21:23,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:21:23,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:21:23,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:21:23,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:21:23,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:21:23,286 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:21:23,309 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:21:23,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:21:23,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:21:23,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:21:23,312 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:21:23,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:21:23,312 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:21:23,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:21:23,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:21:23,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:21:23,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:21:23,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:21:23,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:21:23,314 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:21:23,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:21:23,314 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:21:23,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:21:23,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:21:23,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:21:23,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:21:23,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:21:23,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:21:23,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:21:23,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:21:23,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:21:23,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:21:23,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:21:23,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:21:23,317 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:21:23,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:21:23,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:21:23,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:21:23,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:21:23,631 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:21:23,631 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:21:23,632 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2020-07-17 22:21:23,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e6d4b019/dee7783abf374992ba51a6c88b0b954a/FLAGa666996e0 [2020-07-17 22:21:24,146 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:21:24,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2020-07-17 22:21:24,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e6d4b019/dee7783abf374992ba51a6c88b0b954a/FLAGa666996e0 [2020-07-17 22:21:24,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e6d4b019/dee7783abf374992ba51a6c88b0b954a [2020-07-17 22:21:24,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:21:24,540 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:21:24,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:21:24,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:21:24,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:21:24,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@515fc9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24, skipping insertion in model container [2020-07-17 22:21:24,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:21:24,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:21:24,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:21:24,758 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:21:24,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:21:24,797 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:21:24,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24 WrapperNode [2020-07-17 22:21:24,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:21:24,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:21:24,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:21:24,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:21:24,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... [2020-07-17 22:21:24,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:21:24,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:21:24,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:21:24,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:21:24,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:21:25,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:21:25,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:21:25,042 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-17 22:21:25,043 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-07-17 22:21:25,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:21:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:21:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:21:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-17 22:21:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-07-17 22:21:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:21:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:21:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:21:25,439 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:21:25,440 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:21:25,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:21:25 BoogieIcfgContainer [2020-07-17 22:21:25,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:21:25,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:21:25,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:21:25,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:21:25,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:21:24" (1/3) ... [2020-07-17 22:21:25,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6471461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:21:25, skipping insertion in model container [2020-07-17 22:21:25,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:24" (2/3) ... [2020-07-17 22:21:25,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6471461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:21:25, skipping insertion in model container [2020-07-17 22:21:25,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:21:25" (3/3) ... [2020-07-17 22:21:25,459 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-1.c [2020-07-17 22:21:25,471 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:21:25,479 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:21:25,492 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:21:25,519 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:21:25,519 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:21:25,520 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:21:25,520 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:21:25,520 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:21:25,520 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:21:25,521 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:21:25,521 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:21:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-17 22:21:25,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:21:25,548 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:25,549 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:25,550 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:25,557 INFO L82 PathProgramCache]: Analyzing trace with hash -550894517, now seen corresponding path program 1 times [2020-07-17 22:21:25,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:25,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714147062] [2020-07-17 22:21:25,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:25,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-17 22:21:25,784 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29#true} {29#true} #36#return; {29#true} is VALID [2020-07-17 22:21:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:25,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:25,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:25,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:25,882 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#(= 0 |id_#in~x|)} {33#(<= 5 main_~input~0)} #40#return; {30#false} is VALID [2020-07-17 22:21:25,882 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2020-07-17 22:21:25,883 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-17 22:21:25,883 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #36#return; {29#true} is VALID [2020-07-17 22:21:25,883 INFO L263 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret3 := main(); {29#true} is VALID [2020-07-17 22:21:25,885 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#true} ~input~0 := 5; {33#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:25,885 INFO L263 TraceCheckUtils]: 5: Hoare triple {33#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {29#true} is VALID [2020-07-17 22:21:25,887 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:25,888 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:25,889 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:25,891 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {39#(= 0 |id_#in~x|)} {33#(<= 5 main_~input~0)} #40#return; {30#false} is VALID [2020-07-17 22:21:25,892 INFO L280 TraceCheckUtils]: 10: Hoare triple {30#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {30#false} is VALID [2020-07-17 22:21:25,892 INFO L280 TraceCheckUtils]: 11: Hoare triple {30#false} assume 5 == ~result~0; {30#false} is VALID [2020-07-17 22:21:25,893 INFO L280 TraceCheckUtils]: 12: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-17 22:21:25,894 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:21:25,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714147062] [2020-07-17 22:21:25,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:21:25,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:21:25,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743911251] [2020-07-17 22:21:25,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:21:25,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:25,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:21:25,945 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:21:25,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:21:25,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:25,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:21:25,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:21:25,957 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2020-07-17 22:21:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:26,212 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-17 22:21:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:21:26,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:21:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:26,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-17 22:21:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-17 22:21:26,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-17 22:21:26,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:26,316 INFO L225 Difference]: With dead ends: 36 [2020-07-17 22:21:26,317 INFO L226 Difference]: Without dead ends: 24 [2020-07-17 22:21:26,321 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:21:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-17 22:21:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-17 22:21:26,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:26,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-17 22:21:26,412 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:21:26,412 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:21:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:26,418 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-17 22:21:26,419 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-17 22:21:26,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:26,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:26,420 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:21:26,420 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:21:26,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:26,425 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-17 22:21:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-17 22:21:26,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:26,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:26,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:26,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:21:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-17 22:21:26,431 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2020-07-17 22:21:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:26,432 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-17 22:21:26,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:21:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-17 22:21:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:21:26,434 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:26,434 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:26,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:21:26,435 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:26,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:26,436 INFO L82 PathProgramCache]: Analyzing trace with hash 40504409, now seen corresponding path program 1 times [2020-07-17 22:21:26,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:26,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932346310] [2020-07-17 22:21:26,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {170#true} assume true; {170#true} is VALID [2020-07-17 22:21:26,496 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {170#true} {170#true} #36#return; {170#true} is VALID [2020-07-17 22:21:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:26,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {170#true} ~x := #in~x; {191#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:26,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {191#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:26,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {192#(= 0 |id2_#in~x|)} assume true; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:26,626 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {192#(= 0 |id2_#in~x|)} {185#(= |id_#in~x| id_~x)} #42#return; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,628 INFO L280 TraceCheckUtils]: 0: Hoare triple {170#true} ~x := #in~x; {185#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:26,629 INFO L280 TraceCheckUtils]: 1: Hoare triple {185#(= |id_#in~x| id_~x)} assume !(0 == ~x); {185#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:26,630 INFO L263 TraceCheckUtils]: 2: Hoare triple {185#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {170#true} is VALID [2020-07-17 22:21:26,631 INFO L280 TraceCheckUtils]: 3: Hoare triple {170#true} ~x := #in~x; {191#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:26,632 INFO L280 TraceCheckUtils]: 4: Hoare triple {191#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:26,633 INFO L280 TraceCheckUtils]: 5: Hoare triple {192#(= 0 |id2_#in~x|)} assume true; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:26,635 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {192#(= 0 |id2_#in~x|)} {185#(= |id_#in~x| id_~x)} #42#return; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,636 INFO L280 TraceCheckUtils]: 7: Hoare triple {190#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,638 INFO L280 TraceCheckUtils]: 8: Hoare triple {190#(<= |id_#in~x| 1)} assume true; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,640 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {190#(<= |id_#in~x| 1)} {174#(<= 5 main_~input~0)} #40#return; {171#false} is VALID [2020-07-17 22:21:26,641 INFO L263 TraceCheckUtils]: 0: Hoare triple {170#true} call ULTIMATE.init(); {170#true} is VALID [2020-07-17 22:21:26,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {170#true} assume true; {170#true} is VALID [2020-07-17 22:21:26,642 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {170#true} {170#true} #36#return; {170#true} is VALID [2020-07-17 22:21:26,643 INFO L263 TraceCheckUtils]: 3: Hoare triple {170#true} call #t~ret3 := main(); {170#true} is VALID [2020-07-17 22:21:26,644 INFO L280 TraceCheckUtils]: 4: Hoare triple {170#true} ~input~0 := 5; {174#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:26,645 INFO L263 TraceCheckUtils]: 5: Hoare triple {174#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {170#true} is VALID [2020-07-17 22:21:26,646 INFO L280 TraceCheckUtils]: 6: Hoare triple {170#true} ~x := #in~x; {185#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:26,647 INFO L280 TraceCheckUtils]: 7: Hoare triple {185#(= |id_#in~x| id_~x)} assume !(0 == ~x); {185#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:26,647 INFO L263 TraceCheckUtils]: 8: Hoare triple {185#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {170#true} is VALID [2020-07-17 22:21:26,648 INFO L280 TraceCheckUtils]: 9: Hoare triple {170#true} ~x := #in~x; {191#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:26,663 INFO L280 TraceCheckUtils]: 10: Hoare triple {191#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:26,664 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#(= 0 |id2_#in~x|)} assume true; {192#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:26,666 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {192#(= 0 |id2_#in~x|)} {185#(= |id_#in~x| id_~x)} #42#return; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,667 INFO L280 TraceCheckUtils]: 13: Hoare triple {190#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,669 INFO L280 TraceCheckUtils]: 14: Hoare triple {190#(<= |id_#in~x| 1)} assume true; {190#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:26,670 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {190#(<= |id_#in~x| 1)} {174#(<= 5 main_~input~0)} #40#return; {171#false} is VALID [2020-07-17 22:21:26,671 INFO L280 TraceCheckUtils]: 16: Hoare triple {171#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {171#false} is VALID [2020-07-17 22:21:26,671 INFO L280 TraceCheckUtils]: 17: Hoare triple {171#false} assume 5 == ~result~0; {171#false} is VALID [2020-07-17 22:21:26,671 INFO L280 TraceCheckUtils]: 18: Hoare triple {171#false} assume !false; {171#false} is VALID [2020-07-17 22:21:26,673 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:21:26,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932346310] [2020-07-17 22:21:26,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:21:26,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:21:26,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269917618] [2020-07-17 22:21:26,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-17 22:21:26,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:26,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:21:26,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:26,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:21:26,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:26,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:21:26,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:21:26,709 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2020-07-17 22:21:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:26,967 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-17 22:21:26,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:21:26,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-17 22:21:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:21:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-17 22:21:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:21:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-17 22:21:26,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2020-07-17 22:21:27,030 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:21:27,033 INFO L225 Difference]: With dead ends: 33 [2020-07-17 22:21:27,033 INFO L226 Difference]: Without dead ends: 29 [2020-07-17 22:21:27,034 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:21:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-17 22:21:27,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-07-17 22:21:27,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:27,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2020-07-17 22:21:27,047 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2020-07-17 22:21:27,047 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2020-07-17 22:21:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:27,051 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:21:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:21:27,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:27,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:27,052 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2020-07-17 22:21:27,052 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2020-07-17 22:21:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:27,056 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:21:27,056 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:21:27,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:27,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:27,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:27,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:21:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-17 22:21:27,060 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2020-07-17 22:21:27,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:27,060 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-17 22:21:27,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:21:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-17 22:21:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:21:27,062 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:27,062 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:27,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:21:27,063 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:27,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:27,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1029702107, now seen corresponding path program 1 times [2020-07-17 22:21:27,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:27,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372245438] [2020-07-17 22:21:27,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,118 INFO L280 TraceCheckUtils]: 0: Hoare triple {335#true} assume true; {335#true} is VALID [2020-07-17 22:21:27,118 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {335#true} {335#true} #36#return; {335#true} is VALID [2020-07-17 22:21:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {356#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {374#(= 0 |id_#in~x|)} assume true; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,236 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {374#(= 0 |id_#in~x|)} {368#(= id2_~x |id2_#in~x|)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,237 INFO L280 TraceCheckUtils]: 0: Hoare triple {335#true} ~x := #in~x; {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:27,238 INFO L280 TraceCheckUtils]: 1: Hoare triple {368#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:27,238 INFO L263 TraceCheckUtils]: 2: Hoare triple {368#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,239 INFO L280 TraceCheckUtils]: 3: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,240 INFO L280 TraceCheckUtils]: 4: Hoare triple {356#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,241 INFO L280 TraceCheckUtils]: 5: Hoare triple {374#(= 0 |id_#in~x|)} assume true; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,243 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {374#(= 0 |id_#in~x|)} {368#(= id2_~x |id2_#in~x|)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,244 INFO L280 TraceCheckUtils]: 7: Hoare triple {373#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,245 INFO L280 TraceCheckUtils]: 8: Hoare triple {373#(<= |id2_#in~x| 1)} assume true; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,247 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {373#(<= |id2_#in~x| 1)} {356#(= |id_#in~x| id_~x)} #42#return; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,248 INFO L280 TraceCheckUtils]: 0: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,249 INFO L280 TraceCheckUtils]: 1: Hoare triple {356#(= |id_#in~x| id_~x)} assume !(0 == ~x); {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,250 INFO L263 TraceCheckUtils]: 2: Hoare triple {356#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,250 INFO L280 TraceCheckUtils]: 3: Hoare triple {335#true} ~x := #in~x; {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:27,251 INFO L280 TraceCheckUtils]: 4: Hoare triple {368#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:27,252 INFO L263 TraceCheckUtils]: 5: Hoare triple {368#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,252 INFO L280 TraceCheckUtils]: 6: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,253 INFO L280 TraceCheckUtils]: 7: Hoare triple {356#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,254 INFO L280 TraceCheckUtils]: 8: Hoare triple {374#(= 0 |id_#in~x|)} assume true; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,256 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {374#(= 0 |id_#in~x|)} {368#(= id2_~x |id2_#in~x|)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,257 INFO L280 TraceCheckUtils]: 10: Hoare triple {373#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,258 INFO L280 TraceCheckUtils]: 11: Hoare triple {373#(<= |id2_#in~x| 1)} assume true; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,260 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {373#(<= |id2_#in~x| 1)} {356#(= |id_#in~x| id_~x)} #42#return; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,261 INFO L280 TraceCheckUtils]: 13: Hoare triple {367#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,261 INFO L280 TraceCheckUtils]: 14: Hoare triple {367#(<= |id_#in~x| 2)} assume true; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,263 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {367#(<= |id_#in~x| 2)} {339#(<= 5 main_~input~0)} #40#return; {336#false} is VALID [2020-07-17 22:21:27,264 INFO L263 TraceCheckUtils]: 0: Hoare triple {335#true} call ULTIMATE.init(); {335#true} is VALID [2020-07-17 22:21:27,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {335#true} assume true; {335#true} is VALID [2020-07-17 22:21:27,265 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {335#true} {335#true} #36#return; {335#true} is VALID [2020-07-17 22:21:27,265 INFO L263 TraceCheckUtils]: 3: Hoare triple {335#true} call #t~ret3 := main(); {335#true} is VALID [2020-07-17 22:21:27,266 INFO L280 TraceCheckUtils]: 4: Hoare triple {335#true} ~input~0 := 5; {339#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:27,266 INFO L263 TraceCheckUtils]: 5: Hoare triple {339#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {335#true} is VALID [2020-07-17 22:21:27,267 INFO L280 TraceCheckUtils]: 6: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,268 INFO L280 TraceCheckUtils]: 7: Hoare triple {356#(= |id_#in~x| id_~x)} assume !(0 == ~x); {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,268 INFO L263 TraceCheckUtils]: 8: Hoare triple {356#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,269 INFO L280 TraceCheckUtils]: 9: Hoare triple {335#true} ~x := #in~x; {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:27,270 INFO L280 TraceCheckUtils]: 10: Hoare triple {368#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {368#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:27,270 INFO L263 TraceCheckUtils]: 11: Hoare triple {368#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,271 INFO L280 TraceCheckUtils]: 12: Hoare triple {335#true} ~x := #in~x; {356#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,272 INFO L280 TraceCheckUtils]: 13: Hoare triple {356#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,273 INFO L280 TraceCheckUtils]: 14: Hoare triple {374#(= 0 |id_#in~x|)} assume true; {374#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:27,275 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {374#(= 0 |id_#in~x|)} {368#(= id2_~x |id2_#in~x|)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,276 INFO L280 TraceCheckUtils]: 16: Hoare triple {373#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,276 INFO L280 TraceCheckUtils]: 17: Hoare triple {373#(<= |id2_#in~x| 1)} assume true; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,278 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {373#(<= |id2_#in~x| 1)} {356#(= |id_#in~x| id_~x)} #42#return; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,279 INFO L280 TraceCheckUtils]: 19: Hoare triple {367#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,280 INFO L280 TraceCheckUtils]: 20: Hoare triple {367#(<= |id_#in~x| 2)} assume true; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,281 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {367#(<= |id_#in~x| 2)} {339#(<= 5 main_~input~0)} #40#return; {336#false} is VALID [2020-07-17 22:21:27,282 INFO L280 TraceCheckUtils]: 22: Hoare triple {336#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {336#false} is VALID [2020-07-17 22:21:27,282 INFO L280 TraceCheckUtils]: 23: Hoare triple {336#false} assume 5 == ~result~0; {336#false} is VALID [2020-07-17 22:21:27,283 INFO L280 TraceCheckUtils]: 24: Hoare triple {336#false} assume !false; {336#false} is VALID [2020-07-17 22:21:27,284 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:21:27,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372245438] [2020-07-17 22:21:27,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003795022] [2020-07-17 22:21:27,285 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:21:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:21:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:27,336 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:27,498 INFO L263 TraceCheckUtils]: 0: Hoare triple {335#true} call ULTIMATE.init(); {335#true} is VALID [2020-07-17 22:21:27,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {335#true} assume true; {335#true} is VALID [2020-07-17 22:21:27,498 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {335#true} {335#true} #36#return; {335#true} is VALID [2020-07-17 22:21:27,499 INFO L263 TraceCheckUtils]: 3: Hoare triple {335#true} call #t~ret3 := main(); {335#true} is VALID [2020-07-17 22:21:27,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {335#true} ~input~0 := 5; {339#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:27,500 INFO L263 TraceCheckUtils]: 5: Hoare triple {339#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {335#true} is VALID [2020-07-17 22:21:27,501 INFO L280 TraceCheckUtils]: 6: Hoare triple {335#true} ~x := #in~x; {396#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,502 INFO L280 TraceCheckUtils]: 7: Hoare triple {396#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {396#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,502 INFO L263 TraceCheckUtils]: 8: Hoare triple {396#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,503 INFO L280 TraceCheckUtils]: 9: Hoare triple {335#true} ~x := #in~x; {406#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:27,504 INFO L280 TraceCheckUtils]: 10: Hoare triple {406#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {406#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:27,504 INFO L263 TraceCheckUtils]: 11: Hoare triple {406#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {335#true} is VALID [2020-07-17 22:21:27,505 INFO L280 TraceCheckUtils]: 12: Hoare triple {335#true} ~x := #in~x; {396#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:27,506 INFO L280 TraceCheckUtils]: 13: Hoare triple {396#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {419#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:21:27,507 INFO L280 TraceCheckUtils]: 14: Hoare triple {419#(<= |id_#in~x| 0)} assume true; {419#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:21:27,509 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {419#(<= |id_#in~x| 0)} {406#(<= |id2_#in~x| id2_~x)} #34#return; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,510 INFO L280 TraceCheckUtils]: 16: Hoare triple {373#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,511 INFO L280 TraceCheckUtils]: 17: Hoare triple {373#(<= |id2_#in~x| 1)} assume true; {373#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:27,513 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {373#(<= |id2_#in~x| 1)} {396#(<= |id_#in~x| id_~x)} #42#return; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,514 INFO L280 TraceCheckUtils]: 19: Hoare triple {367#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,515 INFO L280 TraceCheckUtils]: 20: Hoare triple {367#(<= |id_#in~x| 2)} assume true; {367#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:27,516 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {367#(<= |id_#in~x| 2)} {339#(<= 5 main_~input~0)} #40#return; {336#false} is VALID [2020-07-17 22:21:27,517 INFO L280 TraceCheckUtils]: 22: Hoare triple {336#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {336#false} is VALID [2020-07-17 22:21:27,517 INFO L280 TraceCheckUtils]: 23: Hoare triple {336#false} assume 5 == ~result~0; {336#false} is VALID [2020-07-17 22:21:27,518 INFO L280 TraceCheckUtils]: 24: Hoare triple {336#false} assume !false; {336#false} is VALID [2020-07-17 22:21:27,519 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:21:27,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:27,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-07-17 22:21:27,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542581564] [2020-07-17 22:21:27,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-07-17 22:21:27,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:27,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:21:27,569 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:21:27,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:21:27,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:27,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:21:27,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:21:27,571 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 11 states. [2020-07-17 22:21:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:27,880 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-17 22:21:27,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:21:27,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-07-17 22:21:27,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:21:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2020-07-17 22:21:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:21:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2020-07-17 22:21:27,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2020-07-17 22:21:27,932 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:21:27,934 INFO L225 Difference]: With dead ends: 39 [2020-07-17 22:21:27,934 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:21:27,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:21:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:21:27,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2020-07-17 22:21:27,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:27,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 30 states. [2020-07-17 22:21:27,948 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 30 states. [2020-07-17 22:21:27,948 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 30 states. [2020-07-17 22:21:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:27,952 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-17 22:21:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-17 22:21:27,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:27,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:27,953 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 35 states. [2020-07-17 22:21:27,954 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 35 states. [2020-07-17 22:21:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:27,957 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-17 22:21:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-17 22:21:27,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:27,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:27,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:27,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:21:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-17 22:21:27,961 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2020-07-17 22:21:27,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:27,962 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-17 22:21:27,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:21:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-17 22:21:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:21:27,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:27,963 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:28,178 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:21:28,179 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:28,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:28,180 INFO L82 PathProgramCache]: Analyzing trace with hash -559715991, now seen corresponding path program 1 times [2020-07-17 22:21:28,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:28,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676023694] [2020-07-17 22:21:28,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-17 22:21:28,247 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {615#true} {615#true} #36#return; {615#true} is VALID [2020-07-17 22:21:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,371 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,372 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,374 INFO L263 TraceCheckUtils]: 2: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,375 INFO L280 TraceCheckUtils]: 3: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,375 INFO L280 TraceCheckUtils]: 4: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,376 INFO L280 TraceCheckUtils]: 5: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,377 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,378 INFO L280 TraceCheckUtils]: 7: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,378 INFO L280 TraceCheckUtils]: 8: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,379 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {676#(<= |id_#in~x| 1)} {660#(= id2_~x |id2_#in~x|)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,380 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,381 INFO L280 TraceCheckUtils]: 1: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,381 INFO L263 TraceCheckUtils]: 2: Hoare triple {660#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,382 INFO L280 TraceCheckUtils]: 3: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,383 INFO L280 TraceCheckUtils]: 4: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,383 INFO L263 TraceCheckUtils]: 5: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,383 INFO L280 TraceCheckUtils]: 6: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,384 INFO L280 TraceCheckUtils]: 7: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,385 INFO L280 TraceCheckUtils]: 8: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,386 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,386 INFO L280 TraceCheckUtils]: 10: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,387 INFO L280 TraceCheckUtils]: 11: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,389 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {676#(<= |id_#in~x| 1)} {660#(= id2_~x |id2_#in~x|)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,389 INFO L280 TraceCheckUtils]: 13: Hoare triple {671#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,390 INFO L280 TraceCheckUtils]: 14: Hoare triple {671#(<= |id2_#in~x| 2)} assume true; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,391 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {671#(<= |id2_#in~x| 2)} {642#(= |id_#in~x| id_~x)} #42#return; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,392 INFO L280 TraceCheckUtils]: 0: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,393 INFO L263 TraceCheckUtils]: 2: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,394 INFO L280 TraceCheckUtils]: 3: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,395 INFO L263 TraceCheckUtils]: 5: Hoare triple {660#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,395 INFO L280 TraceCheckUtils]: 6: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,396 INFO L280 TraceCheckUtils]: 7: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,396 INFO L263 TraceCheckUtils]: 8: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,396 INFO L280 TraceCheckUtils]: 9: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,397 INFO L280 TraceCheckUtils]: 10: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,398 INFO L280 TraceCheckUtils]: 11: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,399 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,399 INFO L280 TraceCheckUtils]: 13: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,400 INFO L280 TraceCheckUtils]: 14: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,401 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {676#(<= |id_#in~x| 1)} {660#(= id2_~x |id2_#in~x|)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,402 INFO L280 TraceCheckUtils]: 16: Hoare triple {671#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,402 INFO L280 TraceCheckUtils]: 17: Hoare triple {671#(<= |id2_#in~x| 2)} assume true; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,404 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {671#(<= |id2_#in~x| 2)} {642#(= |id_#in~x| id_~x)} #42#return; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,404 INFO L280 TraceCheckUtils]: 19: Hoare triple {659#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,405 INFO L280 TraceCheckUtils]: 20: Hoare triple {659#(<= |id_#in~x| 3)} assume true; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,406 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {659#(<= |id_#in~x| 3)} {619#(<= 5 main_~input~0)} #40#return; {616#false} is VALID [2020-07-17 22:21:28,407 INFO L263 TraceCheckUtils]: 0: Hoare triple {615#true} call ULTIMATE.init(); {615#true} is VALID [2020-07-17 22:21:28,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-17 22:21:28,408 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {615#true} {615#true} #36#return; {615#true} is VALID [2020-07-17 22:21:28,408 INFO L263 TraceCheckUtils]: 3: Hoare triple {615#true} call #t~ret3 := main(); {615#true} is VALID [2020-07-17 22:21:28,408 INFO L280 TraceCheckUtils]: 4: Hoare triple {615#true} ~input~0 := 5; {619#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:28,409 INFO L263 TraceCheckUtils]: 5: Hoare triple {619#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {615#true} is VALID [2020-07-17 22:21:28,409 INFO L280 TraceCheckUtils]: 6: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,410 INFO L280 TraceCheckUtils]: 7: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,410 INFO L263 TraceCheckUtils]: 8: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,411 INFO L280 TraceCheckUtils]: 9: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,411 INFO L280 TraceCheckUtils]: 10: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,412 INFO L263 TraceCheckUtils]: 11: Hoare triple {660#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,412 INFO L280 TraceCheckUtils]: 12: Hoare triple {615#true} ~x := #in~x; {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,413 INFO L280 TraceCheckUtils]: 13: Hoare triple {642#(= |id_#in~x| id_~x)} assume !(0 == ~x); {642#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,413 INFO L263 TraceCheckUtils]: 14: Hoare triple {642#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,414 INFO L280 TraceCheckUtils]: 15: Hoare triple {615#true} ~x := #in~x; {660#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:28,414 INFO L280 TraceCheckUtils]: 16: Hoare triple {660#(= id2_~x |id2_#in~x|)} assume 0 == ~x;#res := 0; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,415 INFO L280 TraceCheckUtils]: 17: Hoare triple {677#(= 0 |id2_#in~x|)} assume true; {677#(= 0 |id2_#in~x|)} is VALID [2020-07-17 22:21:28,416 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {677#(= 0 |id2_#in~x|)} {642#(= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,417 INFO L280 TraceCheckUtils]: 19: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,417 INFO L280 TraceCheckUtils]: 20: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,419 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {676#(<= |id_#in~x| 1)} {660#(= id2_~x |id2_#in~x|)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,419 INFO L280 TraceCheckUtils]: 22: Hoare triple {671#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,420 INFO L280 TraceCheckUtils]: 23: Hoare triple {671#(<= |id2_#in~x| 2)} assume true; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,421 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {671#(<= |id2_#in~x| 2)} {642#(= |id_#in~x| id_~x)} #42#return; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,422 INFO L280 TraceCheckUtils]: 25: Hoare triple {659#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,422 INFO L280 TraceCheckUtils]: 26: Hoare triple {659#(<= |id_#in~x| 3)} assume true; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,423 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {659#(<= |id_#in~x| 3)} {619#(<= 5 main_~input~0)} #40#return; {616#false} is VALID [2020-07-17 22:21:28,423 INFO L280 TraceCheckUtils]: 28: Hoare triple {616#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {616#false} is VALID [2020-07-17 22:21:28,424 INFO L280 TraceCheckUtils]: 29: Hoare triple {616#false} assume 5 == ~result~0; {616#false} is VALID [2020-07-17 22:21:28,424 INFO L280 TraceCheckUtils]: 30: Hoare triple {616#false} assume !false; {616#false} is VALID [2020-07-17 22:21:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 22:21:28,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676023694] [2020-07-17 22:21:28,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421614281] [2020-07-17 22:21:28,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,455 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-17 22:21:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,468 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:28,625 INFO L263 TraceCheckUtils]: 0: Hoare triple {615#true} call ULTIMATE.init(); {615#true} is VALID [2020-07-17 22:21:28,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {615#true} assume true; {615#true} is VALID [2020-07-17 22:21:28,626 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {615#true} {615#true} #36#return; {615#true} is VALID [2020-07-17 22:21:28,626 INFO L263 TraceCheckUtils]: 3: Hoare triple {615#true} call #t~ret3 := main(); {615#true} is VALID [2020-07-17 22:21:28,627 INFO L280 TraceCheckUtils]: 4: Hoare triple {615#true} ~input~0 := 5; {619#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:28,627 INFO L263 TraceCheckUtils]: 5: Hoare triple {619#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {615#true} is VALID [2020-07-17 22:21:28,627 INFO L280 TraceCheckUtils]: 6: Hoare triple {615#true} ~x := #in~x; {699#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,628 INFO L280 TraceCheckUtils]: 7: Hoare triple {699#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {699#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,628 INFO L263 TraceCheckUtils]: 8: Hoare triple {699#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,628 INFO L280 TraceCheckUtils]: 9: Hoare triple {615#true} ~x := #in~x; {709#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:28,629 INFO L280 TraceCheckUtils]: 10: Hoare triple {709#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {709#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:28,629 INFO L263 TraceCheckUtils]: 11: Hoare triple {709#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,630 INFO L280 TraceCheckUtils]: 12: Hoare triple {615#true} ~x := #in~x; {699#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,639 INFO L280 TraceCheckUtils]: 13: Hoare triple {699#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {699#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:28,640 INFO L263 TraceCheckUtils]: 14: Hoare triple {699#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {615#true} is VALID [2020-07-17 22:21:28,640 INFO L280 TraceCheckUtils]: 15: Hoare triple {615#true} ~x := #in~x; {709#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:28,641 INFO L280 TraceCheckUtils]: 16: Hoare triple {709#(<= |id2_#in~x| id2_~x)} assume 0 == ~x;#res := 0; {731#(<= |id2_#in~x| 0)} is VALID [2020-07-17 22:21:28,642 INFO L280 TraceCheckUtils]: 17: Hoare triple {731#(<= |id2_#in~x| 0)} assume true; {731#(<= |id2_#in~x| 0)} is VALID [2020-07-17 22:21:28,643 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {731#(<= |id2_#in~x| 0)} {699#(<= |id_#in~x| id_~x)} #42#return; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,644 INFO L280 TraceCheckUtils]: 19: Hoare triple {676#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,644 INFO L280 TraceCheckUtils]: 20: Hoare triple {676#(<= |id_#in~x| 1)} assume true; {676#(<= |id_#in~x| 1)} is VALID [2020-07-17 22:21:28,646 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {676#(<= |id_#in~x| 1)} {709#(<= |id2_#in~x| id2_~x)} #34#return; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,646 INFO L280 TraceCheckUtils]: 22: Hoare triple {671#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,647 INFO L280 TraceCheckUtils]: 23: Hoare triple {671#(<= |id2_#in~x| 2)} assume true; {671#(<= |id2_#in~x| 2)} is VALID [2020-07-17 22:21:28,648 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {671#(<= |id2_#in~x| 2)} {699#(<= |id_#in~x| id_~x)} #42#return; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,649 INFO L280 TraceCheckUtils]: 25: Hoare triple {659#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,649 INFO L280 TraceCheckUtils]: 26: Hoare triple {659#(<= |id_#in~x| 3)} assume true; {659#(<= |id_#in~x| 3)} is VALID [2020-07-17 22:21:28,650 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {659#(<= |id_#in~x| 3)} {619#(<= 5 main_~input~0)} #40#return; {616#false} is VALID [2020-07-17 22:21:28,651 INFO L280 TraceCheckUtils]: 28: Hoare triple {616#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {616#false} is VALID [2020-07-17 22:21:28,651 INFO L280 TraceCheckUtils]: 29: Hoare triple {616#false} assume 5 == ~result~0; {616#false} is VALID [2020-07-17 22:21:28,651 INFO L280 TraceCheckUtils]: 30: Hoare triple {616#false} assume !false; {616#false} is VALID [2020-07-17 22:21:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 22:21:28,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:28,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-07-17 22:21:28,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001836301] [2020-07-17 22:21:28,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-17 22:21:28,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:28,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-17 22:21:28,709 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:21:28,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 22:21:28,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:28,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 22:21:28,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:21:28,710 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 12 states. [2020-07-17 22:21:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:29,052 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-17 22:21:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:21:29,052 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-17 22:21:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:21:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-17 22:21:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:21:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-17 22:21:29,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 39 transitions. [2020-07-17 22:21:29,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:29,107 INFO L225 Difference]: With dead ends: 45 [2020-07-17 22:21:29,108 INFO L226 Difference]: Without dead ends: 41 [2020-07-17 22:21:29,108 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:21:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-17 22:21:29,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2020-07-17 22:21:29,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:29,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 33 states. [2020-07-17 22:21:29,126 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 33 states. [2020-07-17 22:21:29,126 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 33 states. [2020-07-17 22:21:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:29,129 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-17 22:21:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-17 22:21:29,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:29,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:29,130 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 41 states. [2020-07-17 22:21:29,130 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 41 states. [2020-07-17 22:21:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:29,133 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-17 22:21:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-17 22:21:29,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:29,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:29,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:29,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:21:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-07-17 22:21:29,137 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2020-07-17 22:21:29,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:29,137 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-07-17 22:21:29,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 22:21:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-17 22:21:29,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:21:29,138 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:29,139 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:29,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:29,352 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:29,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:29,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2003326827, now seen corresponding path program 2 times [2020-07-17 22:21:29,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:29,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521048490] [2020-07-17 22:21:29,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,404 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-17 22:21:29,405 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {959#true} {959#true} #36#return; {959#true} is VALID [2020-07-17 22:21:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,548 INFO L280 TraceCheckUtils]: 1: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,549 INFO L280 TraceCheckUtils]: 2: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,550 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,551 INFO L280 TraceCheckUtils]: 1: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,552 INFO L263 TraceCheckUtils]: 2: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,552 INFO L280 TraceCheckUtils]: 3: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,553 INFO L280 TraceCheckUtils]: 4: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,554 INFO L280 TraceCheckUtils]: 5: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,555 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,556 INFO L280 TraceCheckUtils]: 7: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,557 INFO L280 TraceCheckUtils]: 8: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,559 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,561 INFO L263 TraceCheckUtils]: 2: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,561 INFO L280 TraceCheckUtils]: 3: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,562 INFO L263 TraceCheckUtils]: 5: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,563 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,565 INFO L280 TraceCheckUtils]: 7: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,566 INFO L280 TraceCheckUtils]: 8: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,567 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,568 INFO L280 TraceCheckUtils]: 10: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,569 INFO L280 TraceCheckUtils]: 11: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,570 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,571 INFO L280 TraceCheckUtils]: 13: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,572 INFO L280 TraceCheckUtils]: 14: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,573 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,575 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,576 INFO L263 TraceCheckUtils]: 2: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,576 INFO L280 TraceCheckUtils]: 3: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,577 INFO L280 TraceCheckUtils]: 4: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,577 INFO L263 TraceCheckUtils]: 5: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,578 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,578 INFO L280 TraceCheckUtils]: 7: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,579 INFO L263 TraceCheckUtils]: 8: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,579 INFO L280 TraceCheckUtils]: 9: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,580 INFO L280 TraceCheckUtils]: 10: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,582 INFO L280 TraceCheckUtils]: 11: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,583 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,584 INFO L280 TraceCheckUtils]: 13: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,584 INFO L280 TraceCheckUtils]: 14: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,586 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,587 INFO L280 TraceCheckUtils]: 16: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,588 INFO L280 TraceCheckUtils]: 17: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,589 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,590 INFO L280 TraceCheckUtils]: 19: Hoare triple {1033#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,591 INFO L280 TraceCheckUtils]: 20: Hoare triple {1033#(<= |id2_#in~x| 3)} assume true; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,592 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1033#(<= |id2_#in~x| 3)} {992#(= |id_#in~x| id_~x)} #42#return; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,594 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,595 INFO L263 TraceCheckUtils]: 2: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,596 INFO L280 TraceCheckUtils]: 3: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,596 INFO L280 TraceCheckUtils]: 4: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,597 INFO L263 TraceCheckUtils]: 5: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,597 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,598 INFO L280 TraceCheckUtils]: 7: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,598 INFO L263 TraceCheckUtils]: 8: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,599 INFO L280 TraceCheckUtils]: 9: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,599 INFO L280 TraceCheckUtils]: 10: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,600 INFO L263 TraceCheckUtils]: 11: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,600 INFO L280 TraceCheckUtils]: 12: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,602 INFO L280 TraceCheckUtils]: 13: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,604 INFO L280 TraceCheckUtils]: 14: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,609 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,609 INFO L280 TraceCheckUtils]: 16: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,610 INFO L280 TraceCheckUtils]: 17: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,612 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,612 INFO L280 TraceCheckUtils]: 19: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,613 INFO L280 TraceCheckUtils]: 20: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,614 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,615 INFO L280 TraceCheckUtils]: 22: Hoare triple {1033#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,616 INFO L280 TraceCheckUtils]: 23: Hoare triple {1033#(<= |id2_#in~x| 3)} assume true; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,617 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1033#(<= |id2_#in~x| 3)} {992#(= |id_#in~x| id_~x)} #42#return; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,618 INFO L280 TraceCheckUtils]: 25: Hoare triple {1015#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,619 INFO L280 TraceCheckUtils]: 26: Hoare triple {1015#(<= |id_#in~x| 4)} assume true; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,620 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1015#(<= |id_#in~x| 4)} {963#(<= 5 main_~input~0)} #40#return; {960#false} is VALID [2020-07-17 22:21:29,621 INFO L263 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2020-07-17 22:21:29,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-17 22:21:29,622 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #36#return; {959#true} is VALID [2020-07-17 22:21:29,622 INFO L263 TraceCheckUtils]: 3: Hoare triple {959#true} call #t~ret3 := main(); {959#true} is VALID [2020-07-17 22:21:29,623 INFO L280 TraceCheckUtils]: 4: Hoare triple {959#true} ~input~0 := 5; {963#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:29,623 INFO L263 TraceCheckUtils]: 5: Hoare triple {963#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {959#true} is VALID [2020-07-17 22:21:29,624 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,624 INFO L280 TraceCheckUtils]: 7: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,625 INFO L263 TraceCheckUtils]: 8: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,626 INFO L280 TraceCheckUtils]: 10: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,626 INFO L263 TraceCheckUtils]: 11: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,627 INFO L280 TraceCheckUtils]: 12: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,627 INFO L280 TraceCheckUtils]: 13: Hoare triple {992#(= |id_#in~x| id_~x)} assume !(0 == ~x); {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,627 INFO L263 TraceCheckUtils]: 14: Hoare triple {992#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,628 INFO L280 TraceCheckUtils]: 15: Hoare triple {959#true} ~x := #in~x; {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,629 INFO L280 TraceCheckUtils]: 16: Hoare triple {1016#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1016#(= id2_~x |id2_#in~x|)} is VALID [2020-07-17 22:21:29,629 INFO L263 TraceCheckUtils]: 17: Hoare triple {1016#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,629 INFO L280 TraceCheckUtils]: 18: Hoare triple {959#true} ~x := #in~x; {992#(= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,630 INFO L280 TraceCheckUtils]: 19: Hoare triple {992#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,631 INFO L280 TraceCheckUtils]: 20: Hoare triple {1050#(= 0 |id_#in~x|)} assume true; {1050#(= 0 |id_#in~x|)} is VALID [2020-07-17 22:21:29,632 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1050#(= 0 |id_#in~x|)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,633 INFO L280 TraceCheckUtils]: 22: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,633 INFO L280 TraceCheckUtils]: 23: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,635 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {992#(= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,636 INFO L280 TraceCheckUtils]: 25: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,636 INFO L280 TraceCheckUtils]: 26: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,638 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1016#(= id2_~x |id2_#in~x|)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,639 INFO L280 TraceCheckUtils]: 28: Hoare triple {1033#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,640 INFO L280 TraceCheckUtils]: 29: Hoare triple {1033#(<= |id2_#in~x| 3)} assume true; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,641 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1033#(<= |id2_#in~x| 3)} {992#(= |id_#in~x| id_~x)} #42#return; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,642 INFO L280 TraceCheckUtils]: 31: Hoare triple {1015#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,642 INFO L280 TraceCheckUtils]: 32: Hoare triple {1015#(<= |id_#in~x| 4)} assume true; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,643 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1015#(<= |id_#in~x| 4)} {963#(<= 5 main_~input~0)} #40#return; {960#false} is VALID [2020-07-17 22:21:29,644 INFO L280 TraceCheckUtils]: 34: Hoare triple {960#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {960#false} is VALID [2020-07-17 22:21:29,644 INFO L280 TraceCheckUtils]: 35: Hoare triple {960#false} assume 5 == ~result~0; {960#false} is VALID [2020-07-17 22:21:29,644 INFO L280 TraceCheckUtils]: 36: Hoare triple {960#false} assume !false; {960#false} is VALID [2020-07-17 22:21:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-17 22:21:29,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521048490] [2020-07-17 22:21:29,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673611899] [2020-07-17 22:21:29,647 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-17 22:21:29,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:21:29,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:29,687 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-17 22:21:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,699 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:29,845 INFO L263 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2020-07-17 22:21:29,846 INFO L280 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-17 22:21:29,846 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #36#return; {959#true} is VALID [2020-07-17 22:21:29,846 INFO L263 TraceCheckUtils]: 3: Hoare triple {959#true} call #t~ret3 := main(); {959#true} is VALID [2020-07-17 22:21:29,847 INFO L280 TraceCheckUtils]: 4: Hoare triple {959#true} ~input~0 := 5; {963#(<= 5 main_~input~0)} is VALID [2020-07-17 22:21:29,847 INFO L263 TraceCheckUtils]: 5: Hoare triple {963#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {959#true} is VALID [2020-07-17 22:21:29,848 INFO L280 TraceCheckUtils]: 6: Hoare triple {959#true} ~x := #in~x; {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,849 INFO L280 TraceCheckUtils]: 7: Hoare triple {1072#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,849 INFO L263 TraceCheckUtils]: 8: Hoare triple {1072#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,849 INFO L280 TraceCheckUtils]: 9: Hoare triple {959#true} ~x := #in~x; {1082#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:29,850 INFO L280 TraceCheckUtils]: 10: Hoare triple {1082#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {1082#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:29,850 INFO L263 TraceCheckUtils]: 11: Hoare triple {1082#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,851 INFO L280 TraceCheckUtils]: 12: Hoare triple {959#true} ~x := #in~x; {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,852 INFO L280 TraceCheckUtils]: 13: Hoare triple {1072#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,852 INFO L263 TraceCheckUtils]: 14: Hoare triple {1072#(<= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,853 INFO L280 TraceCheckUtils]: 15: Hoare triple {959#true} ~x := #in~x; {1082#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:29,853 INFO L280 TraceCheckUtils]: 16: Hoare triple {1082#(<= |id2_#in~x| id2_~x)} assume !(0 == ~x); {1082#(<= |id2_#in~x| id2_~x)} is VALID [2020-07-17 22:21:29,854 INFO L263 TraceCheckUtils]: 17: Hoare triple {1082#(<= |id2_#in~x| id2_~x)} call #t~ret1 := id(~x - 1); {959#true} is VALID [2020-07-17 22:21:29,854 INFO L280 TraceCheckUtils]: 18: Hoare triple {959#true} ~x := #in~x; {1072#(<= |id_#in~x| id_~x)} is VALID [2020-07-17 22:21:29,855 INFO L280 TraceCheckUtils]: 19: Hoare triple {1072#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1113#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:21:29,855 INFO L280 TraceCheckUtils]: 20: Hoare triple {1113#(<= |id_#in~x| 0)} assume true; {1113#(<= |id_#in~x| 0)} is VALID [2020-07-17 22:21:29,857 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1113#(<= |id_#in~x| 0)} {1082#(<= |id2_#in~x| id2_~x)} #34#return; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,858 INFO L280 TraceCheckUtils]: 22: Hoare triple {1049#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,858 INFO L280 TraceCheckUtils]: 23: Hoare triple {1049#(<= |id2_#in~x| 1)} assume true; {1049#(<= |id2_#in~x| 1)} is VALID [2020-07-17 22:21:29,860 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1049#(<= |id2_#in~x| 1)} {1072#(<= |id_#in~x| id_~x)} #42#return; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,861 INFO L280 TraceCheckUtils]: 25: Hoare triple {1044#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,861 INFO L280 TraceCheckUtils]: 26: Hoare triple {1044#(<= |id_#in~x| 2)} assume true; {1044#(<= |id_#in~x| 2)} is VALID [2020-07-17 22:21:29,863 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1044#(<= |id_#in~x| 2)} {1082#(<= |id2_#in~x| id2_~x)} #34#return; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,863 INFO L280 TraceCheckUtils]: 28: Hoare triple {1033#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,864 INFO L280 TraceCheckUtils]: 29: Hoare triple {1033#(<= |id2_#in~x| 3)} assume true; {1033#(<= |id2_#in~x| 3)} is VALID [2020-07-17 22:21:29,865 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1033#(<= |id2_#in~x| 3)} {1072#(<= |id_#in~x| id_~x)} #42#return; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,866 INFO L280 TraceCheckUtils]: 31: Hoare triple {1015#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,867 INFO L280 TraceCheckUtils]: 32: Hoare triple {1015#(<= |id_#in~x| 4)} assume true; {1015#(<= |id_#in~x| 4)} is VALID [2020-07-17 22:21:29,868 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1015#(<= |id_#in~x| 4)} {963#(<= 5 main_~input~0)} #40#return; {960#false} is VALID [2020-07-17 22:21:29,868 INFO L280 TraceCheckUtils]: 34: Hoare triple {960#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {960#false} is VALID [2020-07-17 22:21:29,868 INFO L280 TraceCheckUtils]: 35: Hoare triple {960#false} assume 5 == ~result~0; {960#false} is VALID [2020-07-17 22:21:29,868 INFO L280 TraceCheckUtils]: 36: Hoare triple {960#false} assume !false; {960#false} is VALID [2020-07-17 22:21:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-17 22:21:29,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:29,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2020-07-17 22:21:29,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840264089] [2020-07-17 22:21:29,871 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-07-17 22:21:29,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:29,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:21:29,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:29,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:21:29,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:29,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:21:29,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:21:29,923 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 13 states. [2020-07-17 22:21:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:30,262 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2020-07-17 22:21:30,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:21:30,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-07-17 22:21:30,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:21:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-17 22:21:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:21:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-17 22:21:30,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2020-07-17 22:21:30,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:30,323 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:21:30,323 INFO L226 Difference]: Without dead ends: 47 [2020-07-17 22:21:30,324 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2020-07-17 22:21:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-17 22:21:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2020-07-17 22:21:30,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:30,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 36 states. [2020-07-17 22:21:30,339 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 36 states. [2020-07-17 22:21:30,339 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 36 states. [2020-07-17 22:21:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:30,342 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2020-07-17 22:21:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-07-17 22:21:30,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:30,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:30,344 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 47 states. [2020-07-17 22:21:30,344 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 47 states. [2020-07-17 22:21:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:30,347 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2020-07-17 22:21:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-07-17 22:21:30,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:30,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:30,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:30,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:21:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-17 22:21:30,351 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 37 [2020-07-17 22:21:30,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:30,351 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-17 22:21:30,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:21:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-17 22:21:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-17 22:21:30,353 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:30,353 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:30,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:30,567 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:30,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:30,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1197899385, now seen corresponding path program 2 times [2020-07-17 22:21:30,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:30,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21584512] [2020-07-17 22:21:30,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:21:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:21:30,612 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:21:30,612 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:21:30,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:21:30,643 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:21:30,644 WARN L170 areAnnotationChecker]: id2ENTRY has no Hoare annotation [2020-07-17 22:21:30,644 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:21:30,644 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:21:30,644 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:21:30,644 WARN L170 areAnnotationChecker]: idENTRY has no Hoare annotation [2020-07-17 22:21:30,644 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:21:30,644 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:21:30,644 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:21:30,645 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:21:30,645 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:21:30,645 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-17 22:21:30,645 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-17 22:21:30,645 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:21:30,645 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:21:30,645 WARN L170 areAnnotationChecker]: id2FINAL has no Hoare annotation [2020-07-17 22:21:30,645 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:21:30,645 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:21:30,646 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:21:30,646 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-17 22:21:30,646 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-17 22:21:30,646 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-17 22:21:30,646 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-17 22:21:30,646 WARN L170 areAnnotationChecker]: id2EXIT has no Hoare annotation [2020-07-17 22:21:30,646 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-17 22:21:30,646 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:21:30,646 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:21:30,646 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-17 22:21:30,647 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-17 22:21:30,647 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-17 22:21:30,647 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-17 22:21:30,647 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-17 22:21:30,647 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-17 22:21:30,647 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:21:30,647 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:21:30,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:21:30 BoogieIcfgContainer [2020-07-17 22:21:30,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:21:30,653 INFO L168 Benchmark]: Toolchain (without parser) took 6113.02 ms. Allocated memory was 143.7 MB in the beginning and 275.3 MB in the end (delta: 131.6 MB). Free memory was 102.1 MB in the beginning and 120.3 MB in the end (delta: -18.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:30,653 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.6 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:21:30,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.44 ms. Allocated memory is still 143.7 MB. Free memory was 101.6 MB in the beginning and 92.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:30,655 INFO L168 Benchmark]: Boogie Preprocessor took 38.10 ms. Allocated memory is still 143.7 MB. Free memory was 92.1 MB in the beginning and 90.7 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:21:30,656 INFO L168 Benchmark]: RCFGBuilder took 607.70 ms. Allocated memory was 143.7 MB in the beginning and 203.4 MB in the end (delta: 59.8 MB). Free memory was 90.5 MB in the beginning and 166.2 MB in the end (delta: -75.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:30,656 INFO L168 Benchmark]: TraceAbstraction took 5204.20 ms. Allocated memory was 203.4 MB in the beginning and 275.3 MB in the end (delta: 71.8 MB). Free memory was 166.2 MB in the beginning and 120.3 MB in the end (delta: 45.9 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:30,659 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.54 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 256.44 ms. Allocated memory is still 143.7 MB. Free memory was 101.6 MB in the beginning and 92.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.10 ms. Allocated memory is still 143.7 MB. Free memory was 92.1 MB in the beginning and 90.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 607.70 ms. Allocated memory was 143.7 MB in the beginning and 203.4 MB in the end (delta: 59.8 MB). Free memory was 90.5 MB in the beginning and 166.2 MB in the end (delta: -75.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5204.20 ms. Allocated memory was 203.4 MB in the beginning and 275.3 MB in the end (delta: 71.8 MB). Free memory was 166.2 MB in the beginning and 120.3 MB in the end (delta: 45.9 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 21]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L18] int input = 5; VAL [input=5] [L19] CALL, EXPR id(input) VAL [\old(x)=5] [L8] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=4] [L13] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L14] CALL, EXPR id(x-1) VAL [\old(x)=3] [L8] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=2] [L13] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L14] CALL, EXPR id(x-1) VAL [\old(x)=1] [L8] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=0] [L13] COND TRUE x==0 [L13] return 0; VAL [\old(x)=0, \result=0, x=0] [L9] RET, EXPR id2(x-1) VAL [\old(x)=1, id2(x-1)=0, x=1] [L9] return id2(x-1) + 1; [L14] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L14] return id(x-1) + 1; [L9] RET, EXPR id2(x-1) VAL [\old(x)=3, id2(x-1)=2, x=3] [L9] return id2(x-1) + 1; [L14] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L14] return id(x-1) + 1; [L9] RET, EXPR id2(x-1) VAL [\old(x)=5, id2(x-1)=4, x=5] [L9] return id2(x-1) + 1; [L19] RET, EXPR id(input) VAL [id(input)=5, input=5] [L19] int result = id(input); [L20] COND TRUE result == 5 VAL [input=5, result=5] [L21] __VERIFIER_error() VAL [input=5, result=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.0s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 92 SDtfs, 71 SDslu, 463 SDs, 0 SdLazy, 252 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=5, 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, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 13512 SizeOfPredicates, 15 NumberOfNonLiveVariables, 222 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 34/68 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 incorrect! Received shutdown request...