/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i5_o5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 22:07:58,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 22:07:58,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 22:07:58,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 22:07:58,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 22:07:58,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 22:07:58,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 22:07:58,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 22:07:58,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 22:07:58,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 22:07:58,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 22:07:58,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 22:07:58,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 22:07:58,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 22:07:58,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 22:07:58,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 22:07:58,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 22:07:58,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 22:07:58,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 22:07:58,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 22:07:58,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 22:07:58,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 22:07:58,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 22:07:58,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 22:07:58,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 22:07:58,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 22:07:58,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 22:07:58,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 22:07:58,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 22:07:58,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 22:07:58,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 22:07:58,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 22:07:58,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 22:07:58,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 22:07:58,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 22:07:58,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 22:07:58,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 22:07:58,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 22:07:58,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 22:07:58,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 22:07:58,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 22:07:58,940 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 22:07:58,959 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 22:07:58,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 22:07:58,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 22:07:58,963 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 22:07:58,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 22:07:58,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 22:07:58,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 22:07:58,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 22:07:58,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 22:07:58,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 22:07:58,964 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 22:07:58,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 22:07:58,965 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 22:07:58,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 22:07:58,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 22:07:58,965 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 22:07:58,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 22:07:58,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 22:07:58,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:07:58,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 22:07:58,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 22:07:58,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 22:07:58,968 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 22:07:59,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 22:07:59,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 22:07:59,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 22:07:59,259 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 22:07:59,259 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 22:07:59,260 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i5_o5-1.c [2020-07-08 22:07:59,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc4f0734d/185217c350b14d819aedb5b361401c00/FLAG11ea2e3e5 [2020-07-08 22:07:59,814 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 22:07:59,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i5_o5-1.c [2020-07-08 22:07:59,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc4f0734d/185217c350b14d819aedb5b361401c00/FLAG11ea2e3e5 [2020-07-08 22:08:00,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc4f0734d/185217c350b14d819aedb5b361401c00 [2020-07-08 22:08:00,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 22:08:00,224 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 22:08:00,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 22:08:00,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 22:08:00,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 22:08:00,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:08:00" (1/1) ... [2020-07-08 22:08:00,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@215be14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:08:00, skipping insertion in model container [2020-07-08 22:08:00,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:08:00" (1/1) ... [2020-07-08 22:08:00,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 22:08:00,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 22:08:00,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:08:00,491 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 22:08:00,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:08:00,523 INFO L208 MainTranslator]: Completed translation [2020-07-08 22:08:00,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:08:00 WrapperNode [2020-07-08 22:08:00,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 22:08:00,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 22:08:00,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 22:08:00,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 22:08:00,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:08:00" (1/1) ... [2020-07-08 22:08:00,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:08:00" (1/1) ... [2020-07-08 22:08:00,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:08:00" (1/1) ... [2020-07-08 22:08:00,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:08:00" (1/1) ... [2020-07-08 22:08:00,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:08:00" (1/1) ... [2020-07-08 22:08:00,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:08:00" (1/1) ... [2020-07-08 22:08:00,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:08:00" (1/1) ... [2020-07-08 22:08:00,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 22:08:00,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 22:08:00,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 22:08:00,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 22:08:00,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:08:00" (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-08 22:08:00,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 22:08:00,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 22:08:00,709 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-08 22:08:00,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 22:08:00,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 22:08:00,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 22:08:00,710 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-08 22:08:00,710 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 22:08:00,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 22:08:00,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 22:08:00,935 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 22:08:00,935 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 22:08:00,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:08:00 BoogieIcfgContainer [2020-07-08 22:08:00,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 22:08:00,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 22:08:00,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 22:08:00,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 22:08:00,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:08:00" (1/3) ... [2020-07-08 22:08:00,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72582832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:08:00, skipping insertion in model container [2020-07-08 22:08:00,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:08:00" (2/3) ... [2020-07-08 22:08:00,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72582832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:08:00, skipping insertion in model container [2020-07-08 22:08:00,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:08:00" (3/3) ... [2020-07-08 22:08:00,949 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i5_o5-1.c [2020-07-08 22:08:00,961 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 22:08:00,970 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 22:08:00,993 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 22:08:01,049 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 22:08:01,050 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 22:08:01,050 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 22:08:01,050 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 22:08:01,050 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 22:08:01,050 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 22:08:01,051 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 22:08:01,051 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 22:08:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-08 22:08:01,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 22:08:01,104 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:08:01,105 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:08:01,106 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:08:01,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:08:01,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-07-08 22:08:01,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:08:01,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1735969687] [2020-07-08 22:08:01,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:08:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:01,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-08 22:08:01,346 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {28#true} {28#true} #31#return; {28#true} is VALID [2020-07-08 22:08:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:01,412 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:01,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x; {39#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:01,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#(= 0 |id_#in~x|)} #res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:01,416 INFO L280 TraceCheckUtils]: 3: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:01,418 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {39#(= 0 |id_#in~x|)} {32#(<= 5 main_~input~0)} #35#return; {29#false} is VALID [2020-07-08 22:08:01,419 INFO L263 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2020-07-08 22:08:01,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-08 22:08:01,420 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #31#return; {28#true} is VALID [2020-07-08 22:08:01,420 INFO L263 TraceCheckUtils]: 3: Hoare triple {28#true} call #t~ret2 := main(); {28#true} is VALID [2020-07-08 22:08:01,421 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#true} ~input~0 := 5; {32#(<= 5 main_~input~0)} is VALID [2020-07-08 22:08:01,422 INFO L263 TraceCheckUtils]: 5: Hoare triple {32#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {28#true} is VALID [2020-07-08 22:08:01,422 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:01,423 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x; {39#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:01,424 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#(= 0 |id_#in~x|)} #res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:01,426 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:01,436 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {39#(= 0 |id_#in~x|)} {32#(<= 5 main_~input~0)} #35#return; {29#false} is VALID [2020-07-08 22:08:01,437 INFO L280 TraceCheckUtils]: 11: Hoare triple {29#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {29#false} is VALID [2020-07-08 22:08:01,437 INFO L280 TraceCheckUtils]: 12: Hoare triple {29#false} ~result~0 := #t~ret1; {29#false} is VALID [2020-07-08 22:08:01,438 INFO L280 TraceCheckUtils]: 13: Hoare triple {29#false} havoc #t~ret1; {29#false} is VALID [2020-07-08 22:08:01,438 INFO L280 TraceCheckUtils]: 14: Hoare triple {29#false} assume 5 == ~result~0; {29#false} is VALID [2020-07-08 22:08:01,438 INFO L280 TraceCheckUtils]: 15: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-08 22:08:01,444 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-08 22:08:01,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1735969687] [2020-07-08 22:08:01,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:08:01,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 22:08:01,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11259270] [2020-07-08 22:08:01,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 22:08:01,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:08:01,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 22:08:01,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:08:01,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 22:08:01,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:08:01,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 22:08:01,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 22:08:01,523 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-07-08 22:08:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:01,814 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-08 22:08:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 22:08:01,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 22:08:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:08:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:08:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-08 22:08:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:08:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-08 22:08:01,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-08 22:08:01,909 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-08 22:08:01,922 INFO L225 Difference]: With dead ends: 37 [2020-07-08 22:08:01,923 INFO L226 Difference]: Without dead ends: 23 [2020-07-08 22:08:01,927 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-08 22:08:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-08 22:08:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-08 22:08:02,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:08:02,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-08 22:08:02,005 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-08 22:08:02,005 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-08 22:08:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:02,011 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-08 22:08:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-08 22:08:02,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:08:02,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:08:02,013 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-08 22:08:02,014 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-08 22:08:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:02,018 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-08 22:08:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-08 22:08:02,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:08:02,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:08:02,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:08:02,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:08:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-08 22:08:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-08 22:08:02,026 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-07-08 22:08:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:08:02,027 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-08 22:08:02,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 22:08:02,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2020-07-08 22:08:02,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:08:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-08 22:08:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 22:08:02,071 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:08:02,071 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:08:02,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 22:08:02,072 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:08:02,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:08:02,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-07-08 22:08:02,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:08:02,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [160526883] [2020-07-08 22:08:02,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:08:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:02,151 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-08 22:08:02,151 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {210#true} {210#true} #31#return; {210#true} is VALID [2020-07-08 22:08:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:02,257 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,259 INFO L280 TraceCheckUtils]: 2: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,260 INFO L280 TraceCheckUtils]: 3: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,262 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {235#(= 0 |id_#in~x|)} {228#(= |id_#in~x| id_~x)} #37#return; {234#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,263 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#(= |id_#in~x| id_~x)} assume !(0 == ~x); {228#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,264 INFO L263 TraceCheckUtils]: 2: Hoare triple {228#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {210#true} is VALID [2020-07-08 22:08:02,265 INFO L280 TraceCheckUtils]: 3: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,266 INFO L280 TraceCheckUtils]: 4: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,267 INFO L280 TraceCheckUtils]: 5: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,268 INFO L280 TraceCheckUtils]: 6: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,269 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {235#(= 0 |id_#in~x|)} {228#(= |id_#in~x| id_~x)} #37#return; {234#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,270 INFO L280 TraceCheckUtils]: 8: Hoare triple {234#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {234#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,271 INFO L280 TraceCheckUtils]: 9: Hoare triple {234#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,272 INFO L280 TraceCheckUtils]: 10: Hoare triple {234#(<= |id_#in~x| 1)} havoc #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,273 INFO L280 TraceCheckUtils]: 11: Hoare triple {234#(<= |id_#in~x| 1)} assume true; {234#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,274 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {234#(<= |id_#in~x| 1)} {214#(<= 5 main_~input~0)} #35#return; {211#false} is VALID [2020-07-08 22:08:02,275 INFO L263 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2020-07-08 22:08:02,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-08 22:08:02,276 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #31#return; {210#true} is VALID [2020-07-08 22:08:02,277 INFO L263 TraceCheckUtils]: 3: Hoare triple {210#true} call #t~ret2 := main(); {210#true} is VALID [2020-07-08 22:08:02,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {210#true} ~input~0 := 5; {214#(<= 5 main_~input~0)} is VALID [2020-07-08 22:08:02,278 INFO L263 TraceCheckUtils]: 5: Hoare triple {214#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {210#true} is VALID [2020-07-08 22:08:02,279 INFO L280 TraceCheckUtils]: 6: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,280 INFO L280 TraceCheckUtils]: 7: Hoare triple {228#(= |id_#in~x| id_~x)} assume !(0 == ~x); {228#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,280 INFO L263 TraceCheckUtils]: 8: Hoare triple {228#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {210#true} is VALID [2020-07-08 22:08:02,281 INFO L280 TraceCheckUtils]: 9: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,282 INFO L280 TraceCheckUtils]: 10: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,283 INFO L280 TraceCheckUtils]: 11: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,283 INFO L280 TraceCheckUtils]: 12: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,285 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {235#(= 0 |id_#in~x|)} {228#(= |id_#in~x| id_~x)} #37#return; {234#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,286 INFO L280 TraceCheckUtils]: 14: Hoare triple {234#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {234#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,286 INFO L280 TraceCheckUtils]: 15: Hoare triple {234#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,287 INFO L280 TraceCheckUtils]: 16: Hoare triple {234#(<= |id_#in~x| 1)} havoc #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,288 INFO L280 TraceCheckUtils]: 17: Hoare triple {234#(<= |id_#in~x| 1)} assume true; {234#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,289 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {234#(<= |id_#in~x| 1)} {214#(<= 5 main_~input~0)} #35#return; {211#false} is VALID [2020-07-08 22:08:02,290 INFO L280 TraceCheckUtils]: 19: Hoare triple {211#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {211#false} is VALID [2020-07-08 22:08:02,290 INFO L280 TraceCheckUtils]: 20: Hoare triple {211#false} ~result~0 := #t~ret1; {211#false} is VALID [2020-07-08 22:08:02,290 INFO L280 TraceCheckUtils]: 21: Hoare triple {211#false} havoc #t~ret1; {211#false} is VALID [2020-07-08 22:08:02,291 INFO L280 TraceCheckUtils]: 22: Hoare triple {211#false} assume 5 == ~result~0; {211#false} is VALID [2020-07-08 22:08:02,291 INFO L280 TraceCheckUtils]: 23: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-08 22:08:02,292 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-08 22:08:02,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [160526883] [2020-07-08 22:08:02,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:08:02,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-08 22:08:02,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379008339] [2020-07-08 22:08:02,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-08 22:08:02,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:08:02,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 22:08:02,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:08:02,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 22:08:02,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:08:02,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 22:08:02,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 22:08:02,329 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-07-08 22:08:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:02,515 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-08 22:08:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 22:08:02,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-08 22:08:02,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:08:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 22:08:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-08 22:08:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 22:08:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-08 22:08:02,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2020-07-08 22:08:02,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:08:02,569 INFO L225 Difference]: With dead ends: 34 [2020-07-08 22:08:02,570 INFO L226 Difference]: Without dead ends: 28 [2020-07-08 22:08:02,571 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-08 22:08:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-08 22:08:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-08 22:08:02,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:08:02,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-08 22:08:02,610 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 22:08:02,610 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 22:08:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:02,614 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-08 22:08:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-08 22:08:02,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:08:02,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:08:02,615 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 22:08:02,615 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 22:08:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:02,619 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-08 22:08:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-08 22:08:02,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:08:02,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:08:02,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:08:02,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:08:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-08 22:08:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-08 22:08:02,624 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-07-08 22:08:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:08:02,624 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-08 22:08:02,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 22:08:02,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2020-07-08 22:08:02,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:08:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-08 22:08:02,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-08 22:08:02,669 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:08:02,669 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:08:02,670 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 22:08:02,670 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:08:02,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:08:02,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-07-08 22:08:02,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:08:02,671 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1421594168] [2020-07-08 22:08:02,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:08:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:02,776 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-08 22:08:02,776 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {422#true} {422#true} #31#return; {422#true} is VALID [2020-07-08 22:08:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:02,947 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,950 INFO L280 TraceCheckUtils]: 3: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,951 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {469#(= 0 |id_#in~x|)} {448#(= |id_#in~x| id_~x)} #37#return; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,952 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,954 INFO L263 TraceCheckUtils]: 2: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-08 22:08:02,954 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,955 INFO L280 TraceCheckUtils]: 4: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,956 INFO L280 TraceCheckUtils]: 5: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,957 INFO L280 TraceCheckUtils]: 6: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,958 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {469#(= 0 |id_#in~x|)} {448#(= |id_#in~x| id_~x)} #37#return; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,962 INFO L280 TraceCheckUtils]: 8: Hoare triple {468#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,963 INFO L280 TraceCheckUtils]: 9: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,964 INFO L280 TraceCheckUtils]: 10: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,965 INFO L280 TraceCheckUtils]: 11: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,967 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {468#(<= |id_#in~x| 1)} {448#(= |id_#in~x| id_~x)} #37#return; {462#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:02,968 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,977 INFO L263 TraceCheckUtils]: 2: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-08 22:08:02,978 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,979 INFO L280 TraceCheckUtils]: 4: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,980 INFO L263 TraceCheckUtils]: 5: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-08 22:08:02,981 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:02,982 INFO L280 TraceCheckUtils]: 7: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,983 INFO L280 TraceCheckUtils]: 8: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,984 INFO L280 TraceCheckUtils]: 9: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:02,985 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {469#(= 0 |id_#in~x|)} {448#(= |id_#in~x| id_~x)} #37#return; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,987 INFO L280 TraceCheckUtils]: 11: Hoare triple {468#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,988 INFO L280 TraceCheckUtils]: 12: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,989 INFO L280 TraceCheckUtils]: 13: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,990 INFO L280 TraceCheckUtils]: 14: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:02,992 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {468#(<= |id_#in~x| 1)} {448#(= |id_#in~x| id_~x)} #37#return; {462#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:02,998 INFO L280 TraceCheckUtils]: 16: Hoare triple {462#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {462#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:02,999 INFO L280 TraceCheckUtils]: 17: Hoare triple {462#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,001 INFO L280 TraceCheckUtils]: 18: Hoare triple {462#(<= |id_#in~x| 2)} havoc #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,002 INFO L280 TraceCheckUtils]: 19: Hoare triple {462#(<= |id_#in~x| 2)} assume true; {462#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,003 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {462#(<= |id_#in~x| 2)} {426#(<= 5 main_~input~0)} #35#return; {423#false} is VALID [2020-07-08 22:08:03,004 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-08 22:08:03,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-08 22:08:03,005 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #31#return; {422#true} is VALID [2020-07-08 22:08:03,005 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret2 := main(); {422#true} is VALID [2020-07-08 22:08:03,006 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} ~input~0 := 5; {426#(<= 5 main_~input~0)} is VALID [2020-07-08 22:08:03,007 INFO L263 TraceCheckUtils]: 5: Hoare triple {426#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {422#true} is VALID [2020-07-08 22:08:03,007 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,008 INFO L280 TraceCheckUtils]: 7: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,009 INFO L263 TraceCheckUtils]: 8: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-08 22:08:03,009 INFO L280 TraceCheckUtils]: 9: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,010 INFO L280 TraceCheckUtils]: 10: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,010 INFO L263 TraceCheckUtils]: 11: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-08 22:08:03,012 INFO L280 TraceCheckUtils]: 12: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,023 INFO L280 TraceCheckUtils]: 13: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,024 INFO L280 TraceCheckUtils]: 14: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,024 INFO L280 TraceCheckUtils]: 15: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,026 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {469#(= 0 |id_#in~x|)} {448#(= |id_#in~x| id_~x)} #37#return; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,027 INFO L280 TraceCheckUtils]: 17: Hoare triple {468#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,028 INFO L280 TraceCheckUtils]: 18: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,029 INFO L280 TraceCheckUtils]: 19: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,033 INFO L280 TraceCheckUtils]: 20: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,035 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {468#(<= |id_#in~x| 1)} {448#(= |id_#in~x| id_~x)} #37#return; {462#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,036 INFO L280 TraceCheckUtils]: 22: Hoare triple {462#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {462#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,037 INFO L280 TraceCheckUtils]: 23: Hoare triple {462#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,037 INFO L280 TraceCheckUtils]: 24: Hoare triple {462#(<= |id_#in~x| 2)} havoc #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,038 INFO L280 TraceCheckUtils]: 25: Hoare triple {462#(<= |id_#in~x| 2)} assume true; {462#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,040 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {462#(<= |id_#in~x| 2)} {426#(<= 5 main_~input~0)} #35#return; {423#false} is VALID [2020-07-08 22:08:03,040 INFO L280 TraceCheckUtils]: 27: Hoare triple {423#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {423#false} is VALID [2020-07-08 22:08:03,040 INFO L280 TraceCheckUtils]: 28: Hoare triple {423#false} ~result~0 := #t~ret1; {423#false} is VALID [2020-07-08 22:08:03,040 INFO L280 TraceCheckUtils]: 29: Hoare triple {423#false} havoc #t~ret1; {423#false} is VALID [2020-07-08 22:08:03,041 INFO L280 TraceCheckUtils]: 30: Hoare triple {423#false} assume 5 == ~result~0; {423#false} is VALID [2020-07-08 22:08:03,041 INFO L280 TraceCheckUtils]: 31: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-08 22:08:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 22:08:03,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1421594168] [2020-07-08 22:08:03,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:08:03,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 22:08:03,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547179965] [2020-07-08 22:08:03,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-08 22:08:03,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:08:03,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 22:08:03,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:08:03,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 22:08:03,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:08:03,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 22:08:03,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-08 22:08:03,090 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-07-08 22:08:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:03,337 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-08 22:08:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 22:08:03,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-08 22:08:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:08:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:08:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2020-07-08 22:08:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:08:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2020-07-08 22:08:03,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2020-07-08 22:08:03,395 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-08 22:08:03,398 INFO L225 Difference]: With dead ends: 39 [2020-07-08 22:08:03,398 INFO L226 Difference]: Without dead ends: 33 [2020-07-08 22:08:03,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-08 22:08:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-08 22:08:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-08 22:08:03,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:08:03,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-08 22:08:03,447 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 22:08:03,448 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 22:08:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:03,451 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-08 22:08:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-08 22:08:03,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:08:03,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:08:03,452 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 22:08:03,453 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 22:08:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:03,456 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-08 22:08:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-08 22:08:03,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:08:03,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:08:03,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:08:03,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:08:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-08 22:08:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-08 22:08:03,461 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-07-08 22:08:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:08:03,461 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-08 22:08:03,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 22:08:03,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2020-07-08 22:08:03,504 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-08 22:08:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-08 22:08:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-08 22:08:03,506 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:08:03,506 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:08:03,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 22:08:03,507 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:08:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:08:03,508 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-07-08 22:08:03,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:08:03,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2021521623] [2020-07-08 22:08:03,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:08:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:03,546 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} assume true; {688#true} is VALID [2020-07-08 22:08:03,546 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {688#true} {688#true} #31#return; {688#true} is VALID [2020-07-08 22:08:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:03,693 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,695 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,695 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,696 INFO L280 TraceCheckUtils]: 3: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,697 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,698 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-08 22:08:03,699 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,700 INFO L280 TraceCheckUtils]: 4: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,700 INFO L280 TraceCheckUtils]: 5: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,701 INFO L280 TraceCheckUtils]: 6: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,702 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,702 INFO L280 TraceCheckUtils]: 8: Hoare triple {764#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,703 INFO L280 TraceCheckUtils]: 9: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,704 INFO L280 TraceCheckUtils]: 10: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,705 INFO L280 TraceCheckUtils]: 11: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,707 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {764#(<= |id_#in~x| 1)} {722#(= |id_#in~x| id_~x)} #37#return; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,709 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-08 22:08:03,709 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,710 INFO L280 TraceCheckUtils]: 4: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,710 INFO L263 TraceCheckUtils]: 5: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-08 22:08:03,710 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,711 INFO L280 TraceCheckUtils]: 7: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,711 INFO L280 TraceCheckUtils]: 8: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,712 INFO L280 TraceCheckUtils]: 9: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,718 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,718 INFO L280 TraceCheckUtils]: 11: Hoare triple {764#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,719 INFO L280 TraceCheckUtils]: 12: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,720 INFO L280 TraceCheckUtils]: 13: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,721 INFO L280 TraceCheckUtils]: 14: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,722 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {764#(<= |id_#in~x| 1)} {722#(= |id_#in~x| id_~x)} #37#return; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,723 INFO L280 TraceCheckUtils]: 16: Hoare triple {758#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,724 INFO L280 TraceCheckUtils]: 17: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,724 INFO L280 TraceCheckUtils]: 18: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,725 INFO L280 TraceCheckUtils]: 19: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,726 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {758#(<= |id_#in~x| 2)} {722#(= |id_#in~x| id_~x)} #37#return; {744#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:03,727 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,728 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,728 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-08 22:08:03,729 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,729 INFO L280 TraceCheckUtils]: 4: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,730 INFO L263 TraceCheckUtils]: 5: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-08 22:08:03,730 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,730 INFO L280 TraceCheckUtils]: 7: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,731 INFO L263 TraceCheckUtils]: 8: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-08 22:08:03,731 INFO L280 TraceCheckUtils]: 9: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,732 INFO L280 TraceCheckUtils]: 10: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,733 INFO L280 TraceCheckUtils]: 11: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,733 INFO L280 TraceCheckUtils]: 12: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,735 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,735 INFO L280 TraceCheckUtils]: 14: Hoare triple {764#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,736 INFO L280 TraceCheckUtils]: 15: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,736 INFO L280 TraceCheckUtils]: 16: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,737 INFO L280 TraceCheckUtils]: 17: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,738 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {764#(<= |id_#in~x| 1)} {722#(= |id_#in~x| id_~x)} #37#return; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,739 INFO L280 TraceCheckUtils]: 19: Hoare triple {758#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,739 INFO L280 TraceCheckUtils]: 20: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,740 INFO L280 TraceCheckUtils]: 21: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,740 INFO L280 TraceCheckUtils]: 22: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,742 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {758#(<= |id_#in~x| 2)} {722#(= |id_#in~x| id_~x)} #37#return; {744#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:03,744 INFO L280 TraceCheckUtils]: 24: Hoare triple {744#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {744#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:03,747 INFO L280 TraceCheckUtils]: 25: Hoare triple {744#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:03,747 INFO L280 TraceCheckUtils]: 26: Hoare triple {744#(<= |id_#in~x| 3)} havoc #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:03,748 INFO L280 TraceCheckUtils]: 27: Hoare triple {744#(<= |id_#in~x| 3)} assume true; {744#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:03,749 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {744#(<= |id_#in~x| 3)} {692#(<= 5 main_~input~0)} #35#return; {689#false} is VALID [2020-07-08 22:08:03,751 INFO L263 TraceCheckUtils]: 0: Hoare triple {688#true} call ULTIMATE.init(); {688#true} is VALID [2020-07-08 22:08:03,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {688#true} assume true; {688#true} is VALID [2020-07-08 22:08:03,751 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {688#true} {688#true} #31#return; {688#true} is VALID [2020-07-08 22:08:03,751 INFO L263 TraceCheckUtils]: 3: Hoare triple {688#true} call #t~ret2 := main(); {688#true} is VALID [2020-07-08 22:08:03,755 INFO L280 TraceCheckUtils]: 4: Hoare triple {688#true} ~input~0 := 5; {692#(<= 5 main_~input~0)} is VALID [2020-07-08 22:08:03,755 INFO L263 TraceCheckUtils]: 5: Hoare triple {692#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {688#true} is VALID [2020-07-08 22:08:03,756 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,756 INFO L280 TraceCheckUtils]: 7: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,756 INFO L263 TraceCheckUtils]: 8: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-08 22:08:03,757 INFO L280 TraceCheckUtils]: 9: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,757 INFO L280 TraceCheckUtils]: 10: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,758 INFO L263 TraceCheckUtils]: 11: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-08 22:08:03,758 INFO L280 TraceCheckUtils]: 12: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,758 INFO L280 TraceCheckUtils]: 13: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,759 INFO L263 TraceCheckUtils]: 14: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-08 22:08:03,759 INFO L280 TraceCheckUtils]: 15: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:03,760 INFO L280 TraceCheckUtils]: 16: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,761 INFO L280 TraceCheckUtils]: 17: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,763 INFO L280 TraceCheckUtils]: 18: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:03,764 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,766 INFO L280 TraceCheckUtils]: 20: Hoare triple {764#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,771 INFO L280 TraceCheckUtils]: 21: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,771 INFO L280 TraceCheckUtils]: 22: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,772 INFO L280 TraceCheckUtils]: 23: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:03,776 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {764#(<= |id_#in~x| 1)} {722#(= |id_#in~x| id_~x)} #37#return; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,777 INFO L280 TraceCheckUtils]: 25: Hoare triple {758#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,778 INFO L280 TraceCheckUtils]: 26: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,779 INFO L280 TraceCheckUtils]: 27: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,780 INFO L280 TraceCheckUtils]: 28: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:03,781 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {758#(<= |id_#in~x| 2)} {722#(= |id_#in~x| id_~x)} #37#return; {744#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:03,782 INFO L280 TraceCheckUtils]: 30: Hoare triple {744#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {744#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:03,782 INFO L280 TraceCheckUtils]: 31: Hoare triple {744#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:03,782 INFO L280 TraceCheckUtils]: 32: Hoare triple {744#(<= |id_#in~x| 3)} havoc #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:03,783 INFO L280 TraceCheckUtils]: 33: Hoare triple {744#(<= |id_#in~x| 3)} assume true; {744#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:03,784 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {744#(<= |id_#in~x| 3)} {692#(<= 5 main_~input~0)} #35#return; {689#false} is VALID [2020-07-08 22:08:03,784 INFO L280 TraceCheckUtils]: 35: Hoare triple {689#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {689#false} is VALID [2020-07-08 22:08:03,784 INFO L280 TraceCheckUtils]: 36: Hoare triple {689#false} ~result~0 := #t~ret1; {689#false} is VALID [2020-07-08 22:08:03,785 INFO L280 TraceCheckUtils]: 37: Hoare triple {689#false} havoc #t~ret1; {689#false} is VALID [2020-07-08 22:08:03,785 INFO L280 TraceCheckUtils]: 38: Hoare triple {689#false} assume 5 == ~result~0; {689#false} is VALID [2020-07-08 22:08:03,785 INFO L280 TraceCheckUtils]: 39: Hoare triple {689#false} assume !false; {689#false} is VALID [2020-07-08 22:08:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-08 22:08:03,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2021521623] [2020-07-08 22:08:03,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:08:03,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 22:08:03,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639288574] [2020-07-08 22:08:03,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-08 22:08:03,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:08:03,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 22:08:03,825 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-08 22:08:03,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 22:08:03,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:08:03,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 22:08:03,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-08 22:08:03,827 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-07-08 22:08:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:04,076 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-08 22:08:04,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 22:08:04,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-08 22:08:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:08:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 22:08:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2020-07-08 22:08:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 22:08:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2020-07-08 22:08:04,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2020-07-08 22:08:04,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:08:04,160 INFO L225 Difference]: With dead ends: 44 [2020-07-08 22:08:04,161 INFO L226 Difference]: Without dead ends: 38 [2020-07-08 22:08:04,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-08 22:08:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-08 22:08:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-08 22:08:04,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:08:04,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-08 22:08:04,230 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-08 22:08:04,230 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-08 22:08:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:04,234 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-08 22:08:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-08 22:08:04,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:08:04,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:08:04,236 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-08 22:08:04,236 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-08 22:08:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:04,241 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-08 22:08:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-08 22:08:04,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:08:04,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:08:04,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:08:04,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:08:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-08 22:08:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-07-08 22:08:04,251 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-07-08 22:08:04,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:08:04,253 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-07-08 22:08:04,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 22:08:04,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 39 transitions. [2020-07-08 22:08:04,312 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-08 22:08:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-08 22:08:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 22:08:04,314 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:08:04,314 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:08:04,314 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 22:08:04,314 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:08:04,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:08:04,315 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-07-08 22:08:04,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:08:04,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1858709117] [2020-07-08 22:08:04,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:08:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:04,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} assume true; {1016#true} is VALID [2020-07-08 22:08:04,354 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1016#true} {1016#true} #31#return; {1016#true} is VALID [2020-07-08 22:08:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:08:04,621 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,627 INFO L280 TraceCheckUtils]: 2: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,628 INFO L280 TraceCheckUtils]: 3: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,629 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,630 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,631 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,631 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,632 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,632 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,633 INFO L280 TraceCheckUtils]: 5: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,633 INFO L280 TraceCheckUtils]: 6: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,634 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,635 INFO L280 TraceCheckUtils]: 8: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,635 INFO L280 TraceCheckUtils]: 9: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,635 INFO L280 TraceCheckUtils]: 10: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,636 INFO L280 TraceCheckUtils]: 11: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,637 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,639 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,639 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,640 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,641 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,642 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,643 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,643 INFO L280 TraceCheckUtils]: 8: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,644 INFO L280 TraceCheckUtils]: 9: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,645 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,645 INFO L280 TraceCheckUtils]: 11: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,645 INFO L280 TraceCheckUtils]: 12: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,646 INFO L280 TraceCheckUtils]: 13: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,646 INFO L280 TraceCheckUtils]: 14: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,647 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,648 INFO L280 TraceCheckUtils]: 16: Hoare triple {1124#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,649 INFO L280 TraceCheckUtils]: 17: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,650 INFO L280 TraceCheckUtils]: 18: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,650 INFO L280 TraceCheckUtils]: 19: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,651 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1124#(<= |id_#in~x| 2)} {1058#(= |id_#in~x| id_~x)} #37#return; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,653 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,653 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,654 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,654 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,654 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,655 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,655 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,656 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,656 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,656 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,657 INFO L280 TraceCheckUtils]: 10: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,657 INFO L280 TraceCheckUtils]: 11: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,658 INFO L280 TraceCheckUtils]: 12: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,658 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,659 INFO L280 TraceCheckUtils]: 14: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,661 INFO L280 TraceCheckUtils]: 15: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,662 INFO L280 TraceCheckUtils]: 16: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,662 INFO L280 TraceCheckUtils]: 17: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,663 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,664 INFO L280 TraceCheckUtils]: 19: Hoare triple {1124#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,664 INFO L280 TraceCheckUtils]: 20: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,664 INFO L280 TraceCheckUtils]: 21: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,665 INFO L280 TraceCheckUtils]: 22: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,666 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1124#(<= |id_#in~x| 2)} {1058#(= |id_#in~x| id_~x)} #37#return; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,666 INFO L280 TraceCheckUtils]: 24: Hoare triple {1110#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,667 INFO L280 TraceCheckUtils]: 25: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,667 INFO L280 TraceCheckUtils]: 26: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,668 INFO L280 TraceCheckUtils]: 27: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,669 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1110#(<= |id_#in~x| 3)} {1058#(= |id_#in~x| id_~x)} #37#return; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:08:04,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,671 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,672 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,672 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,673 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,673 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,674 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,675 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,678 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,680 INFO L280 TraceCheckUtils]: 10: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,681 INFO L263 TraceCheckUtils]: 11: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,682 INFO L280 TraceCheckUtils]: 12: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,683 INFO L280 TraceCheckUtils]: 13: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,684 INFO L280 TraceCheckUtils]: 14: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,684 INFO L280 TraceCheckUtils]: 15: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,685 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,685 INFO L280 TraceCheckUtils]: 17: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,686 INFO L280 TraceCheckUtils]: 18: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,686 INFO L280 TraceCheckUtils]: 19: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,687 INFO L280 TraceCheckUtils]: 20: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,688 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,690 INFO L280 TraceCheckUtils]: 22: Hoare triple {1124#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,691 INFO L280 TraceCheckUtils]: 23: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,692 INFO L280 TraceCheckUtils]: 24: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,693 INFO L280 TraceCheckUtils]: 25: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,694 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1124#(<= |id_#in~x| 2)} {1058#(= |id_#in~x| id_~x)} #37#return; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,695 INFO L280 TraceCheckUtils]: 27: Hoare triple {1110#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,695 INFO L280 TraceCheckUtils]: 28: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,696 INFO L280 TraceCheckUtils]: 29: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,697 INFO L280 TraceCheckUtils]: 30: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,698 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1110#(<= |id_#in~x| 3)} {1058#(= |id_#in~x| id_~x)} #37#return; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:08:04,699 INFO L280 TraceCheckUtils]: 32: Hoare triple {1088#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:08:04,699 INFO L280 TraceCheckUtils]: 33: Hoare triple {1088#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:08:04,699 INFO L280 TraceCheckUtils]: 34: Hoare triple {1088#(<= |id_#in~x| 4)} havoc #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:08:04,700 INFO L280 TraceCheckUtils]: 35: Hoare triple {1088#(<= |id_#in~x| 4)} assume true; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:08:04,701 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1088#(<= |id_#in~x| 4)} {1020#(<= 5 main_~input~0)} #35#return; {1017#false} is VALID [2020-07-08 22:08:04,702 INFO L263 TraceCheckUtils]: 0: Hoare triple {1016#true} call ULTIMATE.init(); {1016#true} is VALID [2020-07-08 22:08:04,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {1016#true} assume true; {1016#true} is VALID [2020-07-08 22:08:04,703 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1016#true} {1016#true} #31#return; {1016#true} is VALID [2020-07-08 22:08:04,703 INFO L263 TraceCheckUtils]: 3: Hoare triple {1016#true} call #t~ret2 := main(); {1016#true} is VALID [2020-07-08 22:08:04,712 INFO L280 TraceCheckUtils]: 4: Hoare triple {1016#true} ~input~0 := 5; {1020#(<= 5 main_~input~0)} is VALID [2020-07-08 22:08:04,713 INFO L263 TraceCheckUtils]: 5: Hoare triple {1020#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {1016#true} is VALID [2020-07-08 22:08:04,714 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,714 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,714 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,715 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,716 INFO L280 TraceCheckUtils]: 10: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,716 INFO L263 TraceCheckUtils]: 11: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,717 INFO L280 TraceCheckUtils]: 12: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,717 INFO L280 TraceCheckUtils]: 13: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,718 INFO L263 TraceCheckUtils]: 14: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,718 INFO L280 TraceCheckUtils]: 15: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,719 INFO L280 TraceCheckUtils]: 16: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,719 INFO L263 TraceCheckUtils]: 17: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-08 22:08:04,720 INFO L280 TraceCheckUtils]: 18: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:08:04,720 INFO L280 TraceCheckUtils]: 19: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,723 INFO L280 TraceCheckUtils]: 20: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,724 INFO L280 TraceCheckUtils]: 21: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:08:04,725 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,726 INFO L280 TraceCheckUtils]: 23: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,726 INFO L280 TraceCheckUtils]: 24: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,727 INFO L280 TraceCheckUtils]: 25: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,728 INFO L280 TraceCheckUtils]: 26: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:08:04,731 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,732 INFO L280 TraceCheckUtils]: 28: Hoare triple {1124#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,733 INFO L280 TraceCheckUtils]: 29: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,734 INFO L280 TraceCheckUtils]: 30: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,735 INFO L280 TraceCheckUtils]: 31: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:08:04,736 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1124#(<= |id_#in~x| 2)} {1058#(= |id_#in~x| id_~x)} #37#return; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,737 INFO L280 TraceCheckUtils]: 33: Hoare triple {1110#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,738 INFO L280 TraceCheckUtils]: 34: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,738 INFO L280 TraceCheckUtils]: 35: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,739 INFO L280 TraceCheckUtils]: 36: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:08:04,740 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1110#(<= |id_#in~x| 3)} {1058#(= |id_#in~x| id_~x)} #37#return; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:08:04,741 INFO L280 TraceCheckUtils]: 38: Hoare triple {1088#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:08:04,742 INFO L280 TraceCheckUtils]: 39: Hoare triple {1088#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:08:04,743 INFO L280 TraceCheckUtils]: 40: Hoare triple {1088#(<= |id_#in~x| 4)} havoc #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:08:04,743 INFO L280 TraceCheckUtils]: 41: Hoare triple {1088#(<= |id_#in~x| 4)} assume true; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:08:04,745 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1088#(<= |id_#in~x| 4)} {1020#(<= 5 main_~input~0)} #35#return; {1017#false} is VALID [2020-07-08 22:08:04,745 INFO L280 TraceCheckUtils]: 43: Hoare triple {1017#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1017#false} is VALID [2020-07-08 22:08:04,745 INFO L280 TraceCheckUtils]: 44: Hoare triple {1017#false} ~result~0 := #t~ret1; {1017#false} is VALID [2020-07-08 22:08:04,746 INFO L280 TraceCheckUtils]: 45: Hoare triple {1017#false} havoc #t~ret1; {1017#false} is VALID [2020-07-08 22:08:04,746 INFO L280 TraceCheckUtils]: 46: Hoare triple {1017#false} assume 5 == ~result~0; {1017#false} is VALID [2020-07-08 22:08:04,746 INFO L280 TraceCheckUtils]: 47: Hoare triple {1017#false} assume !false; {1017#false} is VALID [2020-07-08 22:08:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-08 22:08:04,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1858709117] [2020-07-08 22:08:04,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:08:04,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 22:08:04,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680990894] [2020-07-08 22:08:04,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-08 22:08:04,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:08:04,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 22:08:04,793 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-08 22:08:04,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 22:08:04,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:08:04,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 22:08:04,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-08 22:08:04,794 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-07-08 22:08:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:05,055 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-07-08 22:08:05,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 22:08:05,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-08 22:08:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:08:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 22:08:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-08 22:08:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 22:08:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-08 22:08:05,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2020-07-08 22:08:05,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:08:05,140 INFO L225 Difference]: With dead ends: 49 [2020-07-08 22:08:05,141 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 22:08:05,141 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-07-08 22:08:05,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 22:08:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-08 22:08:05,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:08:05,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-08 22:08:05,192 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-08 22:08:05,192 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-08 22:08:05,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:05,195 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-08 22:08:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-08 22:08:05,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:08:05,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:08:05,196 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-08 22:08:05,196 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-08 22:08:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:08:05,199 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-08 22:08:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-08 22:08:05,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:08:05,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:08:05,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:08:05,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:08:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-08 22:08:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-07-08 22:08:05,203 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-07-08 22:08:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:08:05,203 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-07-08 22:08:05,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 22:08:05,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 44 transitions. [2020-07-08 22:08:05,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:08:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-08 22:08:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-08 22:08:05,259 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:08:05,259 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:08:05,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 22:08:05,261 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:08:05,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:08:05,261 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-07-08 22:08:05,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:08:05,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2140814951] [2020-07-08 22:08:05,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:08:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 22:08:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 22:08:05,320 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 22:08:05,320 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 22:08:05,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 22:08:05,354 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 22:08:05,355 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 22:08:05,355 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 22:08:05,355 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 22:08:05,355 WARN L170 areAnnotationChecker]: idENTRY has no Hoare annotation [2020-07-08 22:08:05,355 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 22:08:05,355 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 22:08:05,355 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 22:08:05,355 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 22:08:05,355 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 22:08:05,356 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 22:08:05,356 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 22:08:05,356 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 22:08:05,356 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 22:08:05,356 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2020-07-08 22:08:05,356 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-08 22:08:05,356 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-08 22:08:05,356 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-08 22:08:05,356 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-08 22:08:05,357 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-08 22:08:05,357 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-08 22:08:05,357 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-08 22:08:05,357 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-08 22:08:05,357 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2020-07-08 22:08:05,357 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-08 22:08:05,357 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-08 22:08:05,357 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-08 22:08:05,358 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 22:08:05,358 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 22:08:05,358 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-08 22:08:05,358 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 22:08:05,358 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-08 22:08:05,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:08:05 BoogieIcfgContainer [2020-07-08 22:08:05,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 22:08:05,365 INFO L168 Benchmark]: Toolchain (without parser) took 5140.77 ms. Allocated memory was 144.7 MB in the beginning and 279.4 MB in the end (delta: 134.7 MB). Free memory was 101.5 MB in the beginning and 204.5 MB in the end (delta: -103.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2020-07-08 22:08:05,365 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 144.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 22:08:05,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.11 ms. Allocated memory is still 144.7 MB. Free memory was 101.3 MB in the beginning and 92.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-08 22:08:05,367 INFO L168 Benchmark]: Boogie Preprocessor took 29.45 ms. Allocated memory is still 144.7 MB. Free memory was 92.1 MB in the beginning and 90.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-08 22:08:05,367 INFO L168 Benchmark]: RCFGBuilder took 385.44 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 90.5 MB in the beginning and 166.9 MB in the end (delta: -76.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 22:08:05,368 INFO L168 Benchmark]: TraceAbstraction took 4420.59 ms. Allocated memory was 202.4 MB in the beginning and 279.4 MB in the end (delta: 77.1 MB). Free memory was 166.3 MB in the beginning and 204.5 MB in the end (delta: -38.2 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2020-07-08 22:08:05,371 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.30 ms. Allocated memory is still 144.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 299.11 ms. Allocated memory is still 144.7 MB. Free memory was 101.3 MB in the beginning and 92.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.45 ms. Allocated memory is still 144.7 MB. Free memory was 92.1 MB in the beginning and 90.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 385.44 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 90.5 MB in the beginning and 166.9 MB in the end (delta: -76.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4420.59 ms. Allocated memory was 202.4 MB in the beginning and 279.4 MB in the end (delta: 77.1 MB). Free memory was 166.3 MB in the beginning and 204.5 MB in the end (delta: -38.2 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 5; VAL [input=5] [L11] CALL, EXPR id(input) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 VAL [\old(x)=0, x=0] [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; VAL [\old(x)=1, \result=1, id(x-1)=0, x=1] [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; VAL [\old(x)=3, \result=3, id(x-1)=2, x=3] [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; VAL [\old(x)=5, \result=5, id(x-1)=4, x=5] [L11] RET, EXPR id(input) VAL [id(input)=5, input=5] [L11] int result = id(input); VAL [id(input)=5, input=5, result=5] [L12] COND TRUE result == 5 VAL [input=5, result=5] [L13] __VERIFIER_error() VAL [input=5, result=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.2s, OverallIterations: 6, TraceHistogramMax: 6, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 94 SDtfs, 110 SDslu, 245 SDs, 0 SdLazy, 105 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 12455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 50/120 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...