/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-8fc6572 [2020-07-11 02:32:16,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:32:16,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:32:16,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:32:16,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:32:16,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:32:16,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:32:16,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:32:16,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:32:16,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:32:16,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:32:16,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:32:16,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:32:16,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:32:16,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:32:16,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:32:16,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:32:16,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:32:16,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:32:16,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:32:16,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:32:16,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:32:16,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:32:16,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:32:16,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:32:16,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:32:16,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:32:16,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:32:16,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:32:16,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:32:16,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:32:16,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:32:16,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:32:16,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:32:16,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:32:16,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:32:16,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:32:16,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:32:16,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:32:16,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:32:16,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:32:16,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:32:16,622 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:32:16,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:32:16,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:32:16,624 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:32:16,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:32:16,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:32:16,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:32:16,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:32:16,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:32:16,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:32:16,626 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:32:16,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:32:16,626 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:32:16,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:32:16,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:32:16,627 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:32:16,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:32:16,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:32:16,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:32:16,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:32:16,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:32:16,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:32:16,628 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-11 02:32:16,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:32:16,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:32:16,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:32:16,966 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:32:16,967 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:32:16,968 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-11 02:32:17,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a5e1b7b/7c0dec0e21b64139ae35c4dcbb17a6a5/FLAGe70d87f45 [2020-07-11 02:32:17,570 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:32:17,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i [2020-07-11 02:32:17,579 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a5e1b7b/7c0dec0e21b64139ae35c4dcbb17a6a5/FLAGe70d87f45 [2020-07-11 02:32:17,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a5e1b7b/7c0dec0e21b64139ae35c4dcbb17a6a5 [2020-07-11 02:32:17,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:32:17,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:32:17,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:32:17,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:32:17,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:32:17,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:32:17" (1/1) ... [2020-07-11 02:32:17,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6f23ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:17, skipping insertion in model container [2020-07-11 02:32:17,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:32:17" (1/1) ... [2020-07-11 02:32:17,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:32:17,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:32:18,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:32:18,267 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:32:18,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:32:18,307 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:32:18,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:18 WrapperNode [2020-07-11 02:32:18,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:32:18,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:32:18,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:32:18,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:32:18,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:18" (1/1) ... [2020-07-11 02:32:18,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:18" (1/1) ... [2020-07-11 02:32:18,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:18" (1/1) ... [2020-07-11 02:32:18,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:18" (1/1) ... [2020-07-11 02:32:18,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:18" (1/1) ... [2020-07-11 02:32:18,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:18" (1/1) ... [2020-07-11 02:32:18,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:18" (1/1) ... [2020-07-11 02:32:18,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:32:18,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:32:18,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:32:18,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:32:18,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:18" (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-11 02:32:18,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:32:18,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:32:18,583 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:32:18,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:32:18,583 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:32:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:32:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:32:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:32:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:32:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:32:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:32:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:32:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:32:18,920 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:32:18,921 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:32:18,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:32:18 BoogieIcfgContainer [2020-07-11 02:32:18,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:32:18,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:32:18,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:32:18,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:32:18,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:32:17" (1/3) ... [2020-07-11 02:32:18,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d594ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:32:18, skipping insertion in model container [2020-07-11 02:32:18,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:18" (2/3) ... [2020-07-11 02:32:18,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d594ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:32:18, skipping insertion in model container [2020-07-11 02:32:18,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:32:18" (3/3) ... [2020-07-11 02:32:18,939 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007b.i [2020-07-11 02:32:18,963 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:32:18,988 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:32:19,030 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:32:19,065 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:32:19,066 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:32:19,066 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:32:19,066 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:32:19,067 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:32:19,067 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:32:19,067 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:32:19,067 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:32:19,084 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-11 02:32:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-11 02:32:19,096 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:19,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:19,098 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:19,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:19,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1007675669, now seen corresponding path program 1 times [2020-07-11 02:32:19,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:19,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1328798859] [2020-07-11 02:32:19,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:19,302 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-11 02:32:19,302 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #57#return; {32#true} is VALID [2020-07-11 02:32:19,304 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-11 02:32:19,305 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-11 02:32:19,306 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #57#return; {32#true} is VALID [2020-07-11 02:32:19,306 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret2 := main(); {32#true} is VALID [2020-07-11 02:32:19,306 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} ~x~0 := 0; {32#true} is VALID [2020-07-11 02:32:19,307 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} ~m~0 := 0; {32#true} is VALID [2020-07-11 02:32:19,307 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {32#true} is VALID [2020-07-11 02:32:19,308 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} ~n~0 := #t~nondet0; {32#true} is VALID [2020-07-11 02:32:19,308 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#true} havoc #t~nondet0; {32#true} is VALID [2020-07-11 02:32:19,310 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#true} assume !true; {33#false} is VALID [2020-07-11 02:32:19,310 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-11 02:32:19,311 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2020-07-11 02:32:19,311 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2020-07-11 02:32:19,312 INFO L280 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-11 02:32:19,313 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-11 02:32:19,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1328798859] [2020-07-11 02:32:19,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:19,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-11 02:32:19,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13634390] [2020-07-11 02:32:19,326 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-11 02:32:19,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:19,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-11 02:32:19,379 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-11 02:32:19,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-11 02:32:19,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:19,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-11 02:32:19,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-11 02:32:19,394 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-07-11 02:32:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:19,544 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-11 02:32:19,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-11 02:32:19,544 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-11 02:32:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:32:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-11 02:32:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:32:19,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-11 02:32:19,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2020-07-11 02:32:19,659 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-11 02:32:19,674 INFO L225 Difference]: With dead ends: 42 [2020-07-11 02:32:19,674 INFO L226 Difference]: Without dead ends: 24 [2020-07-11 02:32:19,679 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-11 02:32:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-11 02:32:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-11 02:32:19,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:19,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-11 02:32:19,744 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-11 02:32:19,744 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-11 02:32:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:19,750 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-11 02:32:19,750 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-11 02:32:19,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:19,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:19,751 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-11 02:32:19,752 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-11 02:32:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:19,757 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-11 02:32:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-11 02:32:19,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:19,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:19,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:19,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-11 02:32:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-11 02:32:19,764 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2020-07-11 02:32:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:19,765 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-11 02:32:19,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-11 02:32:19,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2020-07-11 02:32:19,812 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-11 02:32:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-11 02:32:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-11 02:32:19,814 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:19,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:19,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:32:19,815 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:19,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:19,815 INFO L82 PathProgramCache]: Analyzing trace with hash 993822854, now seen corresponding path program 1 times [2020-07-11 02:32:19,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:19,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1065414615] [2020-07-11 02:32:19,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:19,950 INFO L280 TraceCheckUtils]: 0: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-11 02:32:19,950 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {218#true} {218#true} #57#return; {218#true} is VALID [2020-07-11 02:32:19,951 INFO L263 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {218#true} is VALID [2020-07-11 02:32:19,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-11 02:32:19,952 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} #57#return; {218#true} is VALID [2020-07-11 02:32:19,952 INFO L263 TraceCheckUtils]: 3: Hoare triple {218#true} call #t~ret2 := main(); {218#true} is VALID [2020-07-11 02:32:19,953 INFO L280 TraceCheckUtils]: 4: Hoare triple {218#true} ~x~0 := 0; {218#true} is VALID [2020-07-11 02:32:19,954 INFO L280 TraceCheckUtils]: 5: Hoare triple {218#true} ~m~0 := 0; {222#(<= 0 main_~m~0)} is VALID [2020-07-11 02:32:19,955 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-11 02:32:19,957 INFO L280 TraceCheckUtils]: 7: Hoare triple {222#(<= 0 main_~m~0)} ~n~0 := #t~nondet0; {222#(<= 0 main_~m~0)} is VALID [2020-07-11 02:32:19,958 INFO L280 TraceCheckUtils]: 8: Hoare triple {222#(<= 0 main_~m~0)} havoc #t~nondet0; {222#(<= 0 main_~m~0)} is VALID [2020-07-11 02:32:19,959 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-11 02:32:19,962 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-11 02:32:19,963 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-11 02:32:19,964 INFO L280 TraceCheckUtils]: 12: Hoare triple {224#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {219#false} is VALID [2020-07-11 02:32:19,965 INFO L280 TraceCheckUtils]: 13: Hoare triple {219#false} assume !false; {219#false} is VALID [2020-07-11 02:32:19,967 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-11 02:32:19,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1065414615] [2020-07-11 02:32:19,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:19,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:32:19,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385598208] [2020-07-11 02:32:19,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-11 02:32:19,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:19,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:32:19,995 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-11 02:32:19,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:32:19,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:19,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:32:19,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:32:19,997 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2020-07-11 02:32:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:20,269 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-11 02:32:20,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:32:20,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-11 02:32:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:32:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-11 02:32:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:32:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-11 02:32:20,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2020-07-11 02:32:20,353 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-11 02:32:20,357 INFO L225 Difference]: With dead ends: 39 [2020-07-11 02:32:20,359 INFO L226 Difference]: Without dead ends: 37 [2020-07-11 02:32:20,361 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-11 02:32:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-11 02:32:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-07-11 02:32:20,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:20,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2020-07-11 02:32:20,420 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2020-07-11 02:32:20,420 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2020-07-11 02:32:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:20,424 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-11 02:32:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-11 02:32:20,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:20,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:20,426 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2020-07-11 02:32:20,426 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2020-07-11 02:32:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:20,430 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-11 02:32:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-11 02:32:20,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:20,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:20,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:20,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-11 02:32:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-07-11 02:32:20,436 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2020-07-11 02:32:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:20,436 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-07-11 02:32:20,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:32:20,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2020-07-11 02:32:20,495 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-11 02:32:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-11 02:32:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-11 02:32:20,497 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:20,497 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-11 02:32:20,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:32:20,498 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:20,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:20,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1988212296, now seen corresponding path program 1 times [2020-07-11 02:32:20,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:20,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [321202580] [2020-07-11 02:32:20,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:20,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-11 02:32:20,583 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {449#true} {449#true} #57#return; {449#true} is VALID [2020-07-11 02:32:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:20,593 INFO L280 TraceCheckUtils]: 0: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-11 02:32:20,594 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-11 02:32:20,594 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-11 02:32:20,596 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {449#true} {454#(<= main_~n~0 0)} #61#return; {454#(<= main_~n~0 0)} is VALID [2020-07-11 02:32:20,596 INFO L263 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {449#true} is VALID [2020-07-11 02:32:20,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-11 02:32:20,597 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {449#true} {449#true} #57#return; {449#true} is VALID [2020-07-11 02:32:20,597 INFO L263 TraceCheckUtils]: 3: Hoare triple {449#true} call #t~ret2 := main(); {449#true} is VALID [2020-07-11 02:32:20,598 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#true} ~x~0 := 0; {453#(<= main_~x~0 0)} is VALID [2020-07-11 02:32:20,599 INFO L280 TraceCheckUtils]: 5: Hoare triple {453#(<= main_~x~0 0)} ~m~0 := 0; {453#(<= main_~x~0 0)} is VALID [2020-07-11 02:32:20,600 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-11 02:32:20,601 INFO L280 TraceCheckUtils]: 7: Hoare triple {453#(<= main_~x~0 0)} ~n~0 := #t~nondet0; {453#(<= main_~x~0 0)} is VALID [2020-07-11 02:32:20,602 INFO L280 TraceCheckUtils]: 8: Hoare triple {453#(<= main_~x~0 0)} havoc #t~nondet0; {453#(<= main_~x~0 0)} is VALID [2020-07-11 02:32:20,603 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-11 02:32:20,603 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-11 02:32:20,603 INFO L280 TraceCheckUtils]: 11: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-11 02:32:20,604 INFO L280 TraceCheckUtils]: 12: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-11 02:32:20,604 INFO L280 TraceCheckUtils]: 13: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-11 02:32:20,605 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {449#true} {454#(<= main_~n~0 0)} #61#return; {454#(<= main_~n~0 0)} is VALID [2020-07-11 02:32:20,607 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-11 02:32:20,608 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-11 02:32:20,609 INFO L280 TraceCheckUtils]: 17: Hoare triple {460#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {450#false} is VALID [2020-07-11 02:32:20,609 INFO L280 TraceCheckUtils]: 18: Hoare triple {450#false} assume !false; {450#false} is VALID [2020-07-11 02:32:20,611 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-11 02:32:20,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [321202580] [2020-07-11 02:32:20,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:20,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 02:32:20,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613506539] [2020-07-11 02:32:20,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-11 02:32:20,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:20,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:32:20,638 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-11 02:32:20,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:32:20,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:20,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:32:20,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:32:20,640 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2020-07-11 02:32:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:20,936 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2020-07-11 02:32:20,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 02:32:20,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-11 02:32:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:32:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-11 02:32:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:32:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-11 02:32:20,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2020-07-11 02:32:21,017 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-11 02:32:21,020 INFO L225 Difference]: With dead ends: 54 [2020-07-11 02:32:21,020 INFO L226 Difference]: Without dead ends: 42 [2020-07-11 02:32:21,024 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-11 02:32:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-11 02:32:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-07-11 02:32:21,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:21,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 35 states. [2020-07-11 02:32:21,099 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 35 states. [2020-07-11 02:32:21,099 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 35 states. [2020-07-11 02:32:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:21,110 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-11 02:32:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-11 02:32:21,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:21,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:21,112 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 42 states. [2020-07-11 02:32:21,113 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 42 states. [2020-07-11 02:32:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:21,123 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-11 02:32:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-11 02:32:21,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:21,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:21,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:21,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-11 02:32:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-11 02:32:21,131 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2020-07-11 02:32:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:21,136 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-11 02:32:21,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:32:21,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2020-07-11 02:32:21,197 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-11 02:32:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-11 02:32:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-11 02:32:21,198 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:21,199 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-11 02:32:21,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:32:21,199 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:21,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:21,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2096508511, now seen corresponding path program 1 times [2020-07-11 02:32:21,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:21,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [294157923] [2020-07-11 02:32:21,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:21,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {729#true} assume true; {729#true} is VALID [2020-07-11 02:32:21,302 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {729#true} {729#true} #57#return; {729#true} is VALID [2020-07-11 02:32:21,302 INFO L263 TraceCheckUtils]: 0: Hoare triple {729#true} call ULTIMATE.init(); {729#true} is VALID [2020-07-11 02:32:21,303 INFO L280 TraceCheckUtils]: 1: Hoare triple {729#true} assume true; {729#true} is VALID [2020-07-11 02:32:21,303 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {729#true} {729#true} #57#return; {729#true} is VALID [2020-07-11 02:32:21,304 INFO L263 TraceCheckUtils]: 3: Hoare triple {729#true} call #t~ret2 := main(); {729#true} is VALID [2020-07-11 02:32:21,305 INFO L280 TraceCheckUtils]: 4: Hoare triple {729#true} ~x~0 := 0; {733#(<= 0 main_~x~0)} is VALID [2020-07-11 02:32:21,306 INFO L280 TraceCheckUtils]: 5: Hoare triple {733#(<= 0 main_~x~0)} ~m~0 := 0; {733#(<= 0 main_~x~0)} is VALID [2020-07-11 02:32:21,307 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-11 02:32:21,308 INFO L280 TraceCheckUtils]: 7: Hoare triple {733#(<= 0 main_~x~0)} ~n~0 := #t~nondet0; {733#(<= 0 main_~x~0)} is VALID [2020-07-11 02:32:21,309 INFO L280 TraceCheckUtils]: 8: Hoare triple {733#(<= 0 main_~x~0)} havoc #t~nondet0; {733#(<= 0 main_~x~0)} is VALID [2020-07-11 02:32:21,310 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-11 02:32:21,311 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-11 02:32:21,312 INFO L280 TraceCheckUtils]: 11: Hoare triple {733#(<= 0 main_~x~0)} assume 0 != #t~nondet1; {733#(<= 0 main_~x~0)} is VALID [2020-07-11 02:32:21,313 INFO L280 TraceCheckUtils]: 12: Hoare triple {733#(<= 0 main_~x~0)} havoc #t~nondet1; {733#(<= 0 main_~x~0)} is VALID [2020-07-11 02:32:21,315 INFO L280 TraceCheckUtils]: 13: Hoare triple {733#(<= 0 main_~x~0)} ~m~0 := ~x~0; {734#(<= 0 main_~m~0)} is VALID [2020-07-11 02:32:21,316 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-11 02:32:21,317 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-11 02:32:21,319 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-11 02:32:21,320 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-11 02:32:21,321 INFO L280 TraceCheckUtils]: 18: Hoare triple {736#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {730#false} is VALID [2020-07-11 02:32:21,321 INFO L280 TraceCheckUtils]: 19: Hoare triple {730#false} assume !false; {730#false} is VALID [2020-07-11 02:32:21,331 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-11 02:32:21,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [294157923] [2020-07-11 02:32:21,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:21,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 02:32:21,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90451642] [2020-07-11 02:32:21,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-11 02:32:21,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:21,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:32:21,363 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-11 02:32:21,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:32:21,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:21,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:32:21,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:32:21,364 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2020-07-11 02:32:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:21,652 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2020-07-11 02:32:21,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 02:32:21,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-11 02:32:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:32:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-11 02:32:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:32:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-11 02:32:21,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2020-07-11 02:32:21,699 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-11 02:32:21,701 INFO L225 Difference]: With dead ends: 41 [2020-07-11 02:32:21,702 INFO L226 Difference]: Without dead ends: 37 [2020-07-11 02:32:21,702 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-11 02:32:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-11 02:32:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2020-07-11 02:32:21,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:21,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 27 states. [2020-07-11 02:32:21,752 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 27 states. [2020-07-11 02:32:21,752 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 27 states. [2020-07-11 02:32:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:21,755 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-11 02:32:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-11 02:32:21,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:21,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:21,757 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 37 states. [2020-07-11 02:32:21,757 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 37 states. [2020-07-11 02:32:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:21,759 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-11 02:32:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-11 02:32:21,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:21,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:21,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:21,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-11 02:32:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-11 02:32:21,763 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2020-07-11 02:32:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:21,763 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-11 02:32:21,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:32:21,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2020-07-11 02:32:21,801 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-11 02:32:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-11 02:32:21,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 02:32:21,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:21,803 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-11 02:32:21,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:32:21,803 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:21,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1883436929, now seen corresponding path program 1 times [2020-07-11 02:32:21,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:21,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1595922004] [2020-07-11 02:32:21,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:21,960 INFO L280 TraceCheckUtils]: 0: Hoare triple {953#true} assume true; {953#true} is VALID [2020-07-11 02:32:21,960 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {953#true} {953#true} #57#return; {953#true} is VALID [2020-07-11 02:32:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:21,971 INFO L280 TraceCheckUtils]: 0: Hoare triple {953#true} ~cond := #in~cond; {953#true} is VALID [2020-07-11 02:32:21,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {953#true} assume !(0 == ~cond); {953#true} is VALID [2020-07-11 02:32:21,972 INFO L280 TraceCheckUtils]: 2: Hoare triple {953#true} assume true; {953#true} is VALID [2020-07-11 02:32:21,973 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-11 02:32:21,974 INFO L263 TraceCheckUtils]: 0: Hoare triple {953#true} call ULTIMATE.init(); {953#true} is VALID [2020-07-11 02:32:21,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {953#true} assume true; {953#true} is VALID [2020-07-11 02:32:21,974 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {953#true} {953#true} #57#return; {953#true} is VALID [2020-07-11 02:32:21,974 INFO L263 TraceCheckUtils]: 3: Hoare triple {953#true} call #t~ret2 := main(); {953#true} is VALID [2020-07-11 02:32:21,975 INFO L280 TraceCheckUtils]: 4: Hoare triple {953#true} ~x~0 := 0; {957#(<= 0 main_~x~0)} is VALID [2020-07-11 02:32:21,976 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-11 02:32:21,977 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-11 02:32:21,978 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-11 02:32:21,979 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-11 02:32:21,980 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-11 02:32:21,981 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-11 02:32:21,982 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-11 02:32:21,982 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-11 02:32:21,983 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-11 02:32:21,984 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-11 02:32:21,984 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-11 02:32:21,985 INFO L280 TraceCheckUtils]: 16: Hoare triple {953#true} ~cond := #in~cond; {953#true} is VALID [2020-07-11 02:32:21,985 INFO L280 TraceCheckUtils]: 17: Hoare triple {953#true} assume !(0 == ~cond); {953#true} is VALID [2020-07-11 02:32:21,985 INFO L280 TraceCheckUtils]: 18: Hoare triple {953#true} assume true; {953#true} is VALID [2020-07-11 02:32:21,986 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-11 02:32:21,988 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-11 02:32:21,989 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-11 02:32:21,990 INFO L280 TraceCheckUtils]: 22: Hoare triple {965#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {954#false} is VALID [2020-07-11 02:32:21,990 INFO L280 TraceCheckUtils]: 23: Hoare triple {954#false} assume !false; {954#false} is VALID [2020-07-11 02:32:21,991 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-11 02:32:21,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1595922004] [2020-07-11 02:32:21,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:21,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 02:32:21,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628195228] [2020-07-11 02:32:21,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 02:32:21,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:21,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:32:22,021 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-11 02:32:22,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:32:22,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:22,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:32:22,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:32:22,022 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2020-07-11 02:32:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:22,386 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-11 02:32:22,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 02:32:22,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 02:32:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:32:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-11 02:32:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:32:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-11 02:32:22,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2020-07-11 02:32:22,440 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-11 02:32:22,443 INFO L225 Difference]: With dead ends: 35 [2020-07-11 02:32:22,443 INFO L226 Difference]: Without dead ends: 29 [2020-07-11 02:32:22,444 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:32:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-11 02:32:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-07-11 02:32:22,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:22,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2020-07-11 02:32:22,511 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2020-07-11 02:32:22,511 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2020-07-11 02:32:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:22,513 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-11 02:32:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-11 02:32:22,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:22,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:22,514 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2020-07-11 02:32:22,514 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2020-07-11 02:32:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:22,518 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-11 02:32:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-11 02:32:22,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:22,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:22,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:22,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 02:32:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-11 02:32:22,525 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-07-11 02:32:22,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:22,527 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-11 02:32:22,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:32:22,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2020-07-11 02:32:22,568 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-11 02:32:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-11 02:32:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-11 02:32:22,570 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:22,570 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-11 02:32:22,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:32:22,570 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:22,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:22,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1649594383, now seen corresponding path program 1 times [2020-07-11 02:32:22,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:22,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [486664812] [2020-07-11 02:32:22,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:22,685 INFO L280 TraceCheckUtils]: 0: Hoare triple {1158#true} assume true; {1158#true} is VALID [2020-07-11 02:32:22,685 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1158#true} {1158#true} #57#return; {1158#true} is VALID [2020-07-11 02:32:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:22,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {1158#true} ~cond := #in~cond; {1158#true} is VALID [2020-07-11 02:32:22,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {1158#true} assume !(0 == ~cond); {1158#true} is VALID [2020-07-11 02:32:22,699 INFO L280 TraceCheckUtils]: 2: Hoare triple {1158#true} assume true; {1158#true} is VALID [2020-07-11 02:32:22,700 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-11 02:32:22,700 INFO L263 TraceCheckUtils]: 0: Hoare triple {1158#true} call ULTIMATE.init(); {1158#true} is VALID [2020-07-11 02:32:22,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {1158#true} assume true; {1158#true} is VALID [2020-07-11 02:32:22,701 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1158#true} {1158#true} #57#return; {1158#true} is VALID [2020-07-11 02:32:22,701 INFO L263 TraceCheckUtils]: 3: Hoare triple {1158#true} call #t~ret2 := main(); {1158#true} is VALID [2020-07-11 02:32:22,701 INFO L280 TraceCheckUtils]: 4: Hoare triple {1158#true} ~x~0 := 0; {1158#true} is VALID [2020-07-11 02:32:22,701 INFO L280 TraceCheckUtils]: 5: Hoare triple {1158#true} ~m~0 := 0; {1158#true} is VALID [2020-07-11 02:32:22,702 INFO L280 TraceCheckUtils]: 6: Hoare triple {1158#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1158#true} is VALID [2020-07-11 02:32:22,702 INFO L280 TraceCheckUtils]: 7: Hoare triple {1158#true} ~n~0 := #t~nondet0; {1158#true} is VALID [2020-07-11 02:32:22,702 INFO L280 TraceCheckUtils]: 8: Hoare triple {1158#true} havoc #t~nondet0; {1158#true} is VALID [2020-07-11 02:32:22,709 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-11 02:32:22,712 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-11 02:32:22,716 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-11 02:32:22,717 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-11 02:32:22,718 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-11 02:32:22,718 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-11 02:32:22,720 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-11 02:32:22,720 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-11 02:32:22,720 INFO L280 TraceCheckUtils]: 17: Hoare triple {1158#true} ~cond := #in~cond; {1158#true} is VALID [2020-07-11 02:32:22,720 INFO L280 TraceCheckUtils]: 18: Hoare triple {1158#true} assume !(0 == ~cond); {1158#true} is VALID [2020-07-11 02:32:22,720 INFO L280 TraceCheckUtils]: 19: Hoare triple {1158#true} assume true; {1158#true} is VALID [2020-07-11 02:32:22,721 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-11 02:32:22,722 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-11 02:32:22,723 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-11 02:32:22,725 INFO L280 TraceCheckUtils]: 23: Hoare triple {1169#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1159#false} is VALID [2020-07-11 02:32:22,725 INFO L280 TraceCheckUtils]: 24: Hoare triple {1159#false} assume !false; {1159#false} is VALID [2020-07-11 02:32:22,726 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-11 02:32:22,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [486664812] [2020-07-11 02:32:22,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:22,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 02:32:22,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494776193] [2020-07-11 02:32:22,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-11 02:32:22,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:22,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:32:22,763 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-11 02:32:22,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:32:22,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:22,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:32:22,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:32:22,764 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 6 states. [2020-07-11 02:32:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:23,031 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-11 02:32:23,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 02:32:23,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-11 02:32:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:23,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:32:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-11 02:32:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:32:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-11 02:32:23,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2020-07-11 02:32:23,079 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-11 02:32:23,079 INFO L225 Difference]: With dead ends: 35 [2020-07-11 02:32:23,080 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:32:23,081 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-11 02:32:23,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:32:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:32:23,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:23,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:23,082 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:23,082 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:23,082 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:23,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:23,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:23,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:23,083 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:23,083 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:23,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:23,083 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:23,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:23,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:23,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:23,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:32:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:32:23,085 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-11 02:32:23,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:23,085 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:32:23,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:32:23,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:32:23,086 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-11 02:32:23,086 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:23,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:23,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:32:23,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:32:23,763 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:23,764 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:23,764 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:23,764 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:32:23,764 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:32:23,764 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:23,765 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:23,765 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:23,765 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-11 02:32:23,765 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-11 02:32:23,765 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:23,765 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 26) the Hoare annotation is: true [2020-07-11 02:32:23,766 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-11 02:32:23,766 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-11 02:32:23,766 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= main_~x~0 0) (<= 0 main_~x~0)) [2020-07-11 02:32:23,768 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-11 02:32:23,768 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-11 02:32:23,768 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 26) the Hoare annotation is: true [2020-07-11 02:32:23,769 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 26) the Hoare annotation is: true [2020-07-11 02:32:23,769 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-11 02:32:23,769 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-11 02:32:23,769 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-11 02:32:23,769 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-11 02:32:23,770 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-11 02:32:23,770 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-11 02:32:23,770 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-11 02:32:23,770 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-11 02:32:23,770 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-11 02:32:23,771 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-11 02:32:23,771 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-11 02:32:23,771 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:23,771 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-11 02:32:23,771 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-11 02:32:23,771 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:23,777 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:32:23,779 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:23,779 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:23,781 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:32:23,781 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:32:23,797 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-11 02:32:23,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:32:23 BoogieIcfgContainer [2020-07-11 02:32:23,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:32:23,818 INFO L168 Benchmark]: Toolchain (without parser) took 5898.18 ms. Allocated memory was 137.4 MB in the beginning and 272.6 MB in the end (delta: 135.3 MB). Free memory was 103.1 MB in the beginning and 183.0 MB in the end (delta: -79.9 MB). Peak memory consumption was 55.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:23,819 INFO L168 Benchmark]: CDTParser took 0.30 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.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 02:32:23,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.37 ms. Allocated memory is still 137.4 MB. Free memory was 102.9 MB in the beginning and 93.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:23,821 INFO L168 Benchmark]: Boogie Preprocessor took 198.61 ms. Allocated memory was 137.4 MB in the beginning and 205.5 MB in the end (delta: 68.2 MB). Free memory was 93.0 MB in the beginning and 183.7 MB in the end (delta: -90.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:23,822 INFO L168 Benchmark]: RCFGBuilder took 420.96 ms. Allocated memory is still 205.5 MB. Free memory was 183.0 MB in the beginning and 165.1 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:23,823 INFO L168 Benchmark]: TraceAbstraction took 4883.87 ms. Allocated memory was 205.5 MB in the beginning and 272.6 MB in the end (delta: 67.1 MB). Free memory was 165.1 MB in the beginning and 183.0 MB in the end (delta: -17.9 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:23,827 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 387.37 ms. Allocated memory is still 137.4 MB. Free memory was 102.9 MB in the beginning and 93.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 198.61 ms. Allocated memory was 137.4 MB in the beginning and 205.5 MB in the end (delta: 68.2 MB). Free memory was 93.0 MB in the beginning and 183.7 MB in the end (delta: -90.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 420.96 ms. Allocated memory is still 205.5 MB. Free memory was 183.0 MB in the beginning and 165.1 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4883.87 ms. Allocated memory was 205.5 MB in the beginning and 272.6 MB in the end (delta: 67.1 MB). Free memory was 165.1 MB in the beginning and 183.0 MB in the end (delta: -17.9 MB). Peak memory consumption was 49.2 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: 4.0s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 143 SDtfs, 81 SDslu, 338 SDs, 0 SdLazy, 137 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s 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.1s SatisfiabilityAnalysisTime, 0.7s 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...