/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:16:36,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:16:36,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:16:36,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:16:36,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:16:36,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:16:36,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:16:36,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:16:36,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:16:36,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:16:36,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:16:36,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:16:36,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:16:36,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:16:36,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:16:36,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:16:36,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:16:36,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:16:36,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:16:36,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:16:36,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:16:36,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:16:36,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:16:36,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:16:36,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:16:36,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:16:36,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:16:36,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:16:36,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:16:36,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:16:36,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:16:36,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:16:36,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:16:36,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:16:36,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:16:36,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:16:36,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:16:36,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:16:36,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:16:36,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:16:36,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:16:36,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:16:36,264 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:16:36,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:16:36,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:16:36,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:16:36,266 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:16:36,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:16:36,267 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:16:36,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:16:36,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:16:36,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:16:36,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:16:36,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:16:36,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:16:36,268 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:16:36,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:16:36,269 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:16:36,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:16:36,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:16:36,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:16:36,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:16:36,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:16:36,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:16:36,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:16:36,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:16:36,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:16:36,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:16:36,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:16:36,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:16:36,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:16:36,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:16:36,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:16:36,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:16:36,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:16:36,580 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:16:36,581 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:16:36,581 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c [2020-07-08 12:16:36,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7233b14/3d0b18f1a5a643018871cab809c7c7b9/FLAG07c819180 [2020-07-08 12:16:37,184 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:16:37,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c [2020-07-08 12:16:37,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7233b14/3d0b18f1a5a643018871cab809c7c7b9/FLAG07c819180 [2020-07-08 12:16:37,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7233b14/3d0b18f1a5a643018871cab809c7c7b9 [2020-07-08 12:16:37,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:16:37,620 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:16:37,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:16:37,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:16:37,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:16:37,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:16:37" (1/1) ... [2020-07-08 12:16:37,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@442d7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:37, skipping insertion in model container [2020-07-08 12:16:37,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:16:37" (1/1) ... [2020-07-08 12:16:37,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:16:37,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:16:37,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:16:37,877 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:16:37,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:16:37,909 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:16:37,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:37 WrapperNode [2020-07-08 12:16:37,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:16:37,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:16:37,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:16:37,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:16:37,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:37" (1/1) ... [2020-07-08 12:16:37,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:37" (1/1) ... [2020-07-08 12:16:37,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:37" (1/1) ... [2020-07-08 12:16:37,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:37" (1/1) ... [2020-07-08 12:16:37,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:37" (1/1) ... [2020-07-08 12:16:37,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:37" (1/1) ... [2020-07-08 12:16:37,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:37" (1/1) ... [2020-07-08 12:16:37,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:16:37,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:16:37,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:16:37,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:16:37,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:37" (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 12:16:38,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:16:38,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:16:38,088 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-08 12:16:38,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:16:38,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:16:38,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:16:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-08 12:16:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:16:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:16:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:16:38,310 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:16:38,310 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 12:16:38,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:16:38 BoogieIcfgContainer [2020-07-08 12:16:38,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:16:38,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:16:38,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:16:38,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:16:38,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:16:37" (1/3) ... [2020-07-08 12:16:38,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef49a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:16:38, skipping insertion in model container [2020-07-08 12:16:38,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:16:37" (2/3) ... [2020-07-08 12:16:38,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef49a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:16:38, skipping insertion in model container [2020-07-08 12:16:38,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:16:38" (3/3) ... [2020-07-08 12:16:38,324 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i5_o5-2.c [2020-07-08 12:16:38,335 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:16:38,344 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:16:38,360 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:16:38,432 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:16:38,435 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:16:38,436 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:16:38,436 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:16:38,436 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:16:38,436 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:16:38,436 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:16:38,436 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:16:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-08 12:16:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:16:38,476 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:16:38,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:16:38,478 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:16:38,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:16:38,487 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-07-08 12:16:38,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:16:38,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382149725] [2020-07-08 12:16:38,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:16:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:38,678 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-08 12:16:38,679 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-08 12:16:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:38,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} ~x := #in~x; {32#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:38,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {33#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:38,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#(= 0 |id_#in~x|)} assume true; {33#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:38,737 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {33#(= 0 |id_#in~x|)} {27#(<= 5 main_~input~0)} #30#return; {24#false} is VALID [2020-07-08 12:16:38,738 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-08 12:16:38,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-08 12:16:38,739 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #26#return; {23#true} is VALID [2020-07-08 12:16:38,739 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2020-07-08 12:16:38,740 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} ~input~0 := 5; {27#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:38,740 INFO L263 TraceCheckUtils]: 5: Hoare triple {27#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {23#true} is VALID [2020-07-08 12:16:38,742 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#true} ~x := #in~x; {32#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:38,745 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {33#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:38,748 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#(= 0 |id_#in~x|)} assume true; {33#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:38,750 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {33#(= 0 |id_#in~x|)} {27#(<= 5 main_~input~0)} #30#return; {24#false} is VALID [2020-07-08 12:16:38,751 INFO L280 TraceCheckUtils]: 10: Hoare triple {24#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {24#false} is VALID [2020-07-08 12:16:38,751 INFO L280 TraceCheckUtils]: 11: Hoare triple {24#false} assume 5 != ~result~0; {24#false} is VALID [2020-07-08 12:16:38,751 INFO L280 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-08 12:16:38,753 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 12:16:38,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382149725] [2020-07-08 12:16:38,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:16:38,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:16:38,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138708586] [2020-07-08 12:16:38,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-08 12:16:38,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:16:38,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:16:38,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:16:38,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:16:38,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:16:38,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:16:38,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:16:38,820 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-07-08 12:16:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:39,068 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-08 12:16:39,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:16:39,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-08 12:16:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:16:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:16:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-08 12:16:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:16:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-08 12:16:39,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-08 12:16:39,142 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 12:16:39,154 INFO L225 Difference]: With dead ends: 30 [2020-07-08 12:16:39,154 INFO L226 Difference]: Without dead ends: 18 [2020-07-08 12:16:39,158 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 12:16:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-08 12:16:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-08 12:16:39,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:16:39,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-08 12:16:39,202 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-08 12:16:39,202 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-08 12:16:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:39,207 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-08 12:16:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 12:16:39,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:39,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:39,208 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-08 12:16:39,209 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-08 12:16:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:39,212 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-08 12:16:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 12:16:39,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:39,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:39,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:16:39,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:16:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 12:16:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-08 12:16:39,218 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-08 12:16:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:16:39,218 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-08 12:16:39,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:16:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 12:16:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 12:16:39,220 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:16:39,220 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:16:39,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:16:39,221 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:16:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:16:39,221 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-07-08 12:16:39,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:16:39,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623406080] [2020-07-08 12:16:39,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:16:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:39,272 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-08 12:16:39,272 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-08 12:16:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:39,361 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:39,362 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {157#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:39,363 INFO L280 TraceCheckUtils]: 2: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:39,365 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {157#(= 0 |id_#in~x|)} {151#(= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:39,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:39,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#(= |id_#in~x| id_~x)} assume !(0 == ~x); {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:39,367 INFO L263 TraceCheckUtils]: 2: Hoare triple {151#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-08 12:16:39,368 INFO L280 TraceCheckUtils]: 3: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:39,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {151#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {157#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:39,370 INFO L280 TraceCheckUtils]: 5: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:39,372 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {157#(= 0 |id_#in~x|)} {151#(= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:39,373 INFO L280 TraceCheckUtils]: 7: Hoare triple {156#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:39,374 INFO L280 TraceCheckUtils]: 8: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:39,375 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-08 12:16:39,376 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-08 12:16:39,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-08 12:16:39,377 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-08 12:16:39,377 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-08 12:16:39,378 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#true} ~input~0 := 5; {140#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:39,379 INFO L263 TraceCheckUtils]: 5: Hoare triple {140#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {136#true} is VALID [2020-07-08 12:16:39,380 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:39,381 INFO L280 TraceCheckUtils]: 7: Hoare triple {151#(= |id_#in~x| id_~x)} assume !(0 == ~x); {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:39,381 INFO L263 TraceCheckUtils]: 8: Hoare triple {151#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-08 12:16:39,382 INFO L280 TraceCheckUtils]: 9: Hoare triple {136#true} ~x := #in~x; {151#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:39,383 INFO L280 TraceCheckUtils]: 10: Hoare triple {151#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {157#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:39,384 INFO L280 TraceCheckUtils]: 11: Hoare triple {157#(= 0 |id_#in~x|)} assume true; {157#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:39,386 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {157#(= 0 |id_#in~x|)} {151#(= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:39,387 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:39,387 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:39,389 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-08 12:16:39,390 INFO L280 TraceCheckUtils]: 16: Hoare triple {137#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {137#false} is VALID [2020-07-08 12:16:39,390 INFO L280 TraceCheckUtils]: 17: Hoare triple {137#false} assume 5 != ~result~0; {137#false} is VALID [2020-07-08 12:16:39,391 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-08 12:16:39,393 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 12:16:39,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623406080] [2020-07-08 12:16:39,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201200594] [2020-07-08 12:16:39,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:39,433 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-08 12:16:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:39,447 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:16:39,600 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2020-07-08 12:16:39,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-08 12:16:39,601 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #26#return; {136#true} is VALID [2020-07-08 12:16:39,601 INFO L263 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2020-07-08 12:16:39,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#true} ~input~0 := 5; {140#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:39,603 INFO L263 TraceCheckUtils]: 5: Hoare triple {140#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {136#true} is VALID [2020-07-08 12:16:39,604 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#true} ~x := #in~x; {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:39,604 INFO L280 TraceCheckUtils]: 7: Hoare triple {179#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:39,605 INFO L263 TraceCheckUtils]: 8: Hoare triple {179#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {136#true} is VALID [2020-07-08 12:16:39,606 INFO L280 TraceCheckUtils]: 9: Hoare triple {136#true} ~x := #in~x; {179#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:39,607 INFO L280 TraceCheckUtils]: 10: Hoare triple {179#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {192#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:39,607 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#(<= |id_#in~x| 0)} assume true; {192#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:39,609 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {192#(<= |id_#in~x| 0)} {179#(<= |id_#in~x| id_~x)} #32#return; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:39,610 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:39,611 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#(<= |id_#in~x| 1)} assume true; {156#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:39,613 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {156#(<= |id_#in~x| 1)} {140#(<= 5 main_~input~0)} #30#return; {137#false} is VALID [2020-07-08 12:16:39,613 INFO L280 TraceCheckUtils]: 16: Hoare triple {137#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {137#false} is VALID [2020-07-08 12:16:39,614 INFO L280 TraceCheckUtils]: 17: Hoare triple {137#false} assume 5 != ~result~0; {137#false} is VALID [2020-07-08 12:16:39,614 INFO L280 TraceCheckUtils]: 18: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-08 12:16:39,615 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 12:16:39,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:16:39,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-08 12:16:39,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948006658] [2020-07-08 12:16:39,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-08 12:16:39,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:16:39,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:16:39,656 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 12:16:39,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:16:39,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:16:39,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:16:39,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:16:39,657 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2020-07-08 12:16:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:39,814 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-08 12:16:39,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:16:39,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-08 12:16:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:16:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:16:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-08 12:16:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:16:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-08 12:16:39,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-08 12:16:39,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:16:39,857 INFO L225 Difference]: With dead ends: 25 [2020-07-08 12:16:39,857 INFO L226 Difference]: Without dead ends: 21 [2020-07-08 12:16:39,858 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:16:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-08 12:16:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-08 12:16:39,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:16:39,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-08 12:16:39,868 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-08 12:16:39,868 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-08 12:16:39,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:39,871 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-08 12:16:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-08 12:16:39,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:39,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:39,872 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-08 12:16:39,873 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-08 12:16:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:39,875 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-08 12:16:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-08 12:16:39,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:39,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:39,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:16:39,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:16:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:16:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-08 12:16:39,879 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-07-08 12:16:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:16:39,880 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-08 12:16:39,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:16:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-08 12:16:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:16:39,881 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:16:39,881 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:16:40,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-08 12:16:40,097 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:16:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:16:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-07-08 12:16:40,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:16:40,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736264289] [2020-07-08 12:16:40,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:16:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:40,151 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-08 12:16:40,152 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-08 12:16:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:40,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:40,252 INFO L280 TraceCheckUtils]: 2: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:40,253 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:40,254 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,255 INFO L280 TraceCheckUtils]: 1: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,255 INFO L263 TraceCheckUtils]: 2: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:40,256 INFO L280 TraceCheckUtils]: 3: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,257 INFO L280 TraceCheckUtils]: 4: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:40,258 INFO L280 TraceCheckUtils]: 5: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:40,259 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:40,260 INFO L280 TraceCheckUtils]: 7: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:40,261 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:40,263 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {359#(<= |id_#in~x| 1)} {343#(= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:40,264 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,265 INFO L280 TraceCheckUtils]: 1: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,265 INFO L263 TraceCheckUtils]: 2: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:40,266 INFO L280 TraceCheckUtils]: 3: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,267 INFO L280 TraceCheckUtils]: 4: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,267 INFO L263 TraceCheckUtils]: 5: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:40,268 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,268 INFO L280 TraceCheckUtils]: 7: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:40,269 INFO L280 TraceCheckUtils]: 8: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:40,271 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:40,272 INFO L280 TraceCheckUtils]: 10: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:40,273 INFO L280 TraceCheckUtils]: 11: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:40,275 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {359#(<= |id_#in~x| 1)} {343#(= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:40,276 INFO L280 TraceCheckUtils]: 13: Hoare triple {354#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:40,276 INFO L280 TraceCheckUtils]: 14: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:40,278 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-08 12:16:40,278 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-08 12:16:40,279 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-08 12:16:40,279 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-08 12:16:40,279 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret2 := main(); {322#true} is VALID [2020-07-08 12:16:40,280 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} ~input~0 := 5; {326#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:40,281 INFO L263 TraceCheckUtils]: 5: Hoare triple {326#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {322#true} is VALID [2020-07-08 12:16:40,282 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,283 INFO L280 TraceCheckUtils]: 7: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,283 INFO L263 TraceCheckUtils]: 8: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:40,284 INFO L280 TraceCheckUtils]: 9: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,285 INFO L280 TraceCheckUtils]: 10: Hoare triple {343#(= |id_#in~x| id_~x)} assume !(0 == ~x); {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,285 INFO L263 TraceCheckUtils]: 11: Hoare triple {343#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:40,286 INFO L280 TraceCheckUtils]: 12: Hoare triple {322#true} ~x := #in~x; {343#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,287 INFO L280 TraceCheckUtils]: 13: Hoare triple {343#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:40,288 INFO L280 TraceCheckUtils]: 14: Hoare triple {360#(= 0 |id_#in~x|)} assume true; {360#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:40,289 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {360#(= 0 |id_#in~x|)} {343#(= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:40,290 INFO L280 TraceCheckUtils]: 16: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:40,291 INFO L280 TraceCheckUtils]: 17: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:40,293 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {359#(<= |id_#in~x| 1)} {343#(= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:40,294 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:40,306 INFO L280 TraceCheckUtils]: 20: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:40,307 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-08 12:16:40,307 INFO L280 TraceCheckUtils]: 22: Hoare triple {323#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {323#false} is VALID [2020-07-08 12:16:40,308 INFO L280 TraceCheckUtils]: 23: Hoare triple {323#false} assume 5 != ~result~0; {323#false} is VALID [2020-07-08 12:16:40,308 INFO L280 TraceCheckUtils]: 24: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-08 12:16:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:16:40,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736264289] [2020-07-08 12:16:40,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859478852] [2020-07-08 12:16:40,310 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:40,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:16:40,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:16:40,347 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-08 12:16:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:40,362 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:16:40,522 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-08 12:16:40,522 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-08 12:16:40,523 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #26#return; {322#true} is VALID [2020-07-08 12:16:40,523 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret2 := main(); {322#true} is VALID [2020-07-08 12:16:40,524 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} ~input~0 := 5; {326#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:40,524 INFO L263 TraceCheckUtils]: 5: Hoare triple {326#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {322#true} is VALID [2020-07-08 12:16:40,525 INFO L280 TraceCheckUtils]: 6: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,526 INFO L280 TraceCheckUtils]: 7: Hoare triple {382#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,526 INFO L263 TraceCheckUtils]: 8: Hoare triple {382#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:40,527 INFO L280 TraceCheckUtils]: 9: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,528 INFO L280 TraceCheckUtils]: 10: Hoare triple {382#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,528 INFO L263 TraceCheckUtils]: 11: Hoare triple {382#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {322#true} is VALID [2020-07-08 12:16:40,529 INFO L280 TraceCheckUtils]: 12: Hoare triple {322#true} ~x := #in~x; {382#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:40,530 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {404#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:40,531 INFO L280 TraceCheckUtils]: 14: Hoare triple {404#(<= |id_#in~x| 0)} assume true; {404#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:40,533 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {404#(<= |id_#in~x| 0)} {382#(<= |id_#in~x| id_~x)} #32#return; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:40,534 INFO L280 TraceCheckUtils]: 16: Hoare triple {359#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:40,535 INFO L280 TraceCheckUtils]: 17: Hoare triple {359#(<= |id_#in~x| 1)} assume true; {359#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:40,537 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {359#(<= |id_#in~x| 1)} {382#(<= |id_#in~x| id_~x)} #32#return; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:40,538 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:40,539 INFO L280 TraceCheckUtils]: 20: Hoare triple {354#(<= |id_#in~x| 2)} assume true; {354#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:40,541 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {354#(<= |id_#in~x| 2)} {326#(<= 5 main_~input~0)} #30#return; {323#false} is VALID [2020-07-08 12:16:40,541 INFO L280 TraceCheckUtils]: 22: Hoare triple {323#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {323#false} is VALID [2020-07-08 12:16:40,541 INFO L280 TraceCheckUtils]: 23: Hoare triple {323#false} assume 5 != ~result~0; {323#false} is VALID [2020-07-08 12:16:40,542 INFO L280 TraceCheckUtils]: 24: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-08 12:16:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:16:40,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:16:40,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-08 12:16:40,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682186003] [2020-07-08 12:16:40,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-08 12:16:40,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:16:40,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:16:40,592 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 12:16:40,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:16:40,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:16:40,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:16:40,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:16:40,594 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2020-07-08 12:16:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:40,799 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-08 12:16:40,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:16:40,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-08 12:16:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:16:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:16:40,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-08 12:16:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:16:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-08 12:16:40,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2020-07-08 12:16:40,863 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 12:16:40,865 INFO L225 Difference]: With dead ends: 28 [2020-07-08 12:16:40,865 INFO L226 Difference]: Without dead ends: 24 [2020-07-08 12:16:40,867 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:16:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-08 12:16:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-08 12:16:40,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:16:40,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-08 12:16:40,879 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 12:16:40,879 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 12:16:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:40,882 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-08 12:16:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-08 12:16:40,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:40,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:40,883 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 12:16:40,883 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 12:16:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:40,886 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-08 12:16:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-08 12:16:40,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:40,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:40,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:16:40,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:16:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 12:16:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-08 12:16:40,890 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-07-08 12:16:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:16:40,894 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-08 12:16:40,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:16:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-08 12:16:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 12:16:40,895 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:16:40,895 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:16:41,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:41,097 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:16:41,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:16:41,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-07-08 12:16:41,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:16:41,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338655305] [2020-07-08 12:16:41,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:16:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:41,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-08 12:16:41,154 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-08 12:16:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:41,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:41,365 INFO L280 TraceCheckUtils]: 2: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:41,367 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,368 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,368 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,369 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:41,369 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,370 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:41,371 INFO L280 TraceCheckUtils]: 5: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:41,372 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,374 INFO L280 TraceCheckUtils]: 7: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,375 INFO L280 TraceCheckUtils]: 8: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,377 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:41,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,380 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,381 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:41,381 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,382 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,382 INFO L263 TraceCheckUtils]: 5: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:41,383 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,384 INFO L280 TraceCheckUtils]: 7: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:41,384 INFO L280 TraceCheckUtils]: 8: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:41,385 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,386 INFO L280 TraceCheckUtils]: 10: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,386 INFO L280 TraceCheckUtils]: 11: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,387 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:41,388 INFO L280 TraceCheckUtils]: 13: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:41,390 INFO L280 TraceCheckUtils]: 14: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:41,392 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {612#(<= |id_#in~x| 2)} {584#(= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:41,394 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,396 INFO L263 TraceCheckUtils]: 2: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:41,397 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,397 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,398 INFO L263 TraceCheckUtils]: 5: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:41,398 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,400 INFO L280 TraceCheckUtils]: 7: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,400 INFO L263 TraceCheckUtils]: 8: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:41,401 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,402 INFO L280 TraceCheckUtils]: 10: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:41,403 INFO L280 TraceCheckUtils]: 11: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:41,405 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,406 INFO L280 TraceCheckUtils]: 13: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,407 INFO L280 TraceCheckUtils]: 14: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,409 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:41,411 INFO L280 TraceCheckUtils]: 16: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:41,412 INFO L280 TraceCheckUtils]: 17: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:41,414 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {612#(<= |id_#in~x| 2)} {584#(= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:41,416 INFO L280 TraceCheckUtils]: 19: Hoare triple {601#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:41,416 INFO L280 TraceCheckUtils]: 20: Hoare triple {601#(<= |id_#in~x| 3)} assume true; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:41,417 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {601#(<= |id_#in~x| 3)} {561#(<= 5 main_~input~0)} #30#return; {558#false} is VALID [2020-07-08 12:16:41,418 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {557#true} is VALID [2020-07-08 12:16:41,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-08 12:16:41,419 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-08 12:16:41,419 INFO L263 TraceCheckUtils]: 3: Hoare triple {557#true} call #t~ret2 := main(); {557#true} is VALID [2020-07-08 12:16:41,420 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} ~input~0 := 5; {561#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:41,420 INFO L263 TraceCheckUtils]: 5: Hoare triple {561#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {557#true} is VALID [2020-07-08 12:16:41,421 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,422 INFO L280 TraceCheckUtils]: 7: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,422 INFO L263 TraceCheckUtils]: 8: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:41,423 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,423 INFO L280 TraceCheckUtils]: 10: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,424 INFO L263 TraceCheckUtils]: 11: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:41,424 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,425 INFO L280 TraceCheckUtils]: 13: Hoare triple {584#(= |id_#in~x| id_~x)} assume !(0 == ~x); {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,425 INFO L263 TraceCheckUtils]: 14: Hoare triple {584#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:41,426 INFO L280 TraceCheckUtils]: 15: Hoare triple {557#true} ~x := #in~x; {584#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,427 INFO L280 TraceCheckUtils]: 16: Hoare triple {584#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:41,427 INFO L280 TraceCheckUtils]: 17: Hoare triple {618#(= 0 |id_#in~x|)} assume true; {618#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:41,428 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {618#(= 0 |id_#in~x|)} {584#(= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,429 INFO L280 TraceCheckUtils]: 19: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,430 INFO L280 TraceCheckUtils]: 20: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,431 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {617#(<= |id_#in~x| 1)} {584#(= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:41,432 INFO L280 TraceCheckUtils]: 22: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:41,433 INFO L280 TraceCheckUtils]: 23: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:41,434 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {612#(<= |id_#in~x| 2)} {584#(= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:41,435 INFO L280 TraceCheckUtils]: 25: Hoare triple {601#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:41,435 INFO L280 TraceCheckUtils]: 26: Hoare triple {601#(<= |id_#in~x| 3)} assume true; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:41,436 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {601#(<= |id_#in~x| 3)} {561#(<= 5 main_~input~0)} #30#return; {558#false} is VALID [2020-07-08 12:16:41,437 INFO L280 TraceCheckUtils]: 28: Hoare triple {558#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {558#false} is VALID [2020-07-08 12:16:41,437 INFO L280 TraceCheckUtils]: 29: Hoare triple {558#false} assume 5 != ~result~0; {558#false} is VALID [2020-07-08 12:16:41,437 INFO L280 TraceCheckUtils]: 30: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-08 12:16:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-08 12:16:41,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338655305] [2020-07-08 12:16:41,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748275113] [2020-07-08 12:16:41,439 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:41,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-08 12:16:41,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:16:41,467 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-08 12:16:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:41,478 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:16:41,609 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {557#true} is VALID [2020-07-08 12:16:41,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-08 12:16:41,610 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {557#true} {557#true} #26#return; {557#true} is VALID [2020-07-08 12:16:41,610 INFO L263 TraceCheckUtils]: 3: Hoare triple {557#true} call #t~ret2 := main(); {557#true} is VALID [2020-07-08 12:16:41,611 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} ~input~0 := 5; {561#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:41,611 INFO L263 TraceCheckUtils]: 5: Hoare triple {561#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {557#true} is VALID [2020-07-08 12:16:41,612 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} ~x := #in~x; {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,613 INFO L280 TraceCheckUtils]: 7: Hoare triple {640#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,613 INFO L263 TraceCheckUtils]: 8: Hoare triple {640#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:41,614 INFO L280 TraceCheckUtils]: 9: Hoare triple {557#true} ~x := #in~x; {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,614 INFO L280 TraceCheckUtils]: 10: Hoare triple {640#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,615 INFO L263 TraceCheckUtils]: 11: Hoare triple {640#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:41,615 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#true} ~x := #in~x; {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,616 INFO L280 TraceCheckUtils]: 13: Hoare triple {640#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,617 INFO L263 TraceCheckUtils]: 14: Hoare triple {640#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {557#true} is VALID [2020-07-08 12:16:41,617 INFO L280 TraceCheckUtils]: 15: Hoare triple {557#true} ~x := #in~x; {640#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:41,618 INFO L280 TraceCheckUtils]: 16: Hoare triple {640#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {671#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:41,619 INFO L280 TraceCheckUtils]: 17: Hoare triple {671#(<= |id_#in~x| 0)} assume true; {671#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:41,620 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {671#(<= |id_#in~x| 0)} {640#(<= |id_#in~x| id_~x)} #32#return; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,621 INFO L280 TraceCheckUtils]: 19: Hoare triple {617#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,622 INFO L280 TraceCheckUtils]: 20: Hoare triple {617#(<= |id_#in~x| 1)} assume true; {617#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:41,623 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {617#(<= |id_#in~x| 1)} {640#(<= |id_#in~x| id_~x)} #32#return; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:41,624 INFO L280 TraceCheckUtils]: 22: Hoare triple {612#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:41,625 INFO L280 TraceCheckUtils]: 23: Hoare triple {612#(<= |id_#in~x| 2)} assume true; {612#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:41,626 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {612#(<= |id_#in~x| 2)} {640#(<= |id_#in~x| id_~x)} #32#return; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:41,627 INFO L280 TraceCheckUtils]: 25: Hoare triple {601#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:41,628 INFO L280 TraceCheckUtils]: 26: Hoare triple {601#(<= |id_#in~x| 3)} assume true; {601#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:41,629 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {601#(<= |id_#in~x| 3)} {561#(<= 5 main_~input~0)} #30#return; {558#false} is VALID [2020-07-08 12:16:41,629 INFO L280 TraceCheckUtils]: 28: Hoare triple {558#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {558#false} is VALID [2020-07-08 12:16:41,629 INFO L280 TraceCheckUtils]: 29: Hoare triple {558#false} assume 5 != ~result~0; {558#false} is VALID [2020-07-08 12:16:41,630 INFO L280 TraceCheckUtils]: 30: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-08 12:16:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-08 12:16:41,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:16:41,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-08 12:16:41,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389766731] [2020-07-08 12:16:41,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-08 12:16:41,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:16:41,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 12:16:41,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:16:41,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 12:16:41,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:16:41,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 12:16:41,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:16:41,673 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2020-07-08 12:16:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:41,913 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-08 12:16:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:16:41,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-08 12:16:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:16:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:16:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2020-07-08 12:16:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:16:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2020-07-08 12:16:41,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2020-07-08 12:16:41,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:16:41,986 INFO L225 Difference]: With dead ends: 31 [2020-07-08 12:16:41,986 INFO L226 Difference]: Without dead ends: 27 [2020-07-08 12:16:41,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:16:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-08 12:16:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-08 12:16:41,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:16:41,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-08 12:16:41,995 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-08 12:16:41,995 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-08 12:16:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:41,998 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-08 12:16:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-08 12:16:41,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:41,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:41,999 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-08 12:16:41,999 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-08 12:16:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:42,002 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-08 12:16:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-08 12:16:42,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:42,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:42,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:16:42,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:16:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:16:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-08 12:16:42,005 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-07-08 12:16:42,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:16:42,005 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-08 12:16:42,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 12:16:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-08 12:16:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 12:16:42,007 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:16:42,007 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:16:42,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:42,222 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:16:42,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:16:42,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-07-08 12:16:42,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:16:42,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184349647] [2020-07-08 12:16:42,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:16:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:42,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} assume true; {847#true} is VALID [2020-07-08 12:16:42,295 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {847#true} {847#true} #26#return; {847#true} is VALID [2020-07-08 12:16:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:42,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,513 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:42,513 INFO L280 TraceCheckUtils]: 2: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:42,514 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,516 INFO L263 TraceCheckUtils]: 2: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,517 INFO L280 TraceCheckUtils]: 3: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,518 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:42,518 INFO L280 TraceCheckUtils]: 5: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:42,520 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,520 INFO L280 TraceCheckUtils]: 7: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,521 INFO L280 TraceCheckUtils]: 8: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,523 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,525 INFO L263 TraceCheckUtils]: 2: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,526 INFO L280 TraceCheckUtils]: 3: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,526 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,527 INFO L263 TraceCheckUtils]: 5: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,527 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,528 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:42,529 INFO L280 TraceCheckUtils]: 8: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:42,530 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,531 INFO L280 TraceCheckUtils]: 10: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,531 INFO L280 TraceCheckUtils]: 11: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,533 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,533 INFO L280 TraceCheckUtils]: 13: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,534 INFO L280 TraceCheckUtils]: 14: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,535 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {931#(<= |id_#in~x| 2)} {880#(= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:42,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,538 INFO L263 TraceCheckUtils]: 2: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,539 INFO L280 TraceCheckUtils]: 3: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,539 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,540 INFO L263 TraceCheckUtils]: 5: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,540 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,541 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,541 INFO L263 TraceCheckUtils]: 8: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,542 INFO L280 TraceCheckUtils]: 9: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,543 INFO L280 TraceCheckUtils]: 10: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:42,543 INFO L280 TraceCheckUtils]: 11: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:42,545 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,545 INFO L280 TraceCheckUtils]: 13: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,546 INFO L280 TraceCheckUtils]: 14: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,548 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,548 INFO L280 TraceCheckUtils]: 16: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,549 INFO L280 TraceCheckUtils]: 17: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,551 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {931#(<= |id_#in~x| 2)} {880#(= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:42,551 INFO L280 TraceCheckUtils]: 19: Hoare triple {920#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {920#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:42,552 INFO L280 TraceCheckUtils]: 20: Hoare triple {920#(<= |id_#in~x| 3)} assume true; {920#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:42,553 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {920#(<= |id_#in~x| 3)} {880#(= |id_#in~x| id_~x)} #32#return; {903#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:42,555 INFO L280 TraceCheckUtils]: 0: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,556 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,556 INFO L263 TraceCheckUtils]: 2: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,557 INFO L280 TraceCheckUtils]: 3: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,558 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,558 INFO L263 TraceCheckUtils]: 5: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,559 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,559 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,560 INFO L263 TraceCheckUtils]: 8: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,560 INFO L280 TraceCheckUtils]: 9: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,561 INFO L280 TraceCheckUtils]: 10: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,561 INFO L263 TraceCheckUtils]: 11: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,562 INFO L280 TraceCheckUtils]: 12: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,563 INFO L280 TraceCheckUtils]: 13: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:42,563 INFO L280 TraceCheckUtils]: 14: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:42,564 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,565 INFO L280 TraceCheckUtils]: 16: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,565 INFO L280 TraceCheckUtils]: 17: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,567 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,568 INFO L280 TraceCheckUtils]: 19: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,568 INFO L280 TraceCheckUtils]: 20: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,570 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {931#(<= |id_#in~x| 2)} {880#(= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:42,570 INFO L280 TraceCheckUtils]: 22: Hoare triple {920#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {920#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:42,571 INFO L280 TraceCheckUtils]: 23: Hoare triple {920#(<= |id_#in~x| 3)} assume true; {920#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:42,573 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {920#(<= |id_#in~x| 3)} {880#(= |id_#in~x| id_~x)} #32#return; {903#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:42,573 INFO L280 TraceCheckUtils]: 25: Hoare triple {903#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {903#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:42,574 INFO L280 TraceCheckUtils]: 26: Hoare triple {903#(<= |id_#in~x| 4)} assume true; {903#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:42,575 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {903#(<= |id_#in~x| 4)} {851#(<= 5 main_~input~0)} #30#return; {848#false} is VALID [2020-07-08 12:16:42,577 INFO L263 TraceCheckUtils]: 0: Hoare triple {847#true} call ULTIMATE.init(); {847#true} is VALID [2020-07-08 12:16:42,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {847#true} assume true; {847#true} is VALID [2020-07-08 12:16:42,577 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {847#true} {847#true} #26#return; {847#true} is VALID [2020-07-08 12:16:42,578 INFO L263 TraceCheckUtils]: 3: Hoare triple {847#true} call #t~ret2 := main(); {847#true} is VALID [2020-07-08 12:16:42,578 INFO L280 TraceCheckUtils]: 4: Hoare triple {847#true} ~input~0 := 5; {851#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:42,579 INFO L263 TraceCheckUtils]: 5: Hoare triple {851#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {847#true} is VALID [2020-07-08 12:16:42,579 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,580 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,580 INFO L263 TraceCheckUtils]: 8: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,581 INFO L280 TraceCheckUtils]: 9: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,582 INFO L280 TraceCheckUtils]: 10: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,582 INFO L263 TraceCheckUtils]: 11: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,582 INFO L280 TraceCheckUtils]: 12: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,583 INFO L280 TraceCheckUtils]: 13: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,583 INFO L263 TraceCheckUtils]: 14: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,584 INFO L280 TraceCheckUtils]: 15: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,585 INFO L280 TraceCheckUtils]: 16: Hoare triple {880#(= |id_#in~x| id_~x)} assume !(0 == ~x); {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,585 INFO L263 TraceCheckUtils]: 17: Hoare triple {880#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,585 INFO L280 TraceCheckUtils]: 18: Hoare triple {847#true} ~x := #in~x; {880#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,586 INFO L280 TraceCheckUtils]: 19: Hoare triple {880#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {937#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:42,587 INFO L280 TraceCheckUtils]: 20: Hoare triple {937#(= 0 |id_#in~x|)} assume true; {937#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:42,588 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {937#(= 0 |id_#in~x|)} {880#(= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,589 INFO L280 TraceCheckUtils]: 22: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,589 INFO L280 TraceCheckUtils]: 23: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,591 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {936#(<= |id_#in~x| 1)} {880#(= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,592 INFO L280 TraceCheckUtils]: 25: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,592 INFO L280 TraceCheckUtils]: 26: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,594 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {931#(<= |id_#in~x| 2)} {880#(= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:42,594 INFO L280 TraceCheckUtils]: 28: Hoare triple {920#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {920#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:42,595 INFO L280 TraceCheckUtils]: 29: Hoare triple {920#(<= |id_#in~x| 3)} assume true; {920#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:42,597 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {920#(<= |id_#in~x| 3)} {880#(= |id_#in~x| id_~x)} #32#return; {903#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:42,597 INFO L280 TraceCheckUtils]: 31: Hoare triple {903#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {903#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:42,598 INFO L280 TraceCheckUtils]: 32: Hoare triple {903#(<= |id_#in~x| 4)} assume true; {903#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:42,599 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {903#(<= |id_#in~x| 4)} {851#(<= 5 main_~input~0)} #30#return; {848#false} is VALID [2020-07-08 12:16:42,600 INFO L280 TraceCheckUtils]: 34: Hoare triple {848#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {848#false} is VALID [2020-07-08 12:16:42,600 INFO L280 TraceCheckUtils]: 35: Hoare triple {848#false} assume 5 != ~result~0; {848#false} is VALID [2020-07-08 12:16:42,600 INFO L280 TraceCheckUtils]: 36: Hoare triple {848#false} assume !false; {848#false} is VALID [2020-07-08 12:16:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-08 12:16:42,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184349647] [2020-07-08 12:16:42,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229230505] [2020-07-08 12:16:42,602 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-08 12:16:42,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-08 12:16:42,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:16:42,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:42,639 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:16:42,797 INFO L263 TraceCheckUtils]: 0: Hoare triple {847#true} call ULTIMATE.init(); {847#true} is VALID [2020-07-08 12:16:42,797 INFO L280 TraceCheckUtils]: 1: Hoare triple {847#true} assume true; {847#true} is VALID [2020-07-08 12:16:42,798 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {847#true} {847#true} #26#return; {847#true} is VALID [2020-07-08 12:16:42,798 INFO L263 TraceCheckUtils]: 3: Hoare triple {847#true} call #t~ret2 := main(); {847#true} is VALID [2020-07-08 12:16:42,799 INFO L280 TraceCheckUtils]: 4: Hoare triple {847#true} ~input~0 := 5; {851#(<= 5 main_~input~0)} is VALID [2020-07-08 12:16:42,799 INFO L263 TraceCheckUtils]: 5: Hoare triple {851#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {847#true} is VALID [2020-07-08 12:16:42,799 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,800 INFO L280 TraceCheckUtils]: 7: Hoare triple {959#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,800 INFO L263 TraceCheckUtils]: 8: Hoare triple {959#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,801 INFO L280 TraceCheckUtils]: 9: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,801 INFO L280 TraceCheckUtils]: 10: Hoare triple {959#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,802 INFO L263 TraceCheckUtils]: 11: Hoare triple {959#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,802 INFO L280 TraceCheckUtils]: 12: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,803 INFO L280 TraceCheckUtils]: 13: Hoare triple {959#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,803 INFO L263 TraceCheckUtils]: 14: Hoare triple {959#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,804 INFO L280 TraceCheckUtils]: 15: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,804 INFO L280 TraceCheckUtils]: 16: Hoare triple {959#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,805 INFO L263 TraceCheckUtils]: 17: Hoare triple {959#(<= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {847#true} is VALID [2020-07-08 12:16:42,805 INFO L280 TraceCheckUtils]: 18: Hoare triple {847#true} ~x := #in~x; {959#(<= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:42,806 INFO L280 TraceCheckUtils]: 19: Hoare triple {959#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {999#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:42,806 INFO L280 TraceCheckUtils]: 20: Hoare triple {999#(<= |id_#in~x| 0)} assume true; {999#(<= |id_#in~x| 0)} is VALID [2020-07-08 12:16:42,808 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {999#(<= |id_#in~x| 0)} {959#(<= |id_#in~x| id_~x)} #32#return; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,808 INFO L280 TraceCheckUtils]: 22: Hoare triple {936#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,809 INFO L280 TraceCheckUtils]: 23: Hoare triple {936#(<= |id_#in~x| 1)} assume true; {936#(<= |id_#in~x| 1)} is VALID [2020-07-08 12:16:42,810 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {936#(<= |id_#in~x| 1)} {959#(<= |id_#in~x| id_~x)} #32#return; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,811 INFO L280 TraceCheckUtils]: 25: Hoare triple {931#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,811 INFO L280 TraceCheckUtils]: 26: Hoare triple {931#(<= |id_#in~x| 2)} assume true; {931#(<= |id_#in~x| 2)} is VALID [2020-07-08 12:16:42,813 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {931#(<= |id_#in~x| 2)} {959#(<= |id_#in~x| id_~x)} #32#return; {920#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:42,813 INFO L280 TraceCheckUtils]: 28: Hoare triple {920#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {920#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:42,814 INFO L280 TraceCheckUtils]: 29: Hoare triple {920#(<= |id_#in~x| 3)} assume true; {920#(<= |id_#in~x| 3)} is VALID [2020-07-08 12:16:42,815 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {920#(<= |id_#in~x| 3)} {959#(<= |id_#in~x| id_~x)} #32#return; {903#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:42,815 INFO L280 TraceCheckUtils]: 31: Hoare triple {903#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {903#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:42,816 INFO L280 TraceCheckUtils]: 32: Hoare triple {903#(<= |id_#in~x| 4)} assume true; {903#(<= |id_#in~x| 4)} is VALID [2020-07-08 12:16:42,817 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {903#(<= |id_#in~x| 4)} {851#(<= 5 main_~input~0)} #30#return; {848#false} is VALID [2020-07-08 12:16:42,817 INFO L280 TraceCheckUtils]: 34: Hoare triple {848#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {848#false} is VALID [2020-07-08 12:16:42,818 INFO L280 TraceCheckUtils]: 35: Hoare triple {848#false} assume 5 != ~result~0; {848#false} is VALID [2020-07-08 12:16:42,818 INFO L280 TraceCheckUtils]: 36: Hoare triple {848#false} assume !false; {848#false} is VALID [2020-07-08 12:16:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-08 12:16:42,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:16:42,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-07-08 12:16:42,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454304111] [2020-07-08 12:16:42,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-08 12:16:42,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:16:42,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:16:42,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:16:42,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:16:42,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:16:42,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:16:42,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:16:42,864 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 11 states. [2020-07-08 12:16:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:43,062 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-08 12:16:43,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:16:43,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-08 12:16:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:16:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:16:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-08 12:16:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:16:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-08 12:16:43,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2020-07-08 12:16:43,120 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 12:16:43,122 INFO L225 Difference]: With dead ends: 34 [2020-07-08 12:16:43,122 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:16:43,123 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2020-07-08 12:16:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:16:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-08 12:16:43,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:16:43,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-08 12:16:43,131 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 12:16:43,132 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 12:16:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:43,134 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-08 12:16:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-08 12:16:43,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:43,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:43,135 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 12:16:43,135 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 12:16:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:43,138 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-08 12:16:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-08 12:16:43,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:43,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:43,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:16:43,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:16:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 12:16:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-08 12:16:43,142 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-07-08 12:16:43,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:16:43,142 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-08 12:16:43,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:16:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-08 12:16:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-08 12:16:43,143 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:16:43,144 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:16:43,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:43,358 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:16:43,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:16:43,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-07-08 12:16:43,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:16:43,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546807960] [2020-07-08 12:16:43,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:16:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:43,426 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} assume true; {1198#true} is VALID [2020-07-08 12:16:43,426 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1198#true} {1198#true} #26#return; {1198#true} is VALID [2020-07-08 12:16:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:43,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,700 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,700 INFO L280 TraceCheckUtils]: 2: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,702 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 12:16:43,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,703 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,704 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,704 INFO L280 TraceCheckUtils]: 5: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,706 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 12:16:43,706 INFO L280 TraceCheckUtils]: 7: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:43,707 INFO L280 TraceCheckUtils]: 8: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:43,708 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,709 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,709 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,709 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,710 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,710 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,710 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,710 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,711 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,712 INFO L280 TraceCheckUtils]: 8: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,713 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 12:16:43,714 INFO L280 TraceCheckUtils]: 10: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:43,715 INFO L280 TraceCheckUtils]: 11: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:43,716 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,717 INFO L280 TraceCheckUtils]: 13: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-08 12:16:43,717 INFO L280 TraceCheckUtils]: 14: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-08 12:16:43,718 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,720 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,720 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,720 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,720 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,721 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,721 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,721 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,721 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,722 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,723 INFO L280 TraceCheckUtils]: 11: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,724 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 12:16:43,725 INFO L280 TraceCheckUtils]: 13: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:43,725 INFO L280 TraceCheckUtils]: 14: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:43,727 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,728 INFO L280 TraceCheckUtils]: 16: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-08 12:16:43,729 INFO L280 TraceCheckUtils]: 17: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-08 12:16:43,730 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,731 INFO L280 TraceCheckUtils]: 19: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-08 12:16:43,732 INFO L280 TraceCheckUtils]: 20: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-08 12:16:43,733 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,734 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,735 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,735 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,735 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,735 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,736 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,736 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,736 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,736 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,736 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,737 INFO L263 TraceCheckUtils]: 11: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,737 INFO L280 TraceCheckUtils]: 12: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,738 INFO L280 TraceCheckUtils]: 13: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,739 INFO L280 TraceCheckUtils]: 14: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,740 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 12:16:43,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:43,742 INFO L280 TraceCheckUtils]: 17: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:43,743 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,744 INFO L280 TraceCheckUtils]: 19: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-08 12:16:43,745 INFO L280 TraceCheckUtils]: 20: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-08 12:16:43,746 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,747 INFO L280 TraceCheckUtils]: 22: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-08 12:16:43,748 INFO L280 TraceCheckUtils]: 23: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-08 12:16:43,750 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,751 INFO L280 TraceCheckUtils]: 25: Hoare triple {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-08 12:16:43,752 INFO L280 TraceCheckUtils]: 26: Hoare triple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-08 12:16:43,753 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1198#true} #32#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-08 12:16:43,755 INFO L280 TraceCheckUtils]: 0: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,756 INFO L263 TraceCheckUtils]: 2: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,756 INFO L280 TraceCheckUtils]: 3: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,756 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,756 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,756 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,757 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,757 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,757 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,757 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,757 INFO L263 TraceCheckUtils]: 11: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,758 INFO L280 TraceCheckUtils]: 12: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,758 INFO L280 TraceCheckUtils]: 13: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,758 INFO L263 TraceCheckUtils]: 14: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,758 INFO L280 TraceCheckUtils]: 15: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,759 INFO L280 TraceCheckUtils]: 16: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,760 INFO L280 TraceCheckUtils]: 17: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,761 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 12:16:43,762 INFO L280 TraceCheckUtils]: 19: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:43,763 INFO L280 TraceCheckUtils]: 20: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:43,764 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,765 INFO L280 TraceCheckUtils]: 22: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-08 12:16:43,765 INFO L280 TraceCheckUtils]: 23: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-08 12:16:43,767 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,768 INFO L280 TraceCheckUtils]: 25: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-08 12:16:43,769 INFO L280 TraceCheckUtils]: 26: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-08 12:16:43,770 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,771 INFO L280 TraceCheckUtils]: 28: Hoare triple {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-08 12:16:43,772 INFO L280 TraceCheckUtils]: 29: Hoare triple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-08 12:16:43,773 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1198#true} #32#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-08 12:16:43,774 INFO L280 TraceCheckUtils]: 31: Hoare triple {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-08 12:16:43,775 INFO L280 TraceCheckUtils]: 32: Hoare triple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-08 12:16:43,776 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1198#true} #30#return; {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} is VALID [2020-07-08 12:16:43,778 INFO L263 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2020-07-08 12:16:43,779 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume true; {1198#true} is VALID [2020-07-08 12:16:43,779 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1198#true} {1198#true} #26#return; {1198#true} is VALID [2020-07-08 12:16:43,779 INFO L263 TraceCheckUtils]: 3: Hoare triple {1198#true} call #t~ret2 := main(); {1198#true} is VALID [2020-07-08 12:16:43,779 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} ~input~0 := 5; {1198#true} is VALID [2020-07-08 12:16:43,779 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret1 := id(~input~0); {1198#true} is VALID [2020-07-08 12:16:43,780 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,780 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,780 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,780 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,780 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,780 INFO L263 TraceCheckUtils]: 11: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,781 INFO L280 TraceCheckUtils]: 12: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,781 INFO L280 TraceCheckUtils]: 13: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,781 INFO L263 TraceCheckUtils]: 14: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,781 INFO L280 TraceCheckUtils]: 15: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,781 INFO L280 TraceCheckUtils]: 16: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,782 INFO L263 TraceCheckUtils]: 17: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,782 INFO L280 TraceCheckUtils]: 18: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,782 INFO L280 TraceCheckUtils]: 19: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:43,782 INFO L263 TraceCheckUtils]: 20: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:43,783 INFO L280 TraceCheckUtils]: 21: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:43,783 INFO L280 TraceCheckUtils]: 22: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,784 INFO L280 TraceCheckUtils]: 23: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:43,785 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 12:16:43,786 INFO L280 TraceCheckUtils]: 25: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:43,787 INFO L280 TraceCheckUtils]: 26: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:43,788 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,789 INFO L280 TraceCheckUtils]: 28: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-08 12:16:43,790 INFO L280 TraceCheckUtils]: 29: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-08 12:16:43,790 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,791 INFO L280 TraceCheckUtils]: 31: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-08 12:16:43,792 INFO L280 TraceCheckUtils]: 32: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-08 12:16:43,793 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-08 12:16:43,794 INFO L280 TraceCheckUtils]: 34: Hoare triple {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-08 12:16:43,795 INFO L280 TraceCheckUtils]: 35: Hoare triple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-08 12:16:43,796 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1198#true} #32#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-08 12:16:43,797 INFO L280 TraceCheckUtils]: 37: Hoare triple {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-08 12:16:43,798 INFO L280 TraceCheckUtils]: 38: Hoare triple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-08 12:16:43,799 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1198#true} #30#return; {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} is VALID [2020-07-08 12:16:43,800 INFO L280 TraceCheckUtils]: 40: Hoare triple {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {1237#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-08 12:16:43,801 INFO L280 TraceCheckUtils]: 41: Hoare triple {1237#(and (< 4 main_~result~0) (<= main_~result~0 5))} assume 5 != ~result~0; {1199#false} is VALID [2020-07-08 12:16:43,802 INFO L280 TraceCheckUtils]: 42: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2020-07-08 12:16:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-08 12:16:43,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546807960] [2020-07-08 12:16:43,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488128082] [2020-07-08 12:16:43,807 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:43,844 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-08 12:16:43,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:16:43,846 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-08 12:16:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:43,859 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:16:44,068 INFO L263 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2020-07-08 12:16:44,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {1198#true} assume true; {1198#true} is VALID [2020-07-08 12:16:44,069 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1198#true} {1198#true} #26#return; {1198#true} is VALID [2020-07-08 12:16:44,069 INFO L263 TraceCheckUtils]: 3: Hoare triple {1198#true} call #t~ret2 := main(); {1198#true} is VALID [2020-07-08 12:16:44,070 INFO L280 TraceCheckUtils]: 4: Hoare triple {1198#true} ~input~0 := 5; {1198#true} is VALID [2020-07-08 12:16:44,070 INFO L263 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~ret1 := id(~input~0); {1198#true} is VALID [2020-07-08 12:16:44,070 INFO L280 TraceCheckUtils]: 6: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:44,070 INFO L280 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:44,071 INFO L263 TraceCheckUtils]: 8: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:44,071 INFO L280 TraceCheckUtils]: 9: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:44,071 INFO L280 TraceCheckUtils]: 10: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:44,071 INFO L263 TraceCheckUtils]: 11: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:44,072 INFO L280 TraceCheckUtils]: 12: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:44,072 INFO L280 TraceCheckUtils]: 13: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:44,072 INFO L263 TraceCheckUtils]: 14: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:44,072 INFO L280 TraceCheckUtils]: 15: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:44,072 INFO L280 TraceCheckUtils]: 16: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:44,073 INFO L263 TraceCheckUtils]: 17: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:44,073 INFO L280 TraceCheckUtils]: 18: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:44,073 INFO L280 TraceCheckUtils]: 19: Hoare triple {1198#true} assume !(0 == ~x); {1198#true} is VALID [2020-07-08 12:16:44,073 INFO L263 TraceCheckUtils]: 20: Hoare triple {1198#true} call #t~ret0 := id(~x - 1); {1198#true} is VALID [2020-07-08 12:16:44,074 INFO L280 TraceCheckUtils]: 21: Hoare triple {1198#true} ~x := #in~x; {1198#true} is VALID [2020-07-08 12:16:44,075 INFO L280 TraceCheckUtils]: 22: Hoare triple {1198#true} assume 0 == ~x;#res := 0; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:44,075 INFO L280 TraceCheckUtils]: 23: Hoare triple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-08 12:16:44,077 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1328#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {1198#true} #32#return; {1326#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 12:16:44,077 INFO L280 TraceCheckUtils]: 25: Hoare triple {1326#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:44,078 INFO L280 TraceCheckUtils]: 26: Hoare triple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} assume true; {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} is VALID [2020-07-08 12:16:44,080 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1327#(and (<= 1 |id_#res|) (<= |id_#res| 1))} {1198#true} #32#return; {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} is VALID [2020-07-08 12:16:44,082 INFO L280 TraceCheckUtils]: 28: Hoare triple {1320#(and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-08 12:16:44,084 INFO L280 TraceCheckUtils]: 29: Hoare triple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} assume true; {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} is VALID [2020-07-08 12:16:44,085 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1321#(and (<= |id_#res| 2) (<= 2 |id_#res|))} {1198#true} #32#return; {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} is VALID [2020-07-08 12:16:44,091 INFO L280 TraceCheckUtils]: 31: Hoare triple {1308#(and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-08 12:16:44,093 INFO L280 TraceCheckUtils]: 32: Hoare triple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} assume true; {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} is VALID [2020-07-08 12:16:44,094 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1309#(and (<= |id_#res| 3) (<= 3 |id_#res|))} {1198#true} #32#return; {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} is VALID [2020-07-08 12:16:44,096 INFO L280 TraceCheckUtils]: 34: Hoare triple {1290#(and (<= |id_#t~ret0| 3) (<= 3 |id_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-08 12:16:44,099 INFO L280 TraceCheckUtils]: 35: Hoare triple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} assume true; {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} is VALID [2020-07-08 12:16:44,100 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1291#(and (<= |id_#res| 4) (<= 4 |id_#res|))} {1198#true} #32#return; {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} is VALID [2020-07-08 12:16:44,102 INFO L280 TraceCheckUtils]: 37: Hoare triple {1266#(and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-08 12:16:44,103 INFO L280 TraceCheckUtils]: 38: Hoare triple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} assume true; {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} is VALID [2020-07-08 12:16:44,104 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1267#(and (<= 5 |id_#res|) (<= |id_#res| 5))} {1198#true} #30#return; {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} is VALID [2020-07-08 12:16:44,105 INFO L280 TraceCheckUtils]: 40: Hoare triple {1236#(and (<= 5 |main_#t~ret1|) (<= |main_#t~ret1| 5))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {1237#(and (< 4 main_~result~0) (<= main_~result~0 5))} is VALID [2020-07-08 12:16:44,107 INFO L280 TraceCheckUtils]: 41: Hoare triple {1237#(and (< 4 main_~result~0) (<= main_~result~0 5))} assume 5 != ~result~0; {1199#false} is VALID [2020-07-08 12:16:44,107 INFO L280 TraceCheckUtils]: 42: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2020-07-08 12:16:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-08 12:16:44,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:16:44,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2020-07-08 12:16:44,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485918495] [2020-07-08 12:16:44,116 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2020-07-08 12:16:44,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:16:44,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 12:16:44,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:16:44,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 12:16:44,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:16:44,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 12:16:44,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-08 12:16:44,162 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2020-07-08 12:16:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:44,713 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-07-08 12:16:44,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 12:16:44,714 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2020-07-08 12:16:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:16:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:16:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2020-07-08 12:16:44,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:16:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2020-07-08 12:16:44,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 38 transitions. [2020-07-08 12:16:44,773 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 12:16:44,775 INFO L225 Difference]: With dead ends: 37 [2020-07-08 12:16:44,775 INFO L226 Difference]: Without dead ends: 33 [2020-07-08 12:16:44,776 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-08 12:16:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-08 12:16:44,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-08 12:16:44,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:16:44,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-08 12:16:44,785 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 12:16:44,786 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 12:16:44,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:44,788 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-08 12:16:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-08 12:16:44,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:44,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:44,790 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 12:16:44,790 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 12:16:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:44,792 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-08 12:16:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-08 12:16:44,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:44,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:44,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:16:44,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:16:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-08 12:16:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-08 12:16:44,796 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-07-08 12:16:44,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:16:44,796 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-08 12:16:44,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 12:16:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-08 12:16:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-08 12:16:44,798 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:16:44,798 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:16:45,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-08 12:16:45,013 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:16:45,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:16:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2020-07-08 12:16:45,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:16:45,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621564678] [2020-07-08 12:16:45,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:16:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:45,055 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} assume true; {1607#true} is VALID [2020-07-08 12:16:45,056 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1607#true} {1607#true} #26#return; {1607#true} is VALID [2020-07-08 12:16:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:45,243 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,244 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,245 INFO L280 TraceCheckUtils]: 2: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,246 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,247 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,248 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,249 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,249 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,250 INFO L280 TraceCheckUtils]: 5: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,251 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,251 INFO L280 TraceCheckUtils]: 7: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,257 INFO L280 TraceCheckUtils]: 8: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,259 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,261 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,263 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,264 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,264 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,265 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,269 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,272 INFO L280 TraceCheckUtils]: 8: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,273 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,273 INFO L280 TraceCheckUtils]: 10: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,274 INFO L280 TraceCheckUtils]: 11: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,275 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,276 INFO L280 TraceCheckUtils]: 13: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,276 INFO L280 TraceCheckUtils]: 14: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,278 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,279 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,280 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,281 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,281 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,281 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,282 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,282 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,282 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,283 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,283 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,283 INFO L280 TraceCheckUtils]: 11: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,284 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,285 INFO L280 TraceCheckUtils]: 13: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,287 INFO L280 TraceCheckUtils]: 14: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,289 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,290 INFO L280 TraceCheckUtils]: 16: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,293 INFO L280 TraceCheckUtils]: 17: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,295 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,296 INFO L280 TraceCheckUtils]: 19: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,298 INFO L280 TraceCheckUtils]: 20: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,300 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,302 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,302 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,303 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,303 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,304 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,304 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,305 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,305 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,306 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,306 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,307 INFO L263 TraceCheckUtils]: 11: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,307 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,308 INFO L280 TraceCheckUtils]: 13: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,309 INFO L280 TraceCheckUtils]: 14: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,310 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,310 INFO L280 TraceCheckUtils]: 16: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,311 INFO L280 TraceCheckUtils]: 17: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,312 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,313 INFO L280 TraceCheckUtils]: 19: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,314 INFO L280 TraceCheckUtils]: 20: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,315 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,316 INFO L280 TraceCheckUtils]: 22: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,316 INFO L280 TraceCheckUtils]: 23: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,317 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,318 INFO L280 TraceCheckUtils]: 25: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,318 INFO L280 TraceCheckUtils]: 26: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,320 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-08 12:16:45,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,322 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,323 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,323 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,323 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,324 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,324 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,325 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,325 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,326 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,326 INFO L263 TraceCheckUtils]: 11: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,327 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,327 INFO L280 TraceCheckUtils]: 13: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,327 INFO L263 TraceCheckUtils]: 14: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,328 INFO L280 TraceCheckUtils]: 15: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,329 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,329 INFO L280 TraceCheckUtils]: 17: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,331 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,331 INFO L280 TraceCheckUtils]: 19: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,332 INFO L280 TraceCheckUtils]: 20: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,333 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,334 INFO L280 TraceCheckUtils]: 22: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,334 INFO L280 TraceCheckUtils]: 23: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,336 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,336 INFO L280 TraceCheckUtils]: 25: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,337 INFO L280 TraceCheckUtils]: 26: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,338 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,339 INFO L280 TraceCheckUtils]: 28: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,340 INFO L280 TraceCheckUtils]: 29: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,341 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-08 12:16:45,342 INFO L280 TraceCheckUtils]: 31: Hoare triple {1716#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-08 12:16:45,342 INFO L280 TraceCheckUtils]: 32: Hoare triple {1716#(<= 5 |id_#in~x|)} assume true; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-08 12:16:45,344 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1716#(<= 5 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-08 12:16:45,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,347 INFO L263 TraceCheckUtils]: 2: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,348 INFO L280 TraceCheckUtils]: 4: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,348 INFO L263 TraceCheckUtils]: 5: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,349 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,349 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,349 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,350 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,351 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,351 INFO L263 TraceCheckUtils]: 11: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,351 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,352 INFO L280 TraceCheckUtils]: 13: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,352 INFO L263 TraceCheckUtils]: 14: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,353 INFO L280 TraceCheckUtils]: 15: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,353 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,353 INFO L263 TraceCheckUtils]: 17: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,354 INFO L280 TraceCheckUtils]: 18: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,355 INFO L280 TraceCheckUtils]: 19: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,355 INFO L280 TraceCheckUtils]: 20: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,357 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,357 INFO L280 TraceCheckUtils]: 22: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,358 INFO L280 TraceCheckUtils]: 23: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,359 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,360 INFO L280 TraceCheckUtils]: 25: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,360 INFO L280 TraceCheckUtils]: 26: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,362 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,362 INFO L280 TraceCheckUtils]: 28: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,363 INFO L280 TraceCheckUtils]: 29: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,364 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,365 INFO L280 TraceCheckUtils]: 31: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,365 INFO L280 TraceCheckUtils]: 32: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,367 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-08 12:16:45,368 INFO L280 TraceCheckUtils]: 34: Hoare triple {1716#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-08 12:16:45,369 INFO L280 TraceCheckUtils]: 35: Hoare triple {1716#(<= 5 |id_#in~x|)} assume true; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-08 12:16:45,370 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1716#(<= 5 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-08 12:16:45,371 INFO L280 TraceCheckUtils]: 37: Hoare triple {1687#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-08 12:16:45,371 INFO L280 TraceCheckUtils]: 38: Hoare triple {1687#(<= 6 |id_#in~x|)} assume true; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-08 12:16:45,372 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1687#(<= 6 |id_#in~x|)} {1611#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #30#return; {1608#false} is VALID [2020-07-08 12:16:45,374 INFO L263 TraceCheckUtils]: 0: Hoare triple {1607#true} call ULTIMATE.init(); {1607#true} is VALID [2020-07-08 12:16:45,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {1607#true} assume true; {1607#true} is VALID [2020-07-08 12:16:45,374 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1607#true} {1607#true} #26#return; {1607#true} is VALID [2020-07-08 12:16:45,375 INFO L263 TraceCheckUtils]: 3: Hoare triple {1607#true} call #t~ret2 := main(); {1607#true} is VALID [2020-07-08 12:16:45,376 INFO L280 TraceCheckUtils]: 4: Hoare triple {1607#true} ~input~0 := 5; {1611#(and (<= main_~input~0 5) (<= 5 main_~input~0))} is VALID [2020-07-08 12:16:45,376 INFO L263 TraceCheckUtils]: 5: Hoare triple {1611#(and (<= main_~input~0 5) (<= 5 main_~input~0))} call #t~ret1 := id(~input~0); {1607#true} is VALID [2020-07-08 12:16:45,376 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,377 INFO L280 TraceCheckUtils]: 7: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,377 INFO L263 TraceCheckUtils]: 8: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,378 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,378 INFO L280 TraceCheckUtils]: 10: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,379 INFO L263 TraceCheckUtils]: 11: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,379 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,380 INFO L280 TraceCheckUtils]: 13: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,380 INFO L263 TraceCheckUtils]: 14: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,380 INFO L280 TraceCheckUtils]: 15: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,381 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,381 INFO L263 TraceCheckUtils]: 17: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,382 INFO L280 TraceCheckUtils]: 18: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,382 INFO L280 TraceCheckUtils]: 19: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,383 INFO L263 TraceCheckUtils]: 20: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,383 INFO L280 TraceCheckUtils]: 21: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,384 INFO L280 TraceCheckUtils]: 22: Hoare triple {1652#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,384 INFO L263 TraceCheckUtils]: 23: Hoare triple {1652#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,384 INFO L280 TraceCheckUtils]: 24: Hoare triple {1607#true} ~x := #in~x; {1652#(= |id_#in~x| id_~x)} is VALID [2020-07-08 12:16:45,385 INFO L280 TraceCheckUtils]: 25: Hoare triple {1652#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,386 INFO L280 TraceCheckUtils]: 26: Hoare triple {1773#(= 0 |id_#in~x|)} assume true; {1773#(= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,387 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1773#(= 0 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,387 INFO L280 TraceCheckUtils]: 28: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,388 INFO L280 TraceCheckUtils]: 29: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,390 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,390 INFO L280 TraceCheckUtils]: 31: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,391 INFO L280 TraceCheckUtils]: 32: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,392 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,393 INFO L280 TraceCheckUtils]: 34: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,394 INFO L280 TraceCheckUtils]: 35: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,395 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,396 INFO L280 TraceCheckUtils]: 37: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,396 INFO L280 TraceCheckUtils]: 38: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,398 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-08 12:16:45,398 INFO L280 TraceCheckUtils]: 40: Hoare triple {1716#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-08 12:16:45,399 INFO L280 TraceCheckUtils]: 41: Hoare triple {1716#(<= 5 |id_#in~x|)} assume true; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-08 12:16:45,400 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1716#(<= 5 |id_#in~x|)} {1652#(= |id_#in~x| id_~x)} #32#return; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-08 12:16:45,401 INFO L280 TraceCheckUtils]: 43: Hoare triple {1687#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-08 12:16:45,401 INFO L280 TraceCheckUtils]: 44: Hoare triple {1687#(<= 6 |id_#in~x|)} assume true; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-08 12:16:45,402 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1687#(<= 6 |id_#in~x|)} {1611#(and (<= main_~input~0 5) (<= 5 main_~input~0))} #30#return; {1608#false} is VALID [2020-07-08 12:16:45,402 INFO L280 TraceCheckUtils]: 46: Hoare triple {1608#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {1608#false} is VALID [2020-07-08 12:16:45,403 INFO L280 TraceCheckUtils]: 47: Hoare triple {1608#false} assume 5 != ~result~0; {1608#false} is VALID [2020-07-08 12:16:45,403 INFO L280 TraceCheckUtils]: 48: Hoare triple {1608#false} assume !false; {1608#false} is VALID [2020-07-08 12:16:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-07-08 12:16:45,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621564678] [2020-07-08 12:16:45,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374191868] [2020-07-08 12:16:45,406 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:45,442 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-08 12:16:45,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:16:45,444 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-08 12:16:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:16:45,456 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:16:45,706 INFO L263 TraceCheckUtils]: 0: Hoare triple {1607#true} call ULTIMATE.init(); {1607#true} is VALID [2020-07-08 12:16:45,706 INFO L280 TraceCheckUtils]: 1: Hoare triple {1607#true} assume true; {1607#true} is VALID [2020-07-08 12:16:45,706 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1607#true} {1607#true} #26#return; {1607#true} is VALID [2020-07-08 12:16:45,706 INFO L263 TraceCheckUtils]: 3: Hoare triple {1607#true} call #t~ret2 := main(); {1607#true} is VALID [2020-07-08 12:16:45,707 INFO L280 TraceCheckUtils]: 4: Hoare triple {1607#true} ~input~0 := 5; {1789#(<= main_~input~0 5)} is VALID [2020-07-08 12:16:45,707 INFO L263 TraceCheckUtils]: 5: Hoare triple {1789#(<= main_~input~0 5)} call #t~ret1 := id(~input~0); {1607#true} is VALID [2020-07-08 12:16:45,708 INFO L280 TraceCheckUtils]: 6: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-08 12:16:45,708 INFO L280 TraceCheckUtils]: 7: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-08 12:16:45,709 INFO L263 TraceCheckUtils]: 8: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,709 INFO L280 TraceCheckUtils]: 9: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-08 12:16:45,710 INFO L280 TraceCheckUtils]: 10: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-08 12:16:45,710 INFO L263 TraceCheckUtils]: 11: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,711 INFO L280 TraceCheckUtils]: 12: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-08 12:16:45,711 INFO L280 TraceCheckUtils]: 13: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-08 12:16:45,711 INFO L263 TraceCheckUtils]: 14: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,712 INFO L280 TraceCheckUtils]: 15: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-08 12:16:45,712 INFO L280 TraceCheckUtils]: 16: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-08 12:16:45,713 INFO L263 TraceCheckUtils]: 17: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,713 INFO L280 TraceCheckUtils]: 18: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-08 12:16:45,714 INFO L280 TraceCheckUtils]: 19: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-08 12:16:45,714 INFO L263 TraceCheckUtils]: 20: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,715 INFO L280 TraceCheckUtils]: 21: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-08 12:16:45,715 INFO L280 TraceCheckUtils]: 22: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume !(0 == ~x); {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-08 12:16:45,715 INFO L263 TraceCheckUtils]: 23: Hoare triple {1796#(<= id_~x |id_#in~x|)} call #t~ret0 := id(~x - 1); {1607#true} is VALID [2020-07-08 12:16:45,716 INFO L280 TraceCheckUtils]: 24: Hoare triple {1607#true} ~x := #in~x; {1796#(<= id_~x |id_#in~x|)} is VALID [2020-07-08 12:16:45,716 INFO L280 TraceCheckUtils]: 25: Hoare triple {1796#(<= id_~x |id_#in~x|)} assume 0 == ~x;#res := 0; {1854#(<= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,717 INFO L280 TraceCheckUtils]: 26: Hoare triple {1854#(<= 0 |id_#in~x|)} assume true; {1854#(<= 0 |id_#in~x|)} is VALID [2020-07-08 12:16:45,718 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1854#(<= 0 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,719 INFO L280 TraceCheckUtils]: 28: Hoare triple {1772#(<= 1 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,719 INFO L280 TraceCheckUtils]: 29: Hoare triple {1772#(<= 1 |id_#in~x|)} assume true; {1772#(<= 1 |id_#in~x|)} is VALID [2020-07-08 12:16:45,721 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1772#(<= 1 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,721 INFO L280 TraceCheckUtils]: 31: Hoare triple {1767#(<= 2 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,722 INFO L280 TraceCheckUtils]: 32: Hoare triple {1767#(<= 2 |id_#in~x|)} assume true; {1767#(<= 2 |id_#in~x|)} is VALID [2020-07-08 12:16:45,723 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1767#(<= 2 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,724 INFO L280 TraceCheckUtils]: 34: Hoare triple {1756#(<= 3 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,725 INFO L280 TraceCheckUtils]: 35: Hoare triple {1756#(<= 3 |id_#in~x|)} assume true; {1756#(<= 3 |id_#in~x|)} is VALID [2020-07-08 12:16:45,726 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1756#(<= 3 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,726 INFO L280 TraceCheckUtils]: 37: Hoare triple {1739#(<= 4 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,727 INFO L280 TraceCheckUtils]: 38: Hoare triple {1739#(<= 4 |id_#in~x|)} assume true; {1739#(<= 4 |id_#in~x|)} is VALID [2020-07-08 12:16:45,728 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1739#(<= 4 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-08 12:16:45,729 INFO L280 TraceCheckUtils]: 40: Hoare triple {1716#(<= 5 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-08 12:16:45,729 INFO L280 TraceCheckUtils]: 41: Hoare triple {1716#(<= 5 |id_#in~x|)} assume true; {1716#(<= 5 |id_#in~x|)} is VALID [2020-07-08 12:16:45,731 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1716#(<= 5 |id_#in~x|)} {1796#(<= id_~x |id_#in~x|)} #32#return; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-08 12:16:45,731 INFO L280 TraceCheckUtils]: 43: Hoare triple {1687#(<= 6 |id_#in~x|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-08 12:16:45,732 INFO L280 TraceCheckUtils]: 44: Hoare triple {1687#(<= 6 |id_#in~x|)} assume true; {1687#(<= 6 |id_#in~x|)} is VALID [2020-07-08 12:16:45,733 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1687#(<= 6 |id_#in~x|)} {1789#(<= main_~input~0 5)} #30#return; {1608#false} is VALID [2020-07-08 12:16:45,733 INFO L280 TraceCheckUtils]: 46: Hoare triple {1608#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; {1608#false} is VALID [2020-07-08 12:16:45,733 INFO L280 TraceCheckUtils]: 47: Hoare triple {1608#false} assume 5 != ~result~0; {1608#false} is VALID [2020-07-08 12:16:45,733 INFO L280 TraceCheckUtils]: 48: Hoare triple {1608#false} assume !false; {1608#false} is VALID [2020-07-08 12:16:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-07-08 12:16:45,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:16:45,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 14 [2020-07-08 12:16:45,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253792395] [2020-07-08 12:16:45,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-07-08 12:16:45,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:16:45,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:16:45,778 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 12:16:45,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:16:45,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:16:45,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:16:45,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:16:45,779 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-07-08 12:16:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:46,080 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-08 12:16:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:16:46,081 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-07-08 12:16:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:16:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:16:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2020-07-08 12:16:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:16:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2020-07-08 12:16:46,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 34 transitions. [2020-07-08 12:16:46,124 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 12:16:46,125 INFO L225 Difference]: With dead ends: 33 [2020-07-08 12:16:46,125 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:16:46,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2020-07-08 12:16:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:16:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:16:46,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:16:46,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:16:46,127 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:16:46,127 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:16:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:46,127 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:16:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:16:46,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:46,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:46,128 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:16:46,128 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:16:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:16:46,128 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:16:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:16:46,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:46,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:16:46,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:16:46,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:16:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:16:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:16:46,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2020-07-08 12:16:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:16:46,130 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:16:46,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:16:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:16:46,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:16:46,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:16:46,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:16:46,383 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:16:46,383 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:16:46,383 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:16:46,384 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:16:46,384 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:16:46,384 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:16:46,384 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2020-07-08 12:16:46,384 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-07-08 12:16:46,384 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 9 15) no Hoare annotation was computed. [2020-07-08 12:16:46,384 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-08 12:16:46,384 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-07-08 12:16:46,385 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-07-08 12:16:46,385 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-08 12:16:46,385 INFO L268 CegarLoopResult]: For program point L12-2(lines 9 15) no Hoare annotation was computed. [2020-07-08 12:16:46,385 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2020-07-08 12:16:46,385 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2020-07-08 12:16:46,385 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-07-08 12:16:46,385 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-08 12:16:46,385 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-08 12:16:46,385 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-07-08 12:16:46,389 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:16:46,390 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:16:46,390 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:16:46,390 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:16:46,390 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 12:16:46,390 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:16:46,391 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:16:46,391 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:16:46,391 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 12:16:46,391 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-08 12:16:46,391 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-08 12:16:46,391 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-08 12:16:46,391 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-08 12:16:46,391 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-08 12:16:46,391 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-08 12:16:46,392 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-08 12:16:46,392 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:16:46,392 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:16:46,392 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-08 12:16:46,392 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:16:46,392 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:16:46,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:16:46 BoogieIcfgContainer [2020-07-08 12:16:46,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:16:46,397 INFO L168 Benchmark]: Toolchain (without parser) took 8777.45 ms. Allocated memory was 136.8 MB in the beginning and 315.1 MB in the end (delta: 178.3 MB). Free memory was 101.4 MB in the beginning and 167.4 MB in the end (delta: -66.0 MB). Peak memory consumption was 112.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:16:46,398 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:16:46,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.80 ms. Allocated memory is still 136.8 MB. Free memory was 101.2 MB in the beginning and 91.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:16:46,399 INFO L168 Benchmark]: Boogie Preprocessor took 28.39 ms. Allocated memory is still 136.8 MB. Free memory was 91.9 MB in the beginning and 90.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:16:46,400 INFO L168 Benchmark]: RCFGBuilder took 375.63 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 90.5 MB in the beginning and 166.1 MB in the end (delta: -75.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:16:46,400 INFO L168 Benchmark]: TraceAbstraction took 8078.41 ms. Allocated memory was 200.8 MB in the beginning and 315.1 MB in the end (delta: 114.3 MB). Free memory was 166.1 MB in the beginning and 167.4 MB in the end (delta: -1.3 MB). Peak memory consumption was 113.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:16:46,403 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.25 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 288.80 ms. Allocated memory is still 136.8 MB. Free memory was 101.2 MB in the beginning and 91.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.39 ms. Allocated memory is still 136.8 MB. Free memory was 91.9 MB in the beginning and 90.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 375.63 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 90.5 MB in the beginning and 166.1 MB in the end (delta: -75.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8078.41 ms. Allocated memory was 200.8 MB in the beginning and 315.1 MB in the end (delta: 114.3 MB). Free memory was 166.1 MB in the beginning and 167.4 MB in the end (delta: -1.3 MB). Peak memory consumption was 113.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.9s, OverallIterations: 7, TraceHistogramMax: 7, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 115 SDtfs, 78 SDslu, 549 SDs, 0 SdLazy, 276 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 261 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 15 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 421 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 38256 SizeOfPredicates, 27 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 396/588 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...