java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loops/vogal_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:24:11,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:24:11,277 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:24:11,289 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:24:11,290 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:24:11,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:24:11,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:24:11,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:24:11,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:24:11,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:24:11,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:24:11,298 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:24:11,299 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:24:11,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:24:11,301 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:24:11,302 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:24:11,303 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:24:11,305 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:24:11,307 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:24:11,309 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:24:11,310 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:24:11,311 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:24:11,313 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:24:11,314 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:24:11,314 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:24:11,315 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:24:11,316 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:24:11,321 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:24:11,322 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:24:11,323 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:24:11,323 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:24:11,324 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:24:11,324 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:24:11,324 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:24:11,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:24:11,328 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:24:11,328 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 12:24:11,353 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:24:11,353 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:24:11,354 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:24:11,355 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:24:11,355 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:24:11,355 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:24:11,355 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 12:24:11,356 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:24:11,356 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 12:24:11,356 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:24:11,356 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:24:11,356 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:24:11,357 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:24:11,357 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:24:11,358 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:24:11,358 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:24:11,358 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:24:11,358 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:24:11,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:24:11,359 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:24:11,359 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:24:11,359 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:24:11,359 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:24:11,360 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:24:11,360 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:24:11,360 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:24:11,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:24:11,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:24:11,361 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:24:11,361 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:24:11,361 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:24:11,361 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:24:11,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:24:11,361 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:24:11,362 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:24:11,362 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:24:11,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:24:11,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:24:11,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:24:11,436 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:24:11,436 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:24:11,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/vogal_false-unreach-call.i [2018-10-24 12:24:11,496 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cb0038e07/b43a4b01778b4cac9fd18aa820215ce0/FLAGfc60e31af [2018-10-24 12:24:12,004 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:24:12,005 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal_false-unreach-call.i [2018-10-24 12:24:12,011 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cb0038e07/b43a4b01778b4cac9fd18aa820215ce0/FLAGfc60e31af [2018-10-24 12:24:12,025 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cb0038e07/b43a4b01778b4cac9fd18aa820215ce0 [2018-10-24 12:24:12,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:24:12,037 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:24:12,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:24:12,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:24:12,043 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:24:12,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:24:12" (1/1) ... [2018-10-24 12:24:12,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32327da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:12, skipping insertion in model container [2018-10-24 12:24:12,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:24:12" (1/1) ... [2018-10-24 12:24:12,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:24:12,091 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:24:12,359 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:24:12,363 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:24:12,409 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:24:12,431 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:24:12,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:12 WrapperNode [2018-10-24 12:24:12,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:24:12,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:24:12,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:24:12,433 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:24:12,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:12" (1/1) ... [2018-10-24 12:24:12,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:12" (1/1) ... [2018-10-24 12:24:12,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:24:12,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:24:12,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:24:12,508 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:24:12,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:12" (1/1) ... [2018-10-24 12:24:12,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:12" (1/1) ... [2018-10-24 12:24:12,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:12" (1/1) ... [2018-10-24 12:24:12,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:12" (1/1) ... [2018-10-24 12:24:12,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:12" (1/1) ... [2018-10-24 12:24:12,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:12" (1/1) ... [2018-10-24 12:24:12,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:12" (1/1) ... [2018-10-24 12:24:12,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:24:12,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:24:12,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:24:12,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:24:12,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 12:24:12,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:24:12,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:24:12,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:24:12,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:24:12,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:24:12,728 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:24:12,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:24:12,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:24:13,408 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:24:13,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:24:13 BoogieIcfgContainer [2018-10-24 12:24:13,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:24:13,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:24:13,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:24:13,413 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:24:13,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:24:12" (1/3) ... [2018-10-24 12:24:13,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce6835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:24:13, skipping insertion in model container [2018-10-24 12:24:13,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:24:12" (2/3) ... [2018-10-24 12:24:13,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce6835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:24:13, skipping insertion in model container [2018-10-24 12:24:13,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:24:13" (3/3) ... [2018-10-24 12:24:13,417 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal_false-unreach-call.i [2018-10-24 12:24:13,427 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:24:13,436 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:24:13,454 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:24:13,489 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:24:13,489 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:24:13,489 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:24:13,489 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:24:13,490 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:24:13,490 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:24:13,490 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:24:13,490 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:24:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-10-24 12:24:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-24 12:24:13,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:13,519 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:13,521 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:13,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:13,528 INFO L82 PathProgramCache]: Analyzing trace with hash 423919587, now seen corresponding path program 1 times [2018-10-24 12:24:13,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:13,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:13,594 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:13,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:24:13,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:24:13,709 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:13,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:24:13,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:24:13,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:24:13,735 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-10-24 12:24:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:13,763 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2018-10-24 12:24:13,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:24:13,765 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-10-24 12:24:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:13,775 INFO L225 Difference]: With dead ends: 75 [2018-10-24 12:24:13,775 INFO L226 Difference]: Without dead ends: 35 [2018-10-24 12:24:13,779 INFO L605 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 [2018-10-24 12:24:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-24 12:24:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-24 12:24:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-24 12:24:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-10-24 12:24:13,822 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 17 [2018-10-24 12:24:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:13,822 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-10-24 12:24:13,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:24:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-10-24 12:24:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 12:24:13,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:13,824 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:13,824 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:13,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:13,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1156330617, now seen corresponding path program 1 times [2018-10-24 12:24:13,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:13,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:13,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:13,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:13,827 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:13,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:24:13,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:24:13,931 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:13,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:24:13,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:24:13,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:24:13,934 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 3 states. [2018-10-24 12:24:14,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:14,099 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2018-10-24 12:24:14,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:24:14,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-24 12:24:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:14,102 INFO L225 Difference]: With dead ends: 81 [2018-10-24 12:24:14,102 INFO L226 Difference]: Without dead ends: 55 [2018-10-24 12:24:14,103 INFO L605 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 [2018-10-24 12:24:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-24 12:24:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2018-10-24 12:24:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-24 12:24:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-10-24 12:24:14,112 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 23 [2018-10-24 12:24:14,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:14,112 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-10-24 12:24:14,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:24:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-10-24 12:24:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-24 12:24:14,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:14,114 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:14,114 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:14,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:14,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1223778650, now seen corresponding path program 1 times [2018-10-24 12:24:14,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:14,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:14,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:14,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:14,117 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:14,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:14,332 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:14,333 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-10-24 12:24:14,335 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [35], [39], [42], [68], [72], [74], [77], [106], [109], [111], [117], [118], [119], [121] [2018-10-24 12:24:14,377 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:14,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:14,818 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:24:14,820 INFO L272 AbstractInterpreter]: Visited 24 different actions 36 times. Merged at 4 different actions 9 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 43 variables. [2018-10-24 12:24:14,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:14,843 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:24:15,013 INFO L232 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 88.43% of their original sizes. [2018-10-24 12:24:15,013 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:24:15,353 INFO L413 sIntCurrentIteration]: We have 25 unified AI predicates [2018-10-24 12:24:15,354 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:24:15,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:24:15,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-10-24 12:24:15,356 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:15,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:24:15,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:24:15,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:24:15,357 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 10 states. [2018-10-24 12:24:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:17,481 INFO L93 Difference]: Finished difference Result 134 states and 171 transitions. [2018-10-24 12:24:17,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 12:24:17,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-10-24 12:24:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:17,484 INFO L225 Difference]: With dead ends: 134 [2018-10-24 12:24:17,485 INFO L226 Difference]: Without dead ends: 107 [2018-10-24 12:24:17,486 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:24:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-24 12:24:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-10-24 12:24:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-24 12:24:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2018-10-24 12:24:17,504 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 26 [2018-10-24 12:24:17,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:17,504 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2018-10-24 12:24:17,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:24:17,505 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2018-10-24 12:24:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-24 12:24:17,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:17,509 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:17,509 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:17,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:17,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1325603312, now seen corresponding path program 1 times [2018-10-24 12:24:17,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:17,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:17,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:17,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:17,512 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 12:24:17,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:17,821 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:17,822 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-10-24 12:24:17,822 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [35], [39], [42], [68], [72], [74], [77], [79], [83], [86], [88], [91], [95], [99], [106], [109], [111], [117], [118], [119], [121] [2018-10-24 12:24:17,825 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:17,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:17,998 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:17,999 INFO L272 AbstractInterpreter]: Visited 32 different actions 74 times. Merged at 14 different actions 32 times. Never widened. Found 6 fixpoints after 6 different actions. Largest state had 48 variables. [2018-10-24 12:24:18,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:18,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:18,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:18,039 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:18,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:18,056 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:18,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:18,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-24 12:24:18,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:24:18,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:18,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:18,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:18,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-10-24 12:24:19,341 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 12:24:19,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-24 12:24:19,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-24 12:24:19,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:19,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:19,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:19,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-24 12:24:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:24:19,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:24:20,377 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:24:20,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [4] total 14 [2018-10-24 12:24:20,378 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:20,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:24:20,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:24:20,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:24:20,380 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 8 states. [2018-10-24 12:24:20,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:20,931 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-10-24 12:24:20,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:24:20,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-10-24 12:24:20,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:20,933 INFO L225 Difference]: With dead ends: 84 [2018-10-24 12:24:20,934 INFO L226 Difference]: Without dead ends: 56 [2018-10-24 12:24:20,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-10-24 12:24:20,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-24 12:24:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-24 12:24:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-24 12:24:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-10-24 12:24:20,948 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 36 [2018-10-24 12:24:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:20,948 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-10-24 12:24:20,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:24:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-10-24 12:24:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-24 12:24:20,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:20,950 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:20,951 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:20,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:20,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1927482500, now seen corresponding path program 1 times [2018-10-24 12:24:20,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:20,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:20,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:20,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:20,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 12:24:21,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:21,084 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:21,084 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-10-24 12:24:21,085 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [31], [35], [39], [42], [44], [48], [51], [53], [56], [60], [64], [68], [72], [74], [77], [106], [109], [111], [117], [118], [119], [121] [2018-10-24 12:24:21,090 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:21,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:21,339 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:21,340 INFO L272 AbstractInterpreter]: Visited 33 different actions 119 times. Merged at 22 different actions 65 times. Widened at 2 different actions 3 times. Found 9 fixpoints after 7 different actions. Largest state had 49 variables. [2018-10-24 12:24:21,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:21,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:21,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:21,378 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:21,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:21,396 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:21,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:21,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-24 12:24:21,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:24:21,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:21,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:21,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:21,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-10-24 12:24:22,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-10-24 12:24:22,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-10-24 12:24:22,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:22,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:22,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:22,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-10-24 12:24:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:24:22,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:24:22,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-24 12:24:22,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 8] total 14 [2018-10-24 12:24:22,256 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:22,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:24:22,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:24:22,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:24:22,257 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 7 states. [2018-10-24 12:24:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:22,498 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2018-10-24 12:24:22,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:24:22,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-10-24 12:24:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:22,500 INFO L225 Difference]: With dead ends: 90 [2018-10-24 12:24:22,500 INFO L226 Difference]: Without dead ends: 85 [2018-10-24 12:24:22,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-10-24 12:24:22,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-24 12:24:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2018-10-24 12:24:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-24 12:24:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2018-10-24 12:24:22,512 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 38 [2018-10-24 12:24:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:22,512 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2018-10-24 12:24:22,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:24:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2018-10-24 12:24:22,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-24 12:24:22,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:22,514 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:22,514 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:22,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:22,515 INFO L82 PathProgramCache]: Analyzing trace with hash 650168739, now seen corresponding path program 1 times [2018-10-24 12:24:22,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:22,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:22,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:22,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:22,517 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:24:22,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:22,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:22,828 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-10-24 12:24:22,829 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [31], [35], [39], [42], [68], [72], [74], [77], [79], [83], [86], [88], [91], [95], [99], [106], [109], [111], [117], [118], [119], [121] [2018-10-24 12:24:22,831 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:22,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:23,031 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:23,031 INFO L272 AbstractInterpreter]: Visited 33 different actions 118 times. Merged at 22 different actions 61 times. Widened at 1 different actions 3 times. Found 10 fixpoints after 8 different actions. Largest state had 49 variables. [2018-10-24 12:24:23,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:23,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:23,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:23,051 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:23,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:23,065 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:23,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 12:24:23,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:24:23,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:23,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 11 [2018-10-24 12:24:23,574 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:23,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:24:23,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:24:23,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:24:23,575 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 8 states. [2018-10-24 12:24:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:24,149 INFO L93 Difference]: Finished difference Result 338 states and 436 transitions. [2018-10-24 12:24:24,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 12:24:24,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-10-24 12:24:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:24,151 INFO L225 Difference]: With dead ends: 338 [2018-10-24 12:24:24,152 INFO L226 Difference]: Without dead ends: 290 [2018-10-24 12:24:24,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:24:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-24 12:24:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 88. [2018-10-24 12:24:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-24 12:24:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2018-10-24 12:24:24,171 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 39 [2018-10-24 12:24:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:24,172 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2018-10-24 12:24:24,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:24:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2018-10-24 12:24:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-24 12:24:24,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:24,174 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:24,174 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:24,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:24,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1841664296, now seen corresponding path program 1 times [2018-10-24 12:24:24,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:24,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:24,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:24,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:24,177 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-24 12:24:24,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:24:24,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:24:24,293 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:24,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:24:24,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:24:24,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:24:24,294 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 3 states. [2018-10-24 12:24:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:24,335 INFO L93 Difference]: Finished difference Result 152 states and 190 transitions. [2018-10-24 12:24:24,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:24:24,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-24 12:24:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:24,337 INFO L225 Difference]: With dead ends: 152 [2018-10-24 12:24:24,337 INFO L226 Difference]: Without dead ends: 109 [2018-10-24 12:24:24,338 INFO L605 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 [2018-10-24 12:24:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-24 12:24:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2018-10-24 12:24:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-24 12:24:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-10-24 12:24:24,354 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 47 [2018-10-24 12:24:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:24,355 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-10-24 12:24:24,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:24:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-10-24 12:24:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-24 12:24:24,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:24,357 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:24,357 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:24,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:24,358 INFO L82 PathProgramCache]: Analyzing trace with hash 453224470, now seen corresponding path program 2 times [2018-10-24 12:24:24,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:24,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:24,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:24,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:24,359 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:24:24,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:24,708 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:24,708 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:24,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:24,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:24,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:24,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:24,725 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:24,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-24 12:24:24,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:24,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:25,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-24 12:24:25,257 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:24:25,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-10-24 12:24:25,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:25,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:25,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:24:25,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2018-10-24 12:24:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:24:25,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:25,602 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:24:25,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:25,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:25,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:1 [2018-10-24 12:24:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:24:25,640 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:24:25,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [8] total 21 [2018-10-24 12:24:25,640 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:25,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 12:24:25,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 12:24:25,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-10-24 12:24:25,642 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 9 states. [2018-10-24 12:24:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:26,133 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2018-10-24 12:24:26,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:24:26,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-10-24 12:24:26,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:26,135 INFO L225 Difference]: With dead ends: 158 [2018-10-24 12:24:26,135 INFO L226 Difference]: Without dead ends: 129 [2018-10-24 12:24:26,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-10-24 12:24:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-24 12:24:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2018-10-24 12:24:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-24 12:24:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2018-10-24 12:24:26,151 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 48 [2018-10-24 12:24:26,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:26,151 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2018-10-24 12:24:26,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 12:24:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2018-10-24 12:24:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-24 12:24:26,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:26,153 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:26,154 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:26,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:26,154 INFO L82 PathProgramCache]: Analyzing trace with hash 134038335, now seen corresponding path program 1 times [2018-10-24 12:24:26,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:26,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:26,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:26,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:26,155 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:24:26,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:26,270 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:26,270 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-10-24 12:24:26,270 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [31], [35], [39], [42], [44], [48], [51], [53], [56], [60], [64], [68], [72], [74], [77], [79], [83], [86], [88], [91], [95], [99], [106], [109], [111], [117], [118], [119], [121] [2018-10-24 12:24:26,272 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:26,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:26,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:26,542 INFO L272 AbstractInterpreter]: Visited 40 different actions 188 times. Merged at 29 different actions 106 times. Widened at 6 different actions 11 times. Found 18 fixpoints after 12 different actions. Largest state had 54 variables. [2018-10-24 12:24:26,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:26,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:26,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:26,581 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:26,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:26,597 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:26,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:24:26,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:24:26,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:26,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 9 [2018-10-24 12:24:26,825 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:26,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:24:26,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:24:26,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-24 12:24:26,826 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand 7 states. [2018-10-24 12:24:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:27,427 INFO L93 Difference]: Finished difference Result 395 states and 511 transitions. [2018-10-24 12:24:27,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 12:24:27,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-10-24 12:24:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:27,430 INFO L225 Difference]: With dead ends: 395 [2018-10-24 12:24:27,430 INFO L226 Difference]: Without dead ends: 315 [2018-10-24 12:24:27,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:24:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-24 12:24:27,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 120. [2018-10-24 12:24:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-24 12:24:27,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2018-10-24 12:24:27,469 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 51 [2018-10-24 12:24:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:27,470 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2018-10-24 12:24:27,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:24:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2018-10-24 12:24:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-24 12:24:27,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:27,475 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:27,475 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:27,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:27,475 INFO L82 PathProgramCache]: Analyzing trace with hash -265971854, now seen corresponding path program 2 times [2018-10-24 12:24:27,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:27,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:27,477 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:24:27,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:27,602 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:27,603 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:27,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:27,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:27,603 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:27,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:27,613 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:27,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 12:24:27,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:27,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 12:24:27,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 12:24:28,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:28,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 22 [2018-10-24 12:24:28,110 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:28,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 12:24:28,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 12:24:28,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:24:28,112 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand 14 states. [2018-10-24 12:24:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:30,891 INFO L93 Difference]: Finished difference Result 994 states and 1244 transitions. [2018-10-24 12:24:30,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-24 12:24:30,891 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-10-24 12:24:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:30,896 INFO L225 Difference]: With dead ends: 994 [2018-10-24 12:24:30,896 INFO L226 Difference]: Without dead ends: 885 [2018-10-24 12:24:30,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=1945, Unknown=0, NotChecked=0, Total=2162 [2018-10-24 12:24:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-10-24 12:24:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 192. [2018-10-24 12:24:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-24 12:24:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 234 transitions. [2018-10-24 12:24:30,932 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 234 transitions. Word has length 62 [2018-10-24 12:24:30,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:30,932 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 234 transitions. [2018-10-24 12:24:30,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 12:24:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 234 transitions. [2018-10-24 12:24:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-24 12:24:30,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:30,934 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:30,935 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:30,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:30,935 INFO L82 PathProgramCache]: Analyzing trace with hash -34917123, now seen corresponding path program 1 times [2018-10-24 12:24:30,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:30,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:30,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:30,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:30,936 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:24:31,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:31,137 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:31,137 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-10-24 12:24:31,137 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [31], [35], [39], [42], [44], [48], [51], [53], [56], [60], [64], [68], [72], [74], [77], [79], [83], [86], [88], [91], [93], [95], [99], [106], [109], [111], [117], [118], [119], [121] [2018-10-24 12:24:31,140 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:31,140 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:31,434 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:31,434 INFO L272 AbstractInterpreter]: Visited 41 different actions 199 times. Merged at 30 different actions 112 times. Widened at 6 different actions 12 times. Found 27 fixpoints after 14 different actions. Largest state had 54 variables. [2018-10-24 12:24:31,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:31,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:31,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:31,475 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:31,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:31,490 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:31,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-24 12:24:31,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-24 12:24:31,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:31,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 13 [2018-10-24 12:24:31,901 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:31,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:24:31,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:24:31,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:24:31,902 INFO L87 Difference]: Start difference. First operand 192 states and 234 transitions. Second operand 10 states. [2018-10-24 12:24:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:33,673 INFO L93 Difference]: Finished difference Result 1189 states and 1565 transitions. [2018-10-24 12:24:33,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-24 12:24:33,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-10-24 12:24:33,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:33,680 INFO L225 Difference]: With dead ends: 1189 [2018-10-24 12:24:33,680 INFO L226 Difference]: Without dead ends: 1017 [2018-10-24 12:24:33,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2018-10-24 12:24:33,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-10-24 12:24:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 238. [2018-10-24 12:24:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-24 12:24:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 290 transitions. [2018-10-24 12:24:33,731 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 290 transitions. Word has length 65 [2018-10-24 12:24:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:33,732 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 290 transitions. [2018-10-24 12:24:33,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:24:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 290 transitions. [2018-10-24 12:24:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-24 12:24:33,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:33,733 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:33,734 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:33,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:33,734 INFO L82 PathProgramCache]: Analyzing trace with hash -556623310, now seen corresponding path program 3 times [2018-10-24 12:24:33,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:33,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:33,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:33,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:33,735 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-24 12:24:34,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:34,668 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:34,669 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:34,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:34,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:34,669 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:34,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:34,687 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:34,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:34,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:34,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 55 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 12:24:35,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-24 12:24:35,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:35,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 16 [2018-10-24 12:24:35,207 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:35,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 12:24:35,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 12:24:35,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:24:35,208 INFO L87 Difference]: Start difference. First operand 238 states and 290 transitions. Second operand 12 states. [2018-10-24 12:24:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:37,037 INFO L93 Difference]: Finished difference Result 1635 states and 2138 transitions. [2018-10-24 12:24:37,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-24 12:24:37,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-10-24 12:24:37,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:37,051 INFO L225 Difference]: With dead ends: 1635 [2018-10-24 12:24:37,051 INFO L226 Difference]: Without dead ends: 1420 [2018-10-24 12:24:37,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2018-10-24 12:24:37,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-10-24 12:24:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 288. [2018-10-24 12:24:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-24 12:24:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2018-10-24 12:24:37,118 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 76 [2018-10-24 12:24:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:37,118 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2018-10-24 12:24:37,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 12:24:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2018-10-24 12:24:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-24 12:24:37,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:37,119 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:37,119 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:37,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:37,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1763983329, now seen corresponding path program 4 times [2018-10-24 12:24:37,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:37,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:37,121 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-24 12:24:37,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:37,346 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:37,347 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:37,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:37,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:37,347 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:37,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:37,357 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:37,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 3 proven. 86 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:24:37,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-24 12:24:37,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:37,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 7] total 19 [2018-10-24 12:24:37,672 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:37,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 12:24:37,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 12:24:37,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-10-24 12:24:37,673 INFO L87 Difference]: Start difference. First operand 288 states and 351 transitions. Second operand 14 states. [2018-10-24 12:24:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:41,604 INFO L93 Difference]: Finished difference Result 2149 states and 2794 transitions. [2018-10-24 12:24:41,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-24 12:24:41,604 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2018-10-24 12:24:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:41,612 INFO L225 Difference]: With dead ends: 2149 [2018-10-24 12:24:41,612 INFO L226 Difference]: Without dead ends: 1887 [2018-10-24 12:24:41,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=375, Invalid=2487, Unknown=0, NotChecked=0, Total=2862 [2018-10-24 12:24:41,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2018-10-24 12:24:41,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 339. [2018-10-24 12:24:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-24 12:24:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 414 transitions. [2018-10-24 12:24:41,700 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 414 transitions. Word has length 87 [2018-10-24 12:24:41,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:41,701 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 414 transitions. [2018-10-24 12:24:41,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 12:24:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 414 transitions. [2018-10-24 12:24:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-24 12:24:41,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:41,703 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:41,703 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:41,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:41,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2091712978, now seen corresponding path program 5 times [2018-10-24 12:24:41,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:41,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:41,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:41,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:41,704 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-10-24 12:24:42,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:42,437 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:42,437 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:42,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:42,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:42,437 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:42,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:42,446 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:42,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-24 12:24:42,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:42,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-24 12:24:43,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-24 12:24:43,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:43,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 16] total 38 [2018-10-24 12:24:43,729 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:43,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-24 12:24:43,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-24 12:24:43,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1307, Unknown=0, NotChecked=0, Total=1406 [2018-10-24 12:24:43,731 INFO L87 Difference]: Start difference. First operand 339 states and 414 transitions. Second operand 24 states. [2018-10-24 12:24:55,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:55,483 INFO L93 Difference]: Finished difference Result 5969 states and 7499 transitions. [2018-10-24 12:24:55,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-24 12:24:55,483 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2018-10-24 12:24:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:55,500 INFO L225 Difference]: With dead ends: 5969 [2018-10-24 12:24:55,500 INFO L226 Difference]: Without dead ends: 5649 [2018-10-24 12:24:55,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5041 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=729, Invalid=17361, Unknown=0, NotChecked=0, Total=18090 [2018-10-24 12:24:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5649 states. [2018-10-24 12:24:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 517. [2018-10-24 12:24:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-10-24 12:24:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 640 transitions. [2018-10-24 12:24:55,718 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 640 transitions. Word has length 98 [2018-10-24 12:24:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:55,719 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 640 transitions. [2018-10-24 12:24:55,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-24 12:24:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 640 transitions. [2018-10-24 12:24:55,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-24 12:24:55,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:55,722 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 6, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:55,722 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:55,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:55,723 INFO L82 PathProgramCache]: Analyzing trace with hash 9829597, now seen corresponding path program 2 times [2018-10-24 12:24:55,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:55,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:55,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:55,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:55,724 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-10-24 12:24:56,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:56,453 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:56,453 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:56,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:56,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:56,454 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:56,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:56,464 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:56,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-24 12:24:56,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:56,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:57,127 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 12:24:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-24 12:24:57,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-24 12:24:57,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:57,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 29 [2018-10-24 12:24:57,669 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:57,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-24 12:24:57,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-24 12:24:57,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2018-10-24 12:24:57,671 INFO L87 Difference]: Start difference. First operand 517 states and 640 transitions. Second operand 21 states. [2018-10-24 12:25:00,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:25:00,893 INFO L93 Difference]: Finished difference Result 4228 states and 5349 transitions. [2018-10-24 12:25:00,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 12:25:00,903 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 101 [2018-10-24 12:25:00,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:25:00,917 INFO L225 Difference]: With dead ends: 4228 [2018-10-24 12:25:00,917 INFO L226 Difference]: Without dead ends: 3743 [2018-10-24 12:25:00,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=215, Invalid=1345, Unknown=0, NotChecked=0, Total=1560 [2018-10-24 12:25:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2018-10-24 12:25:01,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 599. [2018-10-24 12:25:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-10-24 12:25:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 742 transitions. [2018-10-24 12:25:01,156 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 742 transitions. Word has length 101 [2018-10-24 12:25:01,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:25:01,157 INFO L481 AbstractCegarLoop]: Abstraction has 599 states and 742 transitions. [2018-10-24 12:25:01,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-24 12:25:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 742 transitions. [2018-10-24 12:25:01,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-24 12:25:01,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:25:01,159 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 6, 6, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:25:01,160 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:25:01,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:25:01,160 INFO L82 PathProgramCache]: Analyzing trace with hash -604874572, now seen corresponding path program 1 times [2018-10-24 12:25:01,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:25:01,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:01,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:25:01,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:01,161 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:25:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-10-24 12:25:01,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:01,459 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:25:01,459 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2018-10-24 12:25:01,459 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [26], [29], [31], [35], [39], [42], [44], [48], [51], [53], [56], [58], [60], [64], [68], [72], [74], [77], [79], [83], [86], [88], [91], [95], [99], [106], [109], [111], [117], [118], [119], [121] [2018-10-24 12:25:01,461 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:25:01,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:25:01,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:25:01,775 INFO L272 AbstractInterpreter]: Visited 41 different actions 207 times. Merged at 30 different actions 115 times. Widened at 4 different actions 10 times. Found 28 fixpoints after 14 different actions. Largest state had 54 variables. [2018-10-24 12:25:01,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:25:01,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:25:01,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:01,811 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:25:01,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:25:01,825 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:25:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:01,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:25:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 158 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-24 12:25:02,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:25:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-24 12:25:02,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:25:02,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 8] total 24 [2018-10-24 12:25:02,199 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:25:02,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-24 12:25:02,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-24 12:25:02,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-10-24 12:25:02,200 INFO L87 Difference]: Start difference. First operand 599 states and 742 transitions. Second operand 18 states. [2018-10-24 12:25:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:25:08,743 INFO L93 Difference]: Finished difference Result 5564 states and 7238 transitions. [2018-10-24 12:25:08,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-24 12:25:08,747 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 104 [2018-10-24 12:25:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:25:08,764 INFO L225 Difference]: With dead ends: 5564 [2018-10-24 12:25:08,765 INFO L226 Difference]: Without dead ends: 5000 [2018-10-24 12:25:08,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1775 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=670, Invalid=6302, Unknown=0, NotChecked=0, Total=6972 [2018-10-24 12:25:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5000 states. [2018-10-24 12:25:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5000 to 602. [2018-10-24 12:25:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-24 12:25:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 744 transitions. [2018-10-24 12:25:09,061 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 744 transitions. Word has length 104 [2018-10-24 12:25:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:25:09,061 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 744 transitions. [2018-10-24 12:25:09,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-24 12:25:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 744 transitions. [2018-10-24 12:25:09,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 12:25:09,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:25:09,064 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 7, 7, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:25:09,064 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:25:09,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:25:09,064 INFO L82 PathProgramCache]: Analyzing trace with hash -143387361, now seen corresponding path program 6 times [2018-10-24 12:25:09,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:25:09,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:09,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:25:09,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:09,065 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:25:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-10-24 12:25:09,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:09,338 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:25:09,338 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:25:09,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:25:09,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:09,338 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:25:09,345 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:25:09,346 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:25:09,431 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:25:09,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:25:09,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:25:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 3 proven. 209 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-24 12:25:09,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:25:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 3 proven. 72 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-10-24 12:25:09,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:25:09,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 9] total 23 [2018-10-24 12:25:09,860 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:25:09,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-24 12:25:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-24 12:25:09,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-10-24 12:25:09,861 INFO L87 Difference]: Start difference. First operand 602 states and 744 transitions. Second operand 16 states. [2018-10-24 12:25:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:25:15,354 INFO L93 Difference]: Finished difference Result 4556 states and 5903 transitions. [2018-10-24 12:25:15,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-24 12:25:15,355 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 115 [2018-10-24 12:25:15,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:25:15,367 INFO L225 Difference]: With dead ends: 4556 [2018-10-24 12:25:15,367 INFO L226 Difference]: Without dead ends: 4113 [2018-10-24 12:25:15,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=583, Invalid=4529, Unknown=0, NotChecked=0, Total=5112 [2018-10-24 12:25:15,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2018-10-24 12:25:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 685. [2018-10-24 12:25:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2018-10-24 12:25:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 847 transitions. [2018-10-24 12:25:15,604 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 847 transitions. Word has length 115 [2018-10-24 12:25:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:25:15,605 INFO L481 AbstractCegarLoop]: Abstraction has 685 states and 847 transitions. [2018-10-24 12:25:15,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-24 12:25:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 847 transitions. [2018-10-24 12:25:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-24 12:25:15,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:25:15,608 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 8, 8, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:25:15,608 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:25:15,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:25:15,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1974424065, now seen corresponding path program 7 times [2018-10-24 12:25:15,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:25:15,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:15,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:25:15,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:15,609 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:25:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 2 proven. 98 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-10-24 12:25:16,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:16,575 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:25:16,575 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:25:16,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:25:16,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:16,575 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:25:16,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:25:16,584 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:25:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:16,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:25:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 3 proven. 244 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-24 12:25:16,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:25:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 3 proven. 98 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-10-24 12:25:17,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:25:17,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 10] total 26 [2018-10-24 12:25:17,178 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:25:17,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-24 12:25:17,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-24 12:25:17,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-10-24 12:25:17,179 INFO L87 Difference]: Start difference. First operand 685 states and 847 transitions. Second operand 18 states. [2018-10-24 12:25:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:25:23,881 INFO L93 Difference]: Finished difference Result 5646 states and 7293 transitions. [2018-10-24 12:25:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-24 12:25:23,882 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 123 [2018-10-24 12:25:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:25:23,900 INFO L225 Difference]: With dead ends: 5646 [2018-10-24 12:25:23,901 INFO L226 Difference]: Without dead ends: 5147 [2018-10-24 12:25:23,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2041 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=746, Invalid=7264, Unknown=0, NotChecked=0, Total=8010 [2018-10-24 12:25:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5147 states. [2018-10-24 12:25:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5147 to 769. [2018-10-24 12:25:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-10-24 12:25:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 952 transitions. [2018-10-24 12:25:24,196 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 952 transitions. Word has length 123 [2018-10-24 12:25:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:25:24,196 INFO L481 AbstractCegarLoop]: Abstraction has 769 states and 952 transitions. [2018-10-24 12:25:24,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-24 12:25:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 952 transitions. [2018-10-24 12:25:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-24 12:25:24,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:25:24,199 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:25:24,199 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:25:24,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:25:24,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1691602911, now seen corresponding path program 8 times [2018-10-24 12:25:24,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:25:24,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:24,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:25:24,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:24,201 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:25:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 3 proven. 128 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-10-24 12:25:25,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:25,172 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:25:25,172 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:25:25,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:25:25,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:25,173 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:25:25,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:25:25,184 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:25:25,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-24 12:25:25,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:25:25,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:25:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-24 12:25:26,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:25:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-24 12:25:27,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:25:27,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 22] total 51 [2018-10-24 12:25:27,426 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:25:27,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-24 12:25:27,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-24 12:25:27,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2413, Unknown=0, NotChecked=0, Total=2550 [2018-10-24 12:25:27,428 INFO L87 Difference]: Start difference. First operand 769 states and 952 transitions. Second operand 31 states. [2018-10-24 12:25:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:25:43,913 INFO L93 Difference]: Finished difference Result 2545 states and 3218 transitions. [2018-10-24 12:25:43,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-10-24 12:25:43,914 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 131 [2018-10-24 12:25:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:25:43,919 INFO L225 Difference]: With dead ends: 2545 [2018-10-24 12:25:43,919 INFO L226 Difference]: Without dead ends: 1959 [2018-10-24 12:25:43,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14167 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1196, Invalid=44386, Unknown=0, NotChecked=0, Total=45582 [2018-10-24 12:25:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2018-10-24 12:25:44,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1035. [2018-10-24 12:25:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-10-24 12:25:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1271 transitions. [2018-10-24 12:25:44,436 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1271 transitions. Word has length 131 [2018-10-24 12:25:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:25:44,437 INFO L481 AbstractCegarLoop]: Abstraction has 1035 states and 1271 transitions. [2018-10-24 12:25:44,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-24 12:25:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1271 transitions. [2018-10-24 12:25:44,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-24 12:25:44,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:25:44,440 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:25:44,440 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:25:44,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:25:44,440 INFO L82 PathProgramCache]: Analyzing trace with hash -800145240, now seen corresponding path program 9 times [2018-10-24 12:25:44,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:25:44,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:44,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:25:44,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:44,441 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:25:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 3 proven. 162 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-10-24 12:25:45,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:45,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:25:45,066 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:25:45,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:25:45,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:45,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:25:45,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:25:45,075 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:25:45,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:25:45,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:25:45,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:25:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 3 proven. 317 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-24 12:25:45,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:25:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 3 proven. 162 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-10-24 12:25:45,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:25:45,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22, 12] total 32 [2018-10-24 12:25:45,682 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:25:45,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-24 12:25:45,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-24 12:25:45,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2018-10-24 12:25:45,683 INFO L87 Difference]: Start difference. First operand 1035 states and 1271 transitions. Second operand 22 states. [2018-10-24 12:25:59,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:25:59,553 INFO L93 Difference]: Finished difference Result 9829 states and 12421 transitions. [2018-10-24 12:25:59,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-24 12:25:59,553 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 135 [2018-10-24 12:25:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:25:59,569 INFO L225 Difference]: With dead ends: 9829 [2018-10-24 12:25:59,569 INFO L226 Difference]: Without dead ends: 9404 [2018-10-24 12:25:59,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4995 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1066, Invalid=16226, Unknown=0, NotChecked=0, Total=17292 [2018-10-24 12:25:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9404 states. [2018-10-24 12:26:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9404 to 1075. [2018-10-24 12:26:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-10-24 12:26:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1321 transitions. [2018-10-24 12:26:00,234 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1321 transitions. Word has length 135 [2018-10-24 12:26:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:26:00,234 INFO L481 AbstractCegarLoop]: Abstraction has 1075 states and 1321 transitions. [2018-10-24 12:26:00,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-24 12:26:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1321 transitions. [2018-10-24 12:26:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-24 12:26:00,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:26:00,237 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:26:00,238 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:26:00,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:26:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash 803349745, now seen corresponding path program 10 times [2018-10-24 12:26:00,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:26:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:00,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:26:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:00,239 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:26:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:26:01,101 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-10-24 12:26:03,024 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 32 proven. 130 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2018-10-24 12:26:03,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:03,025 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:26:03,025 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:26:03,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:26:03,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:03,025 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:26:03,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:26:03,032 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:26:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:26:03,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:26:03,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-24 12:26:03,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:03,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2018-10-24 12:26:03,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-10-24 12:26:03,446 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,447 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 73 [2018-10-24 12:26:03,456 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,457 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,457 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,458 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 103 [2018-10-24 12:26:03,464 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,465 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,465 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,466 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,467 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,468 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 149 [2018-10-24 12:26:03,475 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,476 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,477 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,478 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,479 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,480 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,482 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,483 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 211 [2018-10-24 12:26:03,494 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,496 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,498 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,500 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,503 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,505 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,506 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,507 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 289 [2018-10-24 12:26:03,553 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,574 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,595 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,620 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,623 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,625 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,629 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,633 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,635 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,638 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,640 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,643 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,643 INFO L303 Elim1Store]: Index analysis took 128 ms [2018-10-24 12:26:03,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 383 [2018-10-24 12:26:03,655 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,658 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,658 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,659 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,661 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,662 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,663 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,664 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,666 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,667 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,668 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,669 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 56 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 493 [2018-10-24 12:26:03,722 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,744 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,766 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,787 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,808 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,833 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,858 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,883 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,894 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,917 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,943 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:03,968 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,000 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,022 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,043 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,049 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,049 INFO L303 Elim1Store]: Index analysis took 369 ms [2018-10-24 12:26:04,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 72 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 619 [2018-10-24 12:26:04,101 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,128 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,144 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,146 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,148 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,150 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,152 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,153 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,154 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,156 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,158 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,160 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,161 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,165 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,166 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,168 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,169 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,170 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-10-24 12:26:04,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 90 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 347 treesize of output 761 [2018-10-24 12:26:04,222 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,245 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,267 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,277 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,279 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,281 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,282 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,283 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,284 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,285 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,288 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,289 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,290 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,291 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,292 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,294 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,296 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:04,296 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-10-24 12:26:04,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 110 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 1026 [2018-10-24 12:26:04,302 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:04,978 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,096 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,222 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,295 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,354 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,402 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,443 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,478 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,504 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:05,593 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 3 variables, input treesize:79, output treesize:111 [2018-10-24 12:26:05,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-24 12:26:05,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:26:05,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:05,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-24 12:26:05,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-24 12:26:05,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:26:05,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:05,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:05,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:111 [2018-10-24 12:26:06,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-24 12:26:06,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:26:06,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:06,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:06,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:06,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-24 12:26:06,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-24 12:26:06,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:26:06,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:06,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:06,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:06,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-24 12:26:06,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-24 12:26:06,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:26:06,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:06,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:06,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:06,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-24 12:26:07,619 WARN L179 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-10-24 12:26:07,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-24 12:26:07,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:26:07,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:07,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:07,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:07,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-24 12:26:07,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-24 12:26:07,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:26:07,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:07,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:08,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:08,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-24 12:26:08,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-24 12:26:08,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:26:08,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:08,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:08,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:08,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:111 [2018-10-24 12:26:08,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-24 12:26:08,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:26:08,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:08,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:08,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:08,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:108 [2018-10-24 12:26:08,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-10-24 12:26:08,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:26:08,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:08,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:08,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:08,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:108 [2018-10-24 12:26:08,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 110 [2018-10-24 12:26:08,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-24 12:26:08,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:08,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:08,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:26:08,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:124, output treesize:111 [2018-10-24 12:26:09,881 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2018-10-24 12:26:13,369 WARN L179 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-10-24 12:26:15,625 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-10-24 12:26:15,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 99 [2018-10-24 12:26:15,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-10-24 12:26:15,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:16,055 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,056 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,056 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,081 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,104 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,124 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,125 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,125 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,126 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,127 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,127 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,128 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,132 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,134 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,135 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,136 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,137 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,138 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,139 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,140 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,141 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,143 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,144 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,145 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,146 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,147 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,148 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,150 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,152 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,154 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,155 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,156 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,157 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,158 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,159 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,160 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,161 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,162 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,164 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,165 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,166 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,167 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,168 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,169 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,170 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,172 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,173 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,174 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,175 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,176 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,177 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,178 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,179 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,181 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,182 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,183 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,184 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,185 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,186 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,187 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,189 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,190 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,192 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,193 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,194 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,196 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,197 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,198 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,203 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,204 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,205 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,206 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,207 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,209 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,210 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,211 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,212 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,213 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,214 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,216 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,217 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,218 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,219 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,221 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,222 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,224 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,226 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,227 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,229 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,230 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,233 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,235 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,237 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,242 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,242 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,243 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:26:16,243 INFO L303 Elim1Store]: Index analysis took 191 ms [2018-10-24 12:26:16,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 110 disjoint index pairs (out of 55 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 483 [2018-10-24 12:26:16,246 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:16,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:16,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:16,453 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:134, output treesize:7 [2018-10-24 12:26:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 64 proven. 421 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:26:16,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:28:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 73 proven. 383 refuted. 32 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 12:28:21,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:28:21,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 37, 52] total 105 [2018-10-24 12:28:21,754 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:28:21,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-24 12:28:21,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-24 12:28:21,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1813, Invalid=9054, Unknown=53, NotChecked=0, Total=10920 [2018-10-24 12:28:21,756 INFO L87 Difference]: Start difference. First operand 1075 states and 1321 transitions. Second operand 55 states. Received shutdown request... [2018-10-24 12:28:22,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:28:22,603 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 12:28:22,607 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 12:28:22,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:28:22 BoogieIcfgContainer [2018-10-24 12:28:22,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:28:22,608 INFO L168 Benchmark]: Toolchain (without parser) took 250572.23 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 287.5 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:22,609 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:28:22,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:22,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:28:22,609 INFO L168 Benchmark]: Boogie Preprocessor took 69.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:28:22,611 INFO L168 Benchmark]: RCFGBuilder took 830.69 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -747.3 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:22,611 INFO L168 Benchmark]: TraceAbstraction took 249197.87 ms. Allocated memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: 681.1 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -375.1 MB). Peak memory consumption was 306.0 MB. Max. memory is 7.1 GB. [2018-10-24 12:28:22,614 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 394.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 830.69 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -747.3 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249197.87 ms. Allocated memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: 681.1 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -375.1 MB). Peak memory consumption was 306.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (1075states) and FLOYD_HOARE automaton (currently 5 states, 55 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. TIMEOUT Result, 249.1s OverallTime, 21 OverallIterations, 11 TraceHistogramMax, 80.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5266 SDtfs, 10237 SDslu, 74944 SDs, 0 SdLazy, 59683 SolverSat, 1955 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 4177 GetRequests, 3034 SyntacticMatches, 30 SemanticMatches, 1112 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 35498 ImplicationChecksByTransitivity, 165.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1075occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 7 AbstIntIterations, 1 AbstIntStrong, 0.7492611075199309 AbsIntWeakeningRatio, 1.96 AbsIntAvgWeakeningVarsNumRemoved, 10.2 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 34420 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 158.3s InterpolantComputationTime, 3009 NumberOfCodeBlocks, 2984 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 4402 ConstructedInterpolants, 154 QuantifiedInterpolants, 4547872 SizeOfPredicates, 173 NumberOfNonLiveVariables, 6805 ConjunctsInSsa, 673 ConjunctsInUnsatCore, 55 InterpolantComputations, 8 PerfectInterpolantSequences, 4784/9118 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown