/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007b.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 06:38:40,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 06:38:40,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 06:38:40,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 06:38:40,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 06:38:40,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 06:38:40,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 06:38:40,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 06:38:40,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 06:38:40,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 06:38:40,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 06:38:40,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 06:38:40,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 06:38:40,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 06:38:40,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 06:38:40,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 06:38:40,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 06:38:40,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 06:38:40,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 06:38:40,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 06:38:40,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 06:38:40,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 06:38:40,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 06:38:40,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 06:38:40,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 06:38:40,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 06:38:40,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 06:38:40,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 06:38:40,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 06:38:40,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 06:38:40,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 06:38:40,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 06:38:40,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 06:38:40,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 06:38:40,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 06:38:40,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 06:38:40,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 06:38:40,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 06:38:40,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 06:38:40,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 06:38:40,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 06:38:40,164 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 06:38:40,173 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 06:38:40,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 06:38:40,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 06:38:40,175 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 06:38:40,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 06:38:40,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 06:38:40,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 06:38:40,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 06:38:40,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 06:38:40,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 06:38:40,176 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 06:38:40,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 06:38:40,176 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 06:38:40,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 06:38:40,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 06:38:40,177 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 06:38:40,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 06:38:40,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 06:38:40,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 06:38:40,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 06:38:40,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 06:38:40,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 06:38:40,178 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 06:38:40,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 06:38:40,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 06:38:40,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 06:38:40,460 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 06:38:40,460 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 06:38:40,461 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b.i [2020-07-18 06:38:40,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11cd5e523/eae97869e0814395b0583db2d4b8c55a/FLAG6d71541c7 [2020-07-18 06:38:41,015 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 06:38:41,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i [2020-07-18 06:38:41,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11cd5e523/eae97869e0814395b0583db2d4b8c55a/FLAG6d71541c7 [2020-07-18 06:38:41,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11cd5e523/eae97869e0814395b0583db2d4b8c55a [2020-07-18 06:38:41,455 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 06:38:41,458 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 06:38:41,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 06:38:41,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 06:38:41,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 06:38:41,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:38:41" (1/1) ... [2020-07-18 06:38:41,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32524559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:41, skipping insertion in model container [2020-07-18 06:38:41,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:38:41" (1/1) ... [2020-07-18 06:38:41,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 06:38:41,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 06:38:41,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:38:41,672 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 06:38:41,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:38:41,705 INFO L208 MainTranslator]: Completed translation [2020-07-18 06:38:41,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:41 WrapperNode [2020-07-18 06:38:41,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 06:38:41,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 06:38:41,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 06:38:41,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 06:38:41,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:41" (1/1) ... [2020-07-18 06:38:41,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:41" (1/1) ... [2020-07-18 06:38:41,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:41" (1/1) ... [2020-07-18 06:38:41,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:41" (1/1) ... [2020-07-18 06:38:41,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:41" (1/1) ... [2020-07-18 06:38:41,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:41" (1/1) ... [2020-07-18 06:38:41,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:41" (1/1) ... [2020-07-18 06:38:41,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 06:38:41,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 06:38:41,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 06:38:41,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 06:38:41,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:41" (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-18 06:38:41,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 06:38:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 06:38:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 06:38:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 06:38:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 06:38:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 06:38:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 06:38:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 06:38:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 06:38:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 06:38:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 06:38:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 06:38:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 06:38:42,158 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 06:38:42,159 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 06:38:42,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:38:42 BoogieIcfgContainer [2020-07-18 06:38:42,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 06:38:42,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 06:38:42,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 06:38:42,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 06:38:42,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 06:38:41" (1/3) ... [2020-07-18 06:38:42,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64857637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:38:42, skipping insertion in model container [2020-07-18 06:38:42,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:41" (2/3) ... [2020-07-18 06:38:42,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64857637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:38:42, skipping insertion in model container [2020-07-18 06:38:42,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:38:42" (3/3) ... [2020-07-18 06:38:42,175 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007b.i [2020-07-18 06:38:42,188 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 06:38:42,199 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 06:38:42,218 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 06:38:42,246 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 06:38:42,246 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 06:38:42,246 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 06:38:42,246 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 06:38:42,247 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 06:38:42,247 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 06:38:42,250 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 06:38:42,251 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 06:38:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-18 06:38:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-18 06:38:42,302 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:42,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:42,304 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:42,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1007675669, now seen corresponding path program 1 times [2020-07-18 06:38:42,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:42,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1891083946] [2020-07-18 06:38:42,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:42,442 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-18 06:38:42,443 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #57#return; {32#true} is VALID [2020-07-18 06:38:42,445 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-18 06:38:42,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-18 06:38:42,445 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #57#return; {32#true} is VALID [2020-07-18 06:38:42,446 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret2 := main(); {32#true} is VALID [2020-07-18 06:38:42,446 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} ~x~0 := 0; {32#true} is VALID [2020-07-18 06:38:42,446 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} ~m~0 := 0; {32#true} is VALID [2020-07-18 06:38:42,447 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {32#true} is VALID [2020-07-18 06:38:42,447 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} ~n~0 := #t~nondet0; {32#true} is VALID [2020-07-18 06:38:42,448 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#true} havoc #t~nondet0; {32#true} is VALID [2020-07-18 06:38:42,453 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#true} assume !true; {33#false} is VALID [2020-07-18 06:38:42,453 INFO L263 TraceCheckUtils]: 10: Hoare triple {33#false} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {33#false} is VALID [2020-07-18 06:38:42,454 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2020-07-18 06:38:42,454 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2020-07-18 06:38:42,454 INFO L280 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-18 06:38:42,456 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-18 06:38:42,457 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1891083946] [2020-07-18 06:38:42,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:38:42,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 06:38:42,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030558] [2020-07-18 06:38:42,465 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-18 06:38:42,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:42,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 06:38:42,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:42,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 06:38:42,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:42,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 06:38:42,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 06:38:42,534 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-07-18 06:38:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:42,638 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-18 06:38:42,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 06:38:42,638 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-18 06:38:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:38:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-18 06:38:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:38:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-18 06:38:42,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2020-07-18 06:38:42,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:42,755 INFO L225 Difference]: With dead ends: 42 [2020-07-18 06:38:42,755 INFO L226 Difference]: Without dead ends: 24 [2020-07-18 06:38:42,763 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 06:38:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-18 06:38:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-18 06:38:42,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:42,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-18 06:38:42,818 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-18 06:38:42,818 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-18 06:38:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:42,823 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-18 06:38:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-18 06:38:42,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:42,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:42,825 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-18 06:38:42,825 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-18 06:38:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:42,830 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-18 06:38:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-18 06:38:42,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:42,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:42,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:42,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:42,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-18 06:38:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-18 06:38:42,836 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2020-07-18 06:38:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:42,837 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-18 06:38:42,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 06:38:42,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2020-07-18 06:38:42,873 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-18 06:38:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-18 06:38:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-18 06:38:42,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:42,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:42,875 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 06:38:42,876 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:42,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:42,876 INFO L82 PathProgramCache]: Analyzing trace with hash 993822854, now seen corresponding path program 1 times [2020-07-18 06:38:42,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:42,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1552242392] [2020-07-18 06:38:42,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:42,984 INFO L280 TraceCheckUtils]: 0: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-18 06:38:42,985 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {218#true} {218#true} #57#return; {218#true} is VALID [2020-07-18 06:38:42,985 INFO L263 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {218#true} is VALID [2020-07-18 06:38:42,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-18 06:38:42,986 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} #57#return; {218#true} is VALID [2020-07-18 06:38:42,986 INFO L263 TraceCheckUtils]: 3: Hoare triple {218#true} call #t~ret2 := main(); {218#true} is VALID [2020-07-18 06:38:42,986 INFO L280 TraceCheckUtils]: 4: Hoare triple {218#true} ~x~0 := 0; {218#true} is VALID [2020-07-18 06:38:42,988 INFO L280 TraceCheckUtils]: 5: Hoare triple {218#true} ~m~0 := 0; {222#(<= 0 main_~m~0)} is VALID [2020-07-18 06:38:42,989 INFO L280 TraceCheckUtils]: 6: Hoare triple {222#(<= 0 main_~m~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {222#(<= 0 main_~m~0)} is VALID [2020-07-18 06:38:42,990 INFO L280 TraceCheckUtils]: 7: Hoare triple {222#(<= 0 main_~m~0)} ~n~0 := #t~nondet0; {222#(<= 0 main_~m~0)} is VALID [2020-07-18 06:38:42,991 INFO L280 TraceCheckUtils]: 8: Hoare triple {222#(<= 0 main_~m~0)} havoc #t~nondet0; {222#(<= 0 main_~m~0)} is VALID [2020-07-18 06:38:42,992 INFO L280 TraceCheckUtils]: 9: Hoare triple {222#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {222#(<= 0 main_~m~0)} is VALID [2020-07-18 06:38:42,994 INFO L263 TraceCheckUtils]: 10: Hoare triple {222#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {223#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:42,995 INFO L280 TraceCheckUtils]: 11: Hoare triple {223#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {224#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:42,996 INFO L280 TraceCheckUtils]: 12: Hoare triple {224#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {219#false} is VALID [2020-07-18 06:38:42,996 INFO L280 TraceCheckUtils]: 13: Hoare triple {219#false} assume !false; {219#false} is VALID [2020-07-18 06:38:42,998 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-18 06:38:42,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1552242392] [2020-07-18 06:38:42,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:38:42,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 06:38:42,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249496800] [2020-07-18 06:38:43,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-18 06:38:43,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:43,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:38:43,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:43,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:38:43,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:43,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:38:43,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:38:43,024 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2020-07-18 06:38:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:43,235 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-18 06:38:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 06:38:43,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-18 06:38:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:38:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-18 06:38:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:38:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-18 06:38:43,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2020-07-18 06:38:43,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:43,298 INFO L225 Difference]: With dead ends: 39 [2020-07-18 06:38:43,299 INFO L226 Difference]: Without dead ends: 37 [2020-07-18 06:38:43,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-18 06:38:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-18 06:38:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-07-18 06:38:43,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:43,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2020-07-18 06:38:43,335 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2020-07-18 06:38:43,335 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2020-07-18 06:38:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:43,339 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-18 06:38:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-18 06:38:43,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:43,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:43,341 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2020-07-18 06:38:43,341 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2020-07-18 06:38:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:43,345 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-18 06:38:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-18 06:38:43,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:43,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:43,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:43,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-18 06:38:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-07-18 06:38:43,350 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2020-07-18 06:38:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:43,350 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-07-18 06:38:43,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:38:43,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2020-07-18 06:38:43,397 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-18 06:38:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-18 06:38:43,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-18 06:38:43,398 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:43,398 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:43,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 06:38:43,399 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:43,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:43,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1988212296, now seen corresponding path program 1 times [2020-07-18 06:38:43,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:43,400 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [702988715] [2020-07-18 06:38:43,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:43,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 06:38:43,486 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {449#true} {449#true} #57#return; {449#true} is VALID [2020-07-18 06:38:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:43,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-18 06:38:43,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-18 06:38:43,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 06:38:43,498 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {449#true} {454#(<= main_~n~0 0)} #61#return; {454#(<= main_~n~0 0)} is VALID [2020-07-18 06:38:43,498 INFO L263 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {449#true} is VALID [2020-07-18 06:38:43,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 06:38:43,499 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {449#true} {449#true} #57#return; {449#true} is VALID [2020-07-18 06:38:43,499 INFO L263 TraceCheckUtils]: 3: Hoare triple {449#true} call #t~ret2 := main(); {449#true} is VALID [2020-07-18 06:38:43,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#true} ~x~0 := 0; {453#(<= main_~x~0 0)} is VALID [2020-07-18 06:38:43,501 INFO L280 TraceCheckUtils]: 5: Hoare triple {453#(<= main_~x~0 0)} ~m~0 := 0; {453#(<= main_~x~0 0)} is VALID [2020-07-18 06:38:43,502 INFO L280 TraceCheckUtils]: 6: Hoare triple {453#(<= main_~x~0 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {453#(<= main_~x~0 0)} is VALID [2020-07-18 06:38:43,502 INFO L280 TraceCheckUtils]: 7: Hoare triple {453#(<= main_~x~0 0)} ~n~0 := #t~nondet0; {453#(<= main_~x~0 0)} is VALID [2020-07-18 06:38:43,504 INFO L280 TraceCheckUtils]: 8: Hoare triple {453#(<= main_~x~0 0)} havoc #t~nondet0; {453#(<= main_~x~0 0)} is VALID [2020-07-18 06:38:43,505 INFO L280 TraceCheckUtils]: 9: Hoare triple {453#(<= main_~x~0 0)} assume !(~x~0 < ~n~0); {454#(<= main_~n~0 0)} is VALID [2020-07-18 06:38:43,505 INFO L263 TraceCheckUtils]: 10: Hoare triple {454#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {449#true} is VALID [2020-07-18 06:38:43,505 INFO L280 TraceCheckUtils]: 11: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-18 06:38:43,506 INFO L280 TraceCheckUtils]: 12: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-18 06:38:43,506 INFO L280 TraceCheckUtils]: 13: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 06:38:43,507 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {449#true} {454#(<= main_~n~0 0)} #61#return; {454#(<= main_~n~0 0)} is VALID [2020-07-18 06:38:43,509 INFO L263 TraceCheckUtils]: 15: Hoare triple {454#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {459#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:43,509 INFO L280 TraceCheckUtils]: 16: Hoare triple {459#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {460#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:43,510 INFO L280 TraceCheckUtils]: 17: Hoare triple {460#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {450#false} is VALID [2020-07-18 06:38:43,511 INFO L280 TraceCheckUtils]: 18: Hoare triple {450#false} assume !false; {450#false} is VALID [2020-07-18 06:38:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:38:43,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [702988715] [2020-07-18 06:38:43,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:38:43,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 06:38:43,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951241795] [2020-07-18 06:38:43,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-18 06:38:43,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:43,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 06:38:43,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:43,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 06:38:43,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:43,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 06:38:43,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 06:38:43,542 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2020-07-18 06:38:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:43,805 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2020-07-18 06:38:43,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 06:38:43,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-18 06:38:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:38:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-18 06:38:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:38:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-18 06:38:43,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2020-07-18 06:38:43,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:43,872 INFO L225 Difference]: With dead ends: 54 [2020-07-18 06:38:43,872 INFO L226 Difference]: Without dead ends: 42 [2020-07-18 06:38:43,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-18 06:38:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-18 06:38:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-07-18 06:38:43,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:43,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 35 states. [2020-07-18 06:38:43,915 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 35 states. [2020-07-18 06:38:43,916 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 35 states. [2020-07-18 06:38:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:43,919 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-18 06:38:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-18 06:38:43,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:43,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:43,921 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 42 states. [2020-07-18 06:38:43,921 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 42 states. [2020-07-18 06:38:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:43,925 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-18 06:38:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-18 06:38:43,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:43,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:43,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:43,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 06:38:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-18 06:38:43,929 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2020-07-18 06:38:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:43,930 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-18 06:38:43,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 06:38:43,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2020-07-18 06:38:43,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-18 06:38:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-18 06:38:43,985 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:43,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:43,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 06:38:43,986 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:43,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2096508511, now seen corresponding path program 1 times [2020-07-18 06:38:43,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:43,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [484245698] [2020-07-18 06:38:43,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:44,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {729#true} assume true; {729#true} is VALID [2020-07-18 06:38:44,102 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {729#true} {729#true} #57#return; {729#true} is VALID [2020-07-18 06:38:44,102 INFO L263 TraceCheckUtils]: 0: Hoare triple {729#true} call ULTIMATE.init(); {729#true} is VALID [2020-07-18 06:38:44,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {729#true} assume true; {729#true} is VALID [2020-07-18 06:38:44,103 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {729#true} {729#true} #57#return; {729#true} is VALID [2020-07-18 06:38:44,103 INFO L263 TraceCheckUtils]: 3: Hoare triple {729#true} call #t~ret2 := main(); {729#true} is VALID [2020-07-18 06:38:44,104 INFO L280 TraceCheckUtils]: 4: Hoare triple {729#true} ~x~0 := 0; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 06:38:44,105 INFO L280 TraceCheckUtils]: 5: Hoare triple {733#(<= 0 main_~x~0)} ~m~0 := 0; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 06:38:44,106 INFO L280 TraceCheckUtils]: 6: Hoare triple {733#(<= 0 main_~x~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 06:38:44,107 INFO L280 TraceCheckUtils]: 7: Hoare triple {733#(<= 0 main_~x~0)} ~n~0 := #t~nondet0; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 06:38:44,108 INFO L280 TraceCheckUtils]: 8: Hoare triple {733#(<= 0 main_~x~0)} havoc #t~nondet0; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 06:38:44,109 INFO L280 TraceCheckUtils]: 9: Hoare triple {733#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0); {733#(<= 0 main_~x~0)} is VALID [2020-07-18 06:38:44,110 INFO L280 TraceCheckUtils]: 10: Hoare triple {733#(<= 0 main_~x~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 06:38:44,111 INFO L280 TraceCheckUtils]: 11: Hoare triple {733#(<= 0 main_~x~0)} assume 0 != #t~nondet1; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 06:38:44,111 INFO L280 TraceCheckUtils]: 12: Hoare triple {733#(<= 0 main_~x~0)} havoc #t~nondet1; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 06:38:44,112 INFO L280 TraceCheckUtils]: 13: Hoare triple {733#(<= 0 main_~x~0)} ~m~0 := ~x~0; {734#(<= 0 main_~m~0)} is VALID [2020-07-18 06:38:44,113 INFO L280 TraceCheckUtils]: 14: Hoare triple {734#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {734#(<= 0 main_~m~0)} is VALID [2020-07-18 06:38:44,114 INFO L280 TraceCheckUtils]: 15: Hoare triple {734#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {734#(<= 0 main_~m~0)} is VALID [2020-07-18 06:38:44,116 INFO L263 TraceCheckUtils]: 16: Hoare triple {734#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {735#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:44,117 INFO L280 TraceCheckUtils]: 17: Hoare triple {735#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {736#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:44,117 INFO L280 TraceCheckUtils]: 18: Hoare triple {736#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {730#false} is VALID [2020-07-18 06:38:44,124 INFO L280 TraceCheckUtils]: 19: Hoare triple {730#false} assume !false; {730#false} is VALID [2020-07-18 06:38:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:38:44,126 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [484245698] [2020-07-18 06:38:44,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:44,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-18 06:38:44,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801821758] [2020-07-18 06:38:44,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-18 06:38:44,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:44,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 06:38:44,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:44,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 06:38:44,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:44,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 06:38:44,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 06:38:44,159 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2020-07-18 06:38:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:44,381 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2020-07-18 06:38:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 06:38:44,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-18 06:38:44,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:38:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-18 06:38:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:38:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-18 06:38:44,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2020-07-18 06:38:44,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:44,421 INFO L225 Difference]: With dead ends: 41 [2020-07-18 06:38:44,422 INFO L226 Difference]: Without dead ends: 37 [2020-07-18 06:38:44,422 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-18 06:38:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-18 06:38:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2020-07-18 06:38:44,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:44,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 27 states. [2020-07-18 06:38:44,481 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 27 states. [2020-07-18 06:38:44,482 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 27 states. [2020-07-18 06:38:44,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:44,486 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-18 06:38:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-18 06:38:44,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:44,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:44,489 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 37 states. [2020-07-18 06:38:44,489 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 37 states. [2020-07-18 06:38:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:44,494 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-18 06:38:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-18 06:38:44,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:44,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:44,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:44,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-18 06:38:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-18 06:38:44,502 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2020-07-18 06:38:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:44,503 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-18 06:38:44,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 06:38:44,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2020-07-18 06:38:44,536 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-18 06:38:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-18 06:38:44,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-18 06:38:44,537 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:44,537 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:44,537 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 06:38:44,538 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:44,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:44,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1883436929, now seen corresponding path program 1 times [2020-07-18 06:38:44,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:44,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [829501716] [2020-07-18 06:38:44,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:44,650 INFO L280 TraceCheckUtils]: 0: Hoare triple {953#true} assume true; {953#true} is VALID [2020-07-18 06:38:44,651 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {953#true} {953#true} #57#return; {953#true} is VALID [2020-07-18 06:38:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:44,669 INFO L280 TraceCheckUtils]: 0: Hoare triple {953#true} ~cond := #in~cond; {953#true} is VALID [2020-07-18 06:38:44,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {953#true} assume !(0 == ~cond); {953#true} is VALID [2020-07-18 06:38:44,670 INFO L280 TraceCheckUtils]: 2: Hoare triple {953#true} assume true; {953#true} is VALID [2020-07-18 06:38:44,671 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {953#true} {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} #61#return; {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} is VALID [2020-07-18 06:38:44,671 INFO L263 TraceCheckUtils]: 0: Hoare triple {953#true} call ULTIMATE.init(); {953#true} is VALID [2020-07-18 06:38:44,671 INFO L280 TraceCheckUtils]: 1: Hoare triple {953#true} assume true; {953#true} is VALID [2020-07-18 06:38:44,672 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {953#true} {953#true} #57#return; {953#true} is VALID [2020-07-18 06:38:44,672 INFO L263 TraceCheckUtils]: 3: Hoare triple {953#true} call #t~ret2 := main(); {953#true} is VALID [2020-07-18 06:38:44,673 INFO L280 TraceCheckUtils]: 4: Hoare triple {953#true} ~x~0 := 0; {957#(<= 0 main_~x~0)} is VALID [2020-07-18 06:38:44,674 INFO L280 TraceCheckUtils]: 5: Hoare triple {957#(<= 0 main_~x~0)} ~m~0 := 0; {958#(<= main_~m~0 main_~x~0)} is VALID [2020-07-18 06:38:44,674 INFO L280 TraceCheckUtils]: 6: Hoare triple {958#(<= main_~m~0 main_~x~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {958#(<= main_~m~0 main_~x~0)} is VALID [2020-07-18 06:38:44,675 INFO L280 TraceCheckUtils]: 7: Hoare triple {958#(<= main_~m~0 main_~x~0)} ~n~0 := #t~nondet0; {958#(<= main_~m~0 main_~x~0)} is VALID [2020-07-18 06:38:44,675 INFO L280 TraceCheckUtils]: 8: Hoare triple {958#(<= main_~m~0 main_~x~0)} havoc #t~nondet0; {958#(<= main_~m~0 main_~x~0)} is VALID [2020-07-18 06:38:44,677 INFO L280 TraceCheckUtils]: 9: Hoare triple {958#(<= main_~m~0 main_~x~0)} assume !!(~x~0 < ~n~0); {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} is VALID [2020-07-18 06:38:44,677 INFO L280 TraceCheckUtils]: 10: Hoare triple {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} is VALID [2020-07-18 06:38:44,678 INFO L280 TraceCheckUtils]: 11: Hoare triple {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} assume !(0 != #t~nondet1); {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} is VALID [2020-07-18 06:38:44,678 INFO L280 TraceCheckUtils]: 12: Hoare triple {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} havoc #t~nondet1; {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} is VALID [2020-07-18 06:38:44,679 INFO L280 TraceCheckUtils]: 13: Hoare triple {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} ~x~0 := 1 + ~x~0; {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} is VALID [2020-07-18 06:38:44,679 INFO L280 TraceCheckUtils]: 14: Hoare triple {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} assume !(~x~0 < ~n~0); {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} is VALID [2020-07-18 06:38:44,679 INFO L263 TraceCheckUtils]: 15: Hoare triple {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {953#true} is VALID [2020-07-18 06:38:44,680 INFO L280 TraceCheckUtils]: 16: Hoare triple {953#true} ~cond := #in~cond; {953#true} is VALID [2020-07-18 06:38:44,680 INFO L280 TraceCheckUtils]: 17: Hoare triple {953#true} assume !(0 == ~cond); {953#true} is VALID [2020-07-18 06:38:44,680 INFO L280 TraceCheckUtils]: 18: Hoare triple {953#true} assume true; {953#true} is VALID [2020-07-18 06:38:44,685 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {953#true} {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} #61#return; {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} is VALID [2020-07-18 06:38:44,687 INFO L263 TraceCheckUtils]: 20: Hoare triple {959#(or (<= main_~n~0 0) (< main_~m~0 main_~n~0))} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {964#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:44,687 INFO L280 TraceCheckUtils]: 21: Hoare triple {964#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {965#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:44,688 INFO L280 TraceCheckUtils]: 22: Hoare triple {965#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {954#false} is VALID [2020-07-18 06:38:44,688 INFO L280 TraceCheckUtils]: 23: Hoare triple {954#false} assume !false; {954#false} is VALID [2020-07-18 06:38:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:38:44,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [829501716] [2020-07-18 06:38:44,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:44,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 06:38:44,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667602227] [2020-07-18 06:38:44,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-18 06:38:44,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:44,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 06:38:44,739 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-18 06:38:44,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 06:38:44,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:44,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 06:38:44,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 06:38:44,740 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2020-07-18 06:38:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:45,090 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-18 06:38:45,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 06:38:45,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-18 06:38:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:38:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-18 06:38:45,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:38:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-18 06:38:45,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2020-07-18 06:38:45,151 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-18 06:38:45,152 INFO L225 Difference]: With dead ends: 35 [2020-07-18 06:38:45,152 INFO L226 Difference]: Without dead ends: 29 [2020-07-18 06:38:45,153 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-18 06:38:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-18 06:38:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-07-18 06:38:45,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:45,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2020-07-18 06:38:45,228 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2020-07-18 06:38:45,228 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2020-07-18 06:38:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:45,230 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-18 06:38:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-18 06:38:45,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:45,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:45,232 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2020-07-18 06:38:45,232 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2020-07-18 06:38:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:45,234 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-18 06:38:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-18 06:38:45,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:45,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:45,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:45,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 06:38:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-18 06:38:45,237 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-07-18 06:38:45,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:45,237 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-18 06:38:45,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 06:38:45,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2020-07-18 06:38:45,274 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-18 06:38:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-18 06:38:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-18 06:38:45,276 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:45,276 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:45,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 06:38:45,276 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:45,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1649594383, now seen corresponding path program 1 times [2020-07-18 06:38:45,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:45,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1181308186] [2020-07-18 06:38:45,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:45,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {1158#true} assume true; {1158#true} is VALID [2020-07-18 06:38:45,357 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1158#true} {1158#true} #57#return; {1158#true} is VALID [2020-07-18 06:38:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:45,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {1158#true} ~cond := #in~cond; {1158#true} is VALID [2020-07-18 06:38:45,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {1158#true} assume !(0 == ~cond); {1158#true} is VALID [2020-07-18 06:38:45,371 INFO L280 TraceCheckUtils]: 2: Hoare triple {1158#true} assume true; {1158#true} is VALID [2020-07-18 06:38:45,372 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1158#true} {1163#(<= (+ main_~m~0 1) main_~n~0)} #61#return; {1163#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-18 06:38:45,373 INFO L263 TraceCheckUtils]: 0: Hoare triple {1158#true} call ULTIMATE.init(); {1158#true} is VALID [2020-07-18 06:38:45,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {1158#true} assume true; {1158#true} is VALID [2020-07-18 06:38:45,373 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1158#true} {1158#true} #57#return; {1158#true} is VALID [2020-07-18 06:38:45,374 INFO L263 TraceCheckUtils]: 3: Hoare triple {1158#true} call #t~ret2 := main(); {1158#true} is VALID [2020-07-18 06:38:45,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {1158#true} ~x~0 := 0; {1158#true} is VALID [2020-07-18 06:38:45,374 INFO L280 TraceCheckUtils]: 5: Hoare triple {1158#true} ~m~0 := 0; {1158#true} is VALID [2020-07-18 06:38:45,374 INFO L280 TraceCheckUtils]: 6: Hoare triple {1158#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1158#true} is VALID [2020-07-18 06:38:45,375 INFO L280 TraceCheckUtils]: 7: Hoare triple {1158#true} ~n~0 := #t~nondet0; {1158#true} is VALID [2020-07-18 06:38:45,375 INFO L280 TraceCheckUtils]: 8: Hoare triple {1158#true} havoc #t~nondet0; {1158#true} is VALID [2020-07-18 06:38:45,376 INFO L280 TraceCheckUtils]: 9: Hoare triple {1158#true} assume !!(~x~0 < ~n~0); {1162#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2020-07-18 06:38:45,377 INFO L280 TraceCheckUtils]: 10: Hoare triple {1162#(<= (+ main_~x~0 1) main_~n~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1162#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2020-07-18 06:38:45,377 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#(<= (+ main_~x~0 1) main_~n~0)} assume 0 != #t~nondet1; {1162#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2020-07-18 06:38:45,378 INFO L280 TraceCheckUtils]: 12: Hoare triple {1162#(<= (+ main_~x~0 1) main_~n~0)} havoc #t~nondet1; {1162#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2020-07-18 06:38:45,379 INFO L280 TraceCheckUtils]: 13: Hoare triple {1162#(<= (+ main_~x~0 1) main_~n~0)} ~m~0 := ~x~0; {1163#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-18 06:38:45,380 INFO L280 TraceCheckUtils]: 14: Hoare triple {1163#(<= (+ main_~m~0 1) main_~n~0)} ~x~0 := 1 + ~x~0; {1163#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-18 06:38:45,380 INFO L280 TraceCheckUtils]: 15: Hoare triple {1163#(<= (+ main_~m~0 1) main_~n~0)} assume !(~x~0 < ~n~0); {1163#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-18 06:38:45,381 INFO L263 TraceCheckUtils]: 16: Hoare triple {1163#(<= (+ main_~m~0 1) main_~n~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1158#true} is VALID [2020-07-18 06:38:45,381 INFO L280 TraceCheckUtils]: 17: Hoare triple {1158#true} ~cond := #in~cond; {1158#true} is VALID [2020-07-18 06:38:45,381 INFO L280 TraceCheckUtils]: 18: Hoare triple {1158#true} assume !(0 == ~cond); {1158#true} is VALID [2020-07-18 06:38:45,381 INFO L280 TraceCheckUtils]: 19: Hoare triple {1158#true} assume true; {1158#true} is VALID [2020-07-18 06:38:45,382 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1158#true} {1163#(<= (+ main_~m~0 1) main_~n~0)} #61#return; {1163#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-18 06:38:45,384 INFO L263 TraceCheckUtils]: 21: Hoare triple {1163#(<= (+ main_~m~0 1) main_~n~0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {1168#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:45,385 INFO L280 TraceCheckUtils]: 22: Hoare triple {1168#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1169#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:45,385 INFO L280 TraceCheckUtils]: 23: Hoare triple {1169#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1159#false} is VALID [2020-07-18 06:38:45,386 INFO L280 TraceCheckUtils]: 24: Hoare triple {1159#false} assume !false; {1159#false} is VALID [2020-07-18 06:38:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:38:45,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1181308186] [2020-07-18 06:38:45,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:38:45,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 06:38:45,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781195315] [2020-07-18 06:38:45,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-18 06:38:45,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:45,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 06:38:45,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:45,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 06:38:45,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:45,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 06:38:45,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 06:38:45,419 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 6 states. [2020-07-18 06:38:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:45,661 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-18 06:38:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 06:38:45,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-18 06:38:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:38:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-18 06:38:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:38:45,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-18 06:38:45,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2020-07-18 06:38:45,699 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-18 06:38:45,699 INFO L225 Difference]: With dead ends: 35 [2020-07-18 06:38:45,699 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 06:38:45,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-18 06:38:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 06:38:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 06:38:45,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:45,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:45,701 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:45,701 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:45,702 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 06:38:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:38:45,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:45,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:45,702 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:45,702 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:45,703 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 06:38:45,703 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:38:45,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:45,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:45,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:45,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 06:38:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 06:38:45,704 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-18 06:38:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:45,704 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 06:38:45,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 06:38:45,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 06:38:45,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:38:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:38:45,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:45,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 06:38:45,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 06:38:46,304 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 06:38:46,305 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 06:38:46,305 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 06:38:46,305 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 06:38:46,305 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 06:38:46,305 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 06:38:46,305 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-18 06:38:46,305 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-18 06:38:46,305 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-18 06:38:46,305 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-18 06:38:46,306 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-18 06:38:46,306 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 26) the Hoare annotation is: true [2020-07-18 06:38:46,306 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (<= main_~n~0 0)) (.cse1 (<= 0 main_~m~0)) (.cse2 (<= main_~m~0 main_~x~0))) (or (and (<= main_~x~0 0) .cse0) (and .cse0 .cse1 .cse2) (and (<= (+ main_~m~0 1) main_~n~0) .cse1 .cse2))) [2020-07-18 06:38:46,306 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= (+ main_~x~0 1) main_~n~0) (<= 0 main_~m~0) (<= main_~m~0 main_~x~0)) [2020-07-18 06:38:46,306 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= main_~x~0 0) (<= 0 main_~x~0)) [2020-07-18 06:38:46,306 INFO L264 CegarLoopResult]: At program point L17-2(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= 0 main_~m~0)) (.cse1 (<= main_~m~0 main_~x~0))) (or (and (<= main_~n~0 0) .cse0 .cse1) (and (<= (+ main_~m~0 1) main_~n~0) .cse0 .cse1))) [2020-07-18 06:38:46,307 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= main_~n~0 0)) (.cse1 (<= 0 main_~m~0)) (.cse2 (<= main_~m~0 main_~x~0))) (or (and (<= main_~x~0 0) .cse0 .cse1) (and .cse0 .cse1 .cse2) (and (<= (+ main_~m~0 1) main_~n~0) .cse1 .cse2))) [2020-07-18 06:38:46,307 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 26) the Hoare annotation is: true [2020-07-18 06:38:46,307 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 26) the Hoare annotation is: true [2020-07-18 06:38:46,307 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-18 06:38:46,307 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= (+ main_~x~0 1) main_~n~0) (<= 0 main_~m~0) (<= main_~m~0 main_~x~0)) [2020-07-18 06:38:46,307 INFO L264 CegarLoopResult]: At program point L18-1(lines 18 20) the Hoare annotation is: (and (<= (+ main_~x~0 1) main_~n~0) (<= 0 main_~m~0) (<= main_~m~0 main_~x~0)) [2020-07-18 06:38:46,308 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~x~0 0) (<= 0 main_~m~0) (<= main_~m~0 main_~x~0)) [2020-07-18 06:38:46,308 INFO L264 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (and (<= (+ main_~x~0 1) main_~n~0) (<= 0 main_~m~0) (<= main_~m~0 main_~x~0)) [2020-07-18 06:38:46,308 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= main_~x~0 0) (<= 0 main_~m~0) (<= main_~m~0 main_~x~0)) [2020-07-18 06:38:46,308 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= main_~x~0 0) (<= 0 main_~m~0) (<= main_~m~0 main_~x~0)) [2020-07-18 06:38:46,308 INFO L264 CegarLoopResult]: At program point L18-4(line 18) the Hoare annotation is: (and (<= (+ main_~x~0 1) main_~n~0) (<= 0 main_~m~0) (<= main_~m~0 main_~x~0)) [2020-07-18 06:38:46,308 INFO L264 CegarLoopResult]: At program point L18-5(lines 18 20) the Hoare annotation is: (and (<= (+ main_~x~0 1) main_~n~0) (<= 0 main_~m~0) (<= main_~m~0 main_~x~0)) [2020-07-18 06:38:46,309 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-18 06:38:46,309 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 06:38:46,309 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 06:38:46,309 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 06:38:46,309 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 06:38:46,309 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 06:38:46,313 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 06:38:46,320 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:38:46,320 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:38:46,322 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-18 06:38:46,322 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-18 06:38:46,332 INFO L163 areAnnotationChecker]: CFG has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 06:38:46,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 06:38:46 BoogieIcfgContainer [2020-07-18 06:38:46,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 06:38:46,348 INFO L168 Benchmark]: Toolchain (without parser) took 4890.56 ms. Allocated memory was 137.4 MB in the beginning and 280.5 MB in the end (delta: 143.1 MB). Free memory was 102.3 MB in the beginning and 200.2 MB in the end (delta: -97.8 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:46,349 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 06:38:46,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.30 ms. Allocated memory is still 137.4 MB. Free memory was 101.9 MB in the beginning and 92.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:46,350 INFO L168 Benchmark]: Boogie Preprocessor took 115.93 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 92.3 MB in the beginning and 180.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:46,351 INFO L168 Benchmark]: RCFGBuilder took 342.82 ms. Allocated memory is still 200.8 MB. Free memory was 180.5 MB in the beginning and 161.7 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:46,352 INFO L168 Benchmark]: TraceAbstraction took 4177.29 ms. Allocated memory was 200.8 MB in the beginning and 280.5 MB in the end (delta: 79.7 MB). Free memory was 161.1 MB in the beginning and 200.2 MB in the end (delta: -39.1 MB). Peak memory consumption was 40.6 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:46,356 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 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.30 ms. Allocated memory is still 137.4 MB. Free memory was 101.9 MB in the beginning and 92.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.93 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 92.3 MB in the beginning and 180.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 342.82 ms. Allocated memory is still 200.8 MB. Free memory was 180.5 MB in the beginning and 161.7 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4177.29 ms. Allocated memory was 200.8 MB in the beginning and 280.5 MB in the end (delta: 79.7 MB). Free memory was 161.1 MB in the beginning and 200.2 MB in the end (delta: -39.1 MB). Peak memory consumption was 40.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((n <= 0 && 0 <= m) && m <= x) || ((m + 1 <= n && 0 <= m) && m <= x) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.4s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 143 SDtfs, 81 SDslu, 338 SDs, 0 SdLazy, 137 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 71 PreInvPairs, 111 NumberOfFragments, 236 HoareAnnotationTreeSize, 71 FomulaSimplifications, 327 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 246 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 5512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 7/9 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...