/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-lit/gj2007.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:34:42,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:34:42,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:34:42,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:34:42,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:34:42,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:34:42,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:34:42,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:34:42,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:34:42,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:34:42,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:34:42,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:34:42,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:34:42,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:34:42,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:34:42,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:34:42,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:34:42,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:34:42,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:34:42,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:34:42,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:34:42,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:34:42,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:34:42,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:34:42,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:34:42,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:34:42,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:34:42,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:34:42,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:34:42,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:34:42,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:34:42,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:34:42,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:34:42,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:34:42,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:34:42,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:34:42,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:34:42,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:34:42,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:34:42,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:34:42,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:34:42,217 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 00:34:42,238 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:34:42,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:34:42,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:34:42,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:34:42,240 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:34:42,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:34:42,240 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:34:42,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:34:42,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:34:42,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:34:42,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:34:42,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:34:42,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:34:42,242 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:34:42,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:34:42,242 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:34:42,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:34:42,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:34:42,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:34:42,243 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:34:42,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:34:42,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:34:42,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:34:42,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:34:42,244 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:34:42,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:34:42,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:34:42,244 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:34:42,245 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:34:42,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:34:42,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:34:42,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:34:42,546 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:34:42,546 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:34:42,547 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.i [2019-11-07 00:34:42,618 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63bcc5410/32a2bebe32c14501819768390e46f004/FLAG06294a1ca [2019-11-07 00:34:43,046 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:34:43,046 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.i [2019-11-07 00:34:43,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63bcc5410/32a2bebe32c14501819768390e46f004/FLAG06294a1ca [2019-11-07 00:34:43,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63bcc5410/32a2bebe32c14501819768390e46f004 [2019-11-07 00:34:43,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:34:43,418 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:34:43,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:43,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:34:43,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:34:43,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@285d62e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43, skipping insertion in model container [2019-11-07 00:34:43,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,436 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:34:43,451 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:34:43,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:43,614 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:34:43,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:43,645 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:34:43,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43 WrapperNode [2019-11-07 00:34:43,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:43,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:34:43,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:34:43,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:34:43,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:34:43,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:34:43,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:34:43,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:34:43,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (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 [2019-11-07 00:34:43,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:34:43,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:34:43,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-07 00:34:43,815 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:34:43,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:34:43,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 00:34:43,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:34:43,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:34:43,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:34:43,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:34:43,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:34:43,979 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:34:43,979 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 00:34:43,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:43 BoogieIcfgContainer [2019-11-07 00:34:43,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:34:43,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:34:43,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:34:43,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:34:43,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:34:43" (1/3) ... [2019-11-07 00:34:43,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89bc5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:43, skipping insertion in model container [2019-11-07 00:34:43,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (2/3) ... [2019-11-07 00:34:43,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89bc5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:43, skipping insertion in model container [2019-11-07 00:34:43,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:43" (3/3) ... [2019-11-07 00:34:43,989 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.i [2019-11-07 00:34:43,998 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:34:44,005 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:34:44,013 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:34:44,038 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:34:44,038 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:34:44,039 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:34:44,039 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:34:44,039 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:34:44,039 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:34:44,039 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:34:44,039 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:34:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-07 00:34:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 00:34:44,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:44,063 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:44,064 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:44,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:44,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1712329921, now seen corresponding path program 1 times [2019-11-07 00:34:44,080 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:44,081 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129889173] [2019-11-07 00:34:44,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:44,181 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129889173] [2019-11-07 00:34:44,182 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:44,183 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 00:34:44,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773834936] [2019-11-07 00:34:44,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 00:34:44,193 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:44,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 00:34:44,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:34:44,212 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-07 00:34:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:44,232 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-11-07 00:34:44,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 00:34:44,234 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-07 00:34:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:44,240 INFO L225 Difference]: With dead ends: 31 [2019-11-07 00:34:44,240 INFO L226 Difference]: Without dead ends: 12 [2019-11-07 00:34:44,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:34:44,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-11-07 00:34:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-07 00:34:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-07 00:34:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-11-07 00:34:44,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-11-07 00:34:44,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:44,287 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-07 00:34:44,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 00:34:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-11-07 00:34:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 00:34:44,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:44,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:44,291 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:44,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1703094711, now seen corresponding path program 1 times [2019-11-07 00:34:44,293 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:44,294 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964491709] [2019-11-07 00:34:44,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:44,400 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964491709] [2019-11-07 00:34:44,401 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:44,401 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:34:44,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495441457] [2019-11-07 00:34:44,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:34:44,403 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:44,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:34:44,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:34:44,405 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-11-07 00:34:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:44,454 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-11-07 00:34:44,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:34:44,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-07 00:34:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:44,457 INFO L225 Difference]: With dead ends: 21 [2019-11-07 00:34:44,457 INFO L226 Difference]: Without dead ends: 14 [2019-11-07 00:34:44,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:34:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-07 00:34:44,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-07 00:34:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-07 00:34:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-07 00:34:44,464 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-11-07 00:34:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:44,465 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-07 00:34:44,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:34:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-07 00:34:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 00:34:44,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:44,466 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:44,469 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:44,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:44,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1337256884, now seen corresponding path program 1 times [2019-11-07 00:34:44,470 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:44,475 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831904295] [2019-11-07 00:34:44,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:44,578 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831904295] [2019-11-07 00:34:44,578 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145689539] [2019-11-07 00:34:44,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:44,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 00:34:44,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:44,685 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:44,716 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 00:34:44,717 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-07 00:34:44,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337934240] [2019-11-07 00:34:44,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:44,718 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:44,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:44,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:44,719 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 4 states. [2019-11-07 00:34:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:44,755 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-11-07 00:34:44,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:34:44,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-07 00:34:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:44,757 INFO L225 Difference]: With dead ends: 22 [2019-11-07 00:34:44,757 INFO L226 Difference]: Without dead ends: 17 [2019-11-07 00:34:44,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-07 00:34:44,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-07 00:34:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-07 00:34:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-07 00:34:44,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-11-07 00:34:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:44,764 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-07 00:34:44,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-07 00:34:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:34:44,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:44,765 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:44,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:44,969 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:44,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1593878762, now seen corresponding path program 1 times [2019-11-07 00:34:44,970 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:44,971 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296560090] [2019-11-07 00:34:44,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:34:45,018 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296560090] [2019-11-07 00:34:45,019 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622983654] [2019-11-07 00:34:45,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:45,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 00:34:45,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:34:45,055 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:45,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:34:45,090 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1011874856] [2019-11-07 00:34:45,097 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 17 [2019-11-07 00:34:45,133 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:34:45,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:34:45,250 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 00:34:45,253 INFO L272 AbstractInterpreter]: Visited 13 different actions 45 times. Merged at 4 different actions 15 times. Widened at 2 different actions 3 times. Performed 84 root evaluator evaluations with a maximum evaluation depth of 4. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 2 variables. [2019-11-07 00:34:45,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:45,258 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:34:45,258 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:45,258 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 00:34:45,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545773585] [2019-11-07 00:34:45,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:34:45,259 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:45,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:34:45,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:45,260 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 6 states. [2019-11-07 00:34:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:45,308 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-11-07 00:34:45,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:45,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-07 00:34:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:45,310 INFO L225 Difference]: With dead ends: 33 [2019-11-07 00:34:45,310 INFO L226 Difference]: Without dead ends: 23 [2019-11-07 00:34:45,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:45,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-07 00:34:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-07 00:34:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-07 00:34:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-11-07 00:34:45,321 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2019-11-07 00:34:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:45,322 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-07 00:34:45,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:34:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-11-07 00:34:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 00:34:45,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:45,324 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:45,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:45,528 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:45,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1960957921, now seen corresponding path program 2 times [2019-11-07 00:34:45,530 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:45,530 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201629136] [2019-11-07 00:34:45,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:45,673 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201629136] [2019-11-07 00:34:45,673 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172880949] [2019-11-07 00:34:45,674 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:45,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-07 00:34:45,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 00:34:45,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-07 00:34:45,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:34:45,817 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:34:45,888 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1822584125] [2019-11-07 00:34:45,889 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-11-07 00:34:45,889 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-11-07 00:34:45,889 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:45,889 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2019-11-07 00:34:45,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504520287] [2019-11-07 00:34:45,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-07 00:34:45,890 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:45,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-07 00:34:45,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:34:45,892 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 15 states. [2019-11-07 00:34:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:45,990 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2019-11-07 00:34:45,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 00:34:45,990 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-07 00:34:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:45,993 INFO L225 Difference]: With dead ends: 47 [2019-11-07 00:34:45,994 INFO L226 Difference]: Without dead ends: 37 [2019-11-07 00:34:45,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:34:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-07 00:34:46,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-07 00:34:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-07 00:34:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-11-07 00:34:46,003 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 22 [2019-11-07 00:34:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:46,004 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-11-07 00:34:46,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-07 00:34:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-11-07 00:34:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-07 00:34:46,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:46,005 INFO L410 BasicCegarLoop]: trace histogram [13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:46,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:46,211 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:46,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:46,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1922268420, now seen corresponding path program 3 times [2019-11-07 00:34:46,212 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:46,212 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647013786] [2019-11-07 00:34:46,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:46,467 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647013786] [2019-11-07 00:34:46,467 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782942291] [2019-11-07 00:34:46,467 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:46,518 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-07 00:34:46,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 00:34:46,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-07 00:34:46,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 88 proven. 56 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-07 00:34:46,534 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 88 proven. 56 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-07 00:34:46,751 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [732838072] [2019-11-07 00:34:46,751 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-11-07 00:34:46,751 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-11-07 00:34:46,752 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:46,752 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 24 [2019-11-07 00:34:46,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512202210] [2019-11-07 00:34:46,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-07 00:34:46,754 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:46,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-07 00:34:46,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-11-07 00:34:46,758 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 24 states. [2019-11-07 00:34:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:46,917 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2019-11-07 00:34:46,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-07 00:34:46,918 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2019-11-07 00:34:46,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:46,921 INFO L225 Difference]: With dead ends: 85 [2019-11-07 00:34:46,921 INFO L226 Difference]: Without dead ends: 67 [2019-11-07 00:34:46,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-11-07 00:34:46,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-07 00:34:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-07 00:34:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-07 00:34:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2019-11-07 00:34:46,951 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 36 [2019-11-07 00:34:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:46,952 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2019-11-07 00:34:46,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-07 00:34:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2019-11-07 00:34:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-07 00:34:46,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:46,957 INFO L410 BasicCegarLoop]: trace histogram [28, 22, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:47,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:47,161 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:47,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:47,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1120007209, now seen corresponding path program 4 times [2019-11-07 00:34:47,162 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:47,162 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931407233] [2019-11-07 00:34:47,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:47,811 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931407233] [2019-11-07 00:34:47,811 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441007388] [2019-11-07 00:34:47,812 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:47,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-07 00:34:47,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 253 proven. 506 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-07 00:34:47,902 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 253 proven. 506 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-07 00:34:48,786 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1510508939] [2019-11-07 00:34:48,786 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-11-07 00:34:48,786 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-11-07 00:34:48,787 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:48,787 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25, 25] total 52 [2019-11-07 00:34:48,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732691922] [2019-11-07 00:34:48,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-07 00:34:48,788 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:48,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-07 00:34:48,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-11-07 00:34:48,791 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 52 states. [2019-11-07 00:34:49,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:49,055 INFO L93 Difference]: Finished difference Result 141 states and 181 transitions. [2019-11-07 00:34:49,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-07 00:34:49,056 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 66 [2019-11-07 00:34:49,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:49,057 INFO L225 Difference]: With dead ends: 141 [2019-11-07 00:34:49,058 INFO L226 Difference]: Without dead ends: 123 [2019-11-07 00:34:49,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-11-07 00:34:49,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-07 00:34:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-11-07 00:34:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-07 00:34:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2019-11-07 00:34:49,073 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 66 [2019-11-07 00:34:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:49,074 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2019-11-07 00:34:49,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-07 00:34:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2019-11-07 00:34:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-07 00:34:49,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:49,076 INFO L410 BasicCegarLoop]: trace histogram [56, 50, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:49,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:49,291 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:49,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:49,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1486615299, now seen corresponding path program 5 times [2019-11-07 00:34:49,292 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:49,292 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010091796] [2019-11-07 00:34:49,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:50,836 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010091796] [2019-11-07 00:34:50,836 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684819990] [2019-11-07 00:34:50,836 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:50,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-11-07 00:34:50,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 00:34:50,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-07 00:34:50,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-11-07 00:34:50,903 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-11-07 00:34:51,277 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1979077793] [2019-11-07 00:34:51,277 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-11-07 00:34:51,277 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-11-07 00:34:51,277 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:51,277 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 9, 9] total 66 [2019-11-07 00:34:51,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601472346] [2019-11-07 00:34:51,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-11-07 00:34:51,279 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:51,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-11-07 00:34:51,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-11-07 00:34:51,281 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 66 states. [2019-11-07 00:34:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:51,645 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2019-11-07 00:34:51,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-11-07 00:34:51,645 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 122 [2019-11-07 00:34:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:51,647 INFO L225 Difference]: With dead ends: 144 [2019-11-07 00:34:51,647 INFO L226 Difference]: Without dead ends: 139 [2019-11-07 00:34:51,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-11-07 00:34:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-07 00:34:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-11-07 00:34:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-07 00:34:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2019-11-07 00:34:51,662 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 122 [2019-11-07 00:34:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:51,663 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2019-11-07 00:34:51,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-11-07 00:34:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2019-11-07 00:34:51,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-07 00:34:51,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:51,665 INFO L410 BasicCegarLoop]: trace histogram [64, 50, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:51,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:51,869 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:51,870 INFO L82 PathProgramCache]: Analyzing trace with hash 40708059, now seen corresponding path program 6 times [2019-11-07 00:34:51,870 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:51,870 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823351383] [2019-11-07 00:34:51,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:53,889 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823351383] [2019-11-07 00:34:53,890 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183999522] [2019-11-07 00:34:53,890 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:54,014 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-07 00:34:54,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 00:34:54,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-07 00:34:54,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:54,164 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:57,650 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [437474990] [2019-11-07 00:34:57,651 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-11-07 00:34:57,651 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-11-07 00:34:57,651 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:57,651 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 102 [2019-11-07 00:34:57,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766387479] [2019-11-07 00:34:57,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-11-07 00:34:57,652 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-11-07 00:34:57,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-11-07 00:34:57,656 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand 102 states. [2019-11-07 00:34:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:58,675 INFO L93 Difference]: Finished difference Result 216 states and 301 transitions. [2019-11-07 00:34:58,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-11-07 00:34:58,675 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 138 [2019-11-07 00:34:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:58,678 INFO L225 Difference]: With dead ends: 216 [2019-11-07 00:34:58,678 INFO L226 Difference]: Without dead ends: 211 [2019-11-07 00:34:58,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 212 SyntacticMatches, 30 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-11-07 00:34:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-07 00:34:58,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-11-07 00:34:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-07 00:34:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 261 transitions. [2019-11-07 00:34:58,699 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 261 transitions. Word has length 138 [2019-11-07 00:34:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:58,699 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 261 transitions. [2019-11-07 00:34:58,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-11-07 00:34:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 261 transitions. [2019-11-07 00:34:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-07 00:34:58,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:58,702 INFO L410 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:58,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:58,920 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:58,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:58,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1853582425, now seen corresponding path program 7 times [2019-11-07 00:34:58,921 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:58,922 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137445703] [2019-11-07 00:34:58,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:35:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-11-07 00:35:00,720 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137445703] [2019-11-07 00:35:00,720 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45949426] [2019-11-07 00:35:00,720 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:35:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:35:00,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 108 conjunts are in the unsatisfiable core [2019-11-07 00:35:00,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:35:00,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:35:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-11-07 00:35:01,100 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:35:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-11-07 00:35:01,304 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [863769546] [2019-11-07 00:35:01,304 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-11-07 00:35:01,304 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-11-07 00:35:01,305 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:35:01,305 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 57 [2019-11-07 00:35:01,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041703895] [2019-11-07 00:35:01,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-11-07 00:35:01,306 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:35:01,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-11-07 00:35:01,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2019-11-07 00:35:01,307 INFO L87 Difference]: Start difference. First operand 211 states and 261 transitions. Second operand 57 states. [2019-11-07 00:35:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:35:03,751 INFO L93 Difference]: Finished difference Result 2867 states and 4242 transitions. [2019-11-07 00:35:03,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-11-07 00:35:03,751 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 210 [2019-11-07 00:35:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:35:03,773 INFO L225 Difference]: With dead ends: 2867 [2019-11-07 00:35:03,773 INFO L226 Difference]: Without dead ends: 2862 [2019-11-07 00:35:03,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 415 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=3187, Unknown=0, NotChecked=0, Total=3306 [2019-11-07 00:35:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-11-07 00:35:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 213. [2019-11-07 00:35:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-07 00:35:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 264 transitions. [2019-11-07 00:35:03,856 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 264 transitions. Word has length 210 [2019-11-07 00:35:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:35:03,857 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 264 transitions. [2019-11-07 00:35:03,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-11-07 00:35:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 264 transitions. [2019-11-07 00:35:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-07 00:35:03,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:35:03,860 INFO L410 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:35:04,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:35:04,076 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:35:04,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:35:04,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2073212190, now seen corresponding path program 8 times [2019-11-07 00:35:04,077 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:35:04,077 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544712224] [2019-11-07 00:35:04,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:35:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:35:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-11-07 00:35:05,514 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544712224] [2019-11-07 00:35:05,514 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:35:05,514 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-11-07 00:35:05,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982965369] [2019-11-07 00:35:05,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-07 00:35:05,516 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:35:05,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-07 00:35:05,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-11-07 00:35:05,518 INFO L87 Difference]: Start difference. First operand 213 states and 264 transitions. Second operand 52 states. [2019-11-07 00:35:05,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:35:05,716 INFO L93 Difference]: Finished difference Result 312 states and 412 transitions. [2019-11-07 00:35:05,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-07 00:35:05,716 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 212 [2019-11-07 00:35:05,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:35:05,717 INFO L225 Difference]: With dead ends: 312 [2019-11-07 00:35:05,717 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:35:05,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-11-07 00:35:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:35:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:35:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:35:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:35:05,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2019-11-07 00:35:05,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:35:05,727 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:35:05,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-07 00:35:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:35:05,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:35:05,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:35:06,929 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 1864 DAG size of output: 418 [2019-11-07 00:35:08,611 WARN L191 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 418 DAG size of output: 357 [2019-11-07 00:35:08,617 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 00:35:08,617 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:35:08,617 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:35:08,617 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:35:08,617 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:35:08,617 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:35:08,618 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2019-11-07 00:35:08,618 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2019-11-07 00:35:08,618 INFO L443 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-11-07 00:35:08,618 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2019-11-07 00:35:08,618 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 23) no Hoare annotation was computed. [2019-11-07 00:35:08,621 INFO L439 ceAbstractionStarter]: At program point L14-2(lines 13 20) the Hoare annotation is: (or (and (<= 61 main_~x~0) (and (<= main_~y~0 61) (<= 61 main_~y~0) (<= main_~x~0 61))) (and (<= 81 main_~x~0) (and (<= 81 main_~y~0) (<= main_~y~0 81) (< main_~x~0 82))) (and (<= 79 main_~x~0) (and (<= main_~y~0 79) (< main_~x~0 80) (<= 79 main_~y~0))) (and (and (<= main_~y~0 69) (<= 69 main_~y~0) (< main_~x~0 70)) (<= 69 main_~x~0)) (and (<= 68 main_~x~0) (and (<= 68 main_~y~0) (<= main_~y~0 68) (< main_~x~0 69))) (and (<= 83 main_~x~0) (and (<= main_~y~0 83) (<= 83 main_~y~0) (< main_~x~0 84))) (and (and (<= 56 main_~y~0) (<= main_~x~0 56) (<= main_~y~0 56)) (<= 56 main_~x~0)) (and (and (<= main_~y~0 78) (<= 78 main_~y~0) (< main_~x~0 79)) (<= 78 main_~x~0)) (and (and (<= main_~x~0 64) (<= 64 main_~y~0) (<= main_~y~0 64)) (<= 64 main_~x~0)) (and (and (<= 75 main_~y~0) (< main_~x~0 76) (<= main_~y~0 75)) (<= 75 main_~x~0)) (and (and (<= main_~x~0 54) (<= 54 main_~y~0) (<= main_~y~0 54)) (<= 54 main_~x~0)) (and (and (<= 85 main_~y~0) (< main_~x~0 86) (<= main_~y~0 85)) (<= 85 main_~x~0)) (and (<= 62 main_~x~0) (and (<= main_~y~0 62) (<= main_~x~0 62) (<= 62 main_~y~0))) (and (<= 73 main_~x~0) (and (<= 73 main_~y~0) (< main_~x~0 74) (<= main_~y~0 73))) (and (<= 97 main_~x~0) (and (< main_~x~0 98) (<= 97 main_~y~0) (<= main_~y~0 97))) (and (and (< main_~x~0 95) (<= main_~y~0 94) (<= 94 main_~y~0)) (<= 94 main_~x~0)) (and (and (<= 51 main_~y~0) (<= main_~x~0 51) (<= main_~y~0 51)) (<= 51 main_~x~0)) (and (<= 93 main_~x~0) (and (<= 93 main_~y~0) (<= main_~y~0 93) (< main_~x~0 94))) (and (<= 74 main_~x~0) (and (< main_~x~0 75) (<= 74 main_~y~0) (<= main_~y~0 74))) (and (<= 58 main_~x~0) (and (<= main_~x~0 58) (<= main_~y~0 58) (<= 58 main_~y~0))) (and (and (<= 86 main_~y~0) (< main_~x~0 87) (<= main_~y~0 86)) (<= 86 main_~x~0)) (and (and (< main_~x~0 81) (<= 80 main_~y~0) (<= main_~y~0 80)) (<= 80 main_~x~0)) (and (<= 77 main_~x~0) (and (<= main_~y~0 77) (< main_~x~0 78) (<= 77 main_~y~0))) (and (and (<= 82 main_~y~0) (< main_~x~0 83) (<= main_~y~0 82)) (<= 82 main_~x~0)) (and (and (< main_~x~0 68) (<= main_~y~0 67) (<= 67 main_~y~0)) (<= 67 main_~x~0)) (and (<= 96 main_~x~0) (and (<= 96 main_~y~0) (< main_~x~0 97) (<= main_~y~0 96))) (and (and (<= main_~y~0 95) (<= 95 main_~y~0) (< main_~x~0 96)) (<= 95 main_~x~0)) (and (and (<= 90 main_~y~0) (<= main_~y~0 90) (< main_~x~0 91)) (<= 90 main_~x~0)) (and (<= 87 main_~x~0) (and (< main_~x~0 88) (<= main_~y~0 87) (<= 87 main_~y~0))) (and (<= 63 main_~x~0) (and (<= main_~y~0 63) (<= main_~x~0 63) (<= 63 main_~y~0))) (and (and (<= main_~y~0 88) (<= 88 main_~y~0) (< main_~x~0 89)) (<= 88 main_~x~0)) (and (and (<= main_~y~0 84) (< main_~x~0 85) (<= 84 main_~y~0)) (<= 84 main_~x~0)) (and (and (<= main_~y~0 65) (< main_~x~0 66) (<= 65 main_~y~0)) (<= 65 main_~x~0)) (and (<= main_~y~0 50) (<= main_~x~0 50) (<= 50 main_~y~0)) (and (<= 57 main_~x~0) (and (<= 57 main_~y~0) (<= main_~x~0 57) (<= main_~y~0 57))) (and (and (<= main_~y~0 59) (<= main_~x~0 59) (<= 59 main_~y~0)) (<= 59 main_~x~0)) (and (<= 60 main_~x~0) (and (<= main_~x~0 60) (<= main_~y~0 60) (<= 60 main_~y~0))) (and (and (< main_~x~0 71) (<= main_~y~0 70) (<= 70 main_~y~0)) (<= 70 main_~x~0)) (and (<= 71 main_~x~0) (and (< main_~x~0 72) (<= main_~y~0 71) (<= 71 main_~y~0))) (and (and (<= main_~y~0 76) (< main_~x~0 77) (<= 76 main_~y~0)) (<= 76 main_~x~0)) (and (<= 53 main_~x~0) (and (<= main_~y~0 53) (<= main_~x~0 53) (<= 53 main_~y~0))) (and (and (< main_~x~0 99) (<= main_~y~0 98) (<= 98 main_~y~0)) (<= 98 main_~x~0)) (and (and (<= 99 main_~y~0) (<= main_~y~0 99) (< main_~x~0 100)) (<= 99 main_~x~0)) (and (and (<= main_~y~0 100) (< 99 main_~y~0)) (<= 100 main_~x~0)) (and (<= 91 main_~x~0) (and (< main_~x~0 92) (<= 91 main_~y~0) (<= main_~y~0 91))) (and (and (< main_~x~0 90) (<= 89 main_~y~0) (<= main_~y~0 89)) (<= 89 main_~x~0)) (and (<= 66 main_~x~0) (and (< main_~x~0 67) (<= main_~y~0 66) (<= 66 main_~y~0))) (and (and (<= 52 main_~y~0) (<= main_~y~0 52) (<= main_~x~0 52)) (<= 52 main_~x~0)) (and (<= 72 main_~x~0) (and (<= main_~y~0 72) (<= 72 main_~y~0) (< main_~x~0 73))) (and (and (<= main_~y~0 92) (<= 92 main_~y~0) (< main_~x~0 93)) (<= 92 main_~x~0)) (and (<= 55 main_~x~0) (and (<= main_~y~0 55) (<= 55 main_~y~0) (<= main_~x~0 55)))) [2019-11-07 00:35:08,621 INFO L439 ceAbstractionStarter]: At program point L13-2(lines 13 20) the Hoare annotation is: (and (<= main_~y~0 100) (< 99 main_~y~0)) [2019-11-07 00:35:08,621 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-11-07 00:35:08,621 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-07 00:35:08,621 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-11-07 00:35:08,621 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-07 00:35:08,621 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-07 00:35:08,621 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-11-07 00:35:08,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:35:08 BoogieIcfgContainer [2019-11-07 00:35:08,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:35:08,657 INFO L168 Benchmark]: Toolchain (without parser) took 25238.65 ms. Allocated memory was 138.4 MB in the beginning and 468.7 MB in the end (delta: 330.3 MB). Free memory was 103.1 MB in the beginning and 404.9 MB in the end (delta: -301.8 MB). Peak memory consumption was 326.6 MB. Max. memory is 7.1 GB. [2019-11-07 00:35:08,658 INFO L168 Benchmark]: CDTParser took 1.15 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-07 00:35:08,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.35 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 93.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-11-07 00:35:08,660 INFO L168 Benchmark]: Boogie Preprocessor took 112.14 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 93.5 MB in the beginning and 180.6 MB in the end (delta: -87.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2019-11-07 00:35:08,660 INFO L168 Benchmark]: RCFGBuilder took 221.76 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 169.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-11-07 00:35:08,661 INFO L168 Benchmark]: TraceAbstraction took 24673.38 ms. Allocated memory was 201.9 MB in the beginning and 468.7 MB in the end (delta: 266.9 MB). Free memory was 169.2 MB in the beginning and 404.9 MB in the end (delta: -235.7 MB). Peak memory consumption was 329.3 MB. Max. memory is 7.1 GB. [2019-11-07 00:35:08,666 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.15 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 225.35 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 93.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.14 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 93.5 MB in the beginning and 180.6 MB in the end (delta: -87.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 221.76 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 169.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24673.38 ms. Allocated memory was 201.9 MB in the beginning and 468.7 MB in the end (delta: 266.9 MB). Free memory was 169.2 MB in the beginning and 404.9 MB in the end (delta: -235.7 MB). Peak memory consumption was 329.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((61 <= x && (y <= 61 && 61 <= y) && x <= 61) || (81 <= x && (81 <= y && y <= 81) && x < 82)) || (79 <= x && (y <= 79 && x < 80) && 79 <= y)) || (((y <= 69 && 69 <= y) && x < 70) && 69 <= x)) || (68 <= x && (68 <= y && y <= 68) && x < 69)) || (83 <= x && (y <= 83 && 83 <= y) && x < 84)) || (((56 <= y && x <= 56) && y <= 56) && 56 <= x)) || (((y <= 78 && 78 <= y) && x < 79) && 78 <= x)) || (((x <= 64 && 64 <= y) && y <= 64) && 64 <= x)) || (((75 <= y && x < 76) && y <= 75) && 75 <= x)) || (((x <= 54 && 54 <= y) && y <= 54) && 54 <= x)) || (((85 <= y && x < 86) && y <= 85) && 85 <= x)) || (62 <= x && (y <= 62 && x <= 62) && 62 <= y)) || (73 <= x && (73 <= y && x < 74) && y <= 73)) || (97 <= x && (x < 98 && 97 <= y) && y <= 97)) || (((x < 95 && y <= 94) && 94 <= y) && 94 <= x)) || (((51 <= y && x <= 51) && y <= 51) && 51 <= x)) || (93 <= x && (93 <= y && y <= 93) && x < 94)) || (74 <= x && (x < 75 && 74 <= y) && y <= 74)) || (58 <= x && (x <= 58 && y <= 58) && 58 <= y)) || (((86 <= y && x < 87) && y <= 86) && 86 <= x)) || (((x < 81 && 80 <= y) && y <= 80) && 80 <= x)) || (77 <= x && (y <= 77 && x < 78) && 77 <= y)) || (((82 <= y && x < 83) && y <= 82) && 82 <= x)) || (((x < 68 && y <= 67) && 67 <= y) && 67 <= x)) || (96 <= x && (96 <= y && x < 97) && y <= 96)) || (((y <= 95 && 95 <= y) && x < 96) && 95 <= x)) || (((90 <= y && y <= 90) && x < 91) && 90 <= x)) || (87 <= x && (x < 88 && y <= 87) && 87 <= y)) || (63 <= x && (y <= 63 && x <= 63) && 63 <= y)) || (((y <= 88 && 88 <= y) && x < 89) && 88 <= x)) || (((y <= 84 && x < 85) && 84 <= y) && 84 <= x)) || (((y <= 65 && x < 66) && 65 <= y) && 65 <= x)) || ((y <= 50 && x <= 50) && 50 <= y)) || (57 <= x && (57 <= y && x <= 57) && y <= 57)) || (((y <= 59 && x <= 59) && 59 <= y) && 59 <= x)) || (60 <= x && (x <= 60 && y <= 60) && 60 <= y)) || (((x < 71 && y <= 70) && 70 <= y) && 70 <= x)) || (71 <= x && (x < 72 && y <= 71) && 71 <= y)) || (((y <= 76 && x < 77) && 76 <= y) && 76 <= x)) || (53 <= x && (y <= 53 && x <= 53) && 53 <= y)) || (((x < 99 && y <= 98) && 98 <= y) && 98 <= x)) || (((99 <= y && y <= 99) && x < 100) && 99 <= x)) || ((y <= 100 && 99 < y) && 100 <= x)) || (91 <= x && (x < 92 && 91 <= y) && y <= 91)) || (((x < 90 && 89 <= y) && y <= 89) && 89 <= x)) || (66 <= x && (x < 67 && y <= 66) && 66 <= y)) || (((52 <= y && y <= 52) && x <= 52) && 52 <= x)) || (72 <= x && (y <= 72 && 72 <= y) && x < 73)) || (((y <= 92 && 92 <= y) && x < 93) && 92 <= x)) || (55 <= x && (y <= 55 && 55 <= y) && x <= 55) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Result: SAFE, OverallTime: 24.5s, OverallIterations: 11, TraceHistogramMax: 101, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, HoareTripleCheckerStatistics: 223 SDtfs, 321 SDslu, 6536 SDs, 0 SdLazy, 3834 SolverSat, 896 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1539 GetRequests, 1139 SyntacticMatches, 36 SemanticMatches, 364 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 2649 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 119 NumberOfFragments, 720 HoareAnnotationTreeSize, 17 FomulaSimplifications, 14894 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 277 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 1476 NumberOfCodeBlocks, 1388 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2071 ConstructedInterpolants, 0 QuantifiedInterpolants, 1264343 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1272 ConjunctsInSsa, 227 ConjunctsInUnsatCore, 27 InterpolantComputations, 5 PerfectInterpolantSequences, 24920/64894 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...