java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:01:15,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:01:15,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:01:15,275 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:01:15,276 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:01:15,277 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:01:15,278 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:01:15,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:01:15,281 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:01:15,282 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:01:15,283 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:01:15,283 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:01:15,284 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:01:15,285 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:01:15,287 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:01:15,288 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:01:15,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:01:15,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:01:15,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:01:15,300 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:01:15,302 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:01:15,304 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:01:15,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:01:15,311 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:01:15,311 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:01:15,312 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:01:15,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:01:15,313 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:01:15,314 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:01:15,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:01:15,315 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:01:15,316 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:01:15,316 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:01:15,316 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:01:15,317 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:01:15,318 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:01:15,318 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:01:15,332 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:01:15,333 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:01:15,333 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:01:15,334 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:01:15,334 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:01:15,334 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:01:15,334 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:01:15,334 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:01:15,335 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:01:15,335 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:01:15,335 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:01:15,335 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:01:15,335 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:01:15,336 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:01:15,336 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:01:15,336 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:01:15,337 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:01:15,337 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:01:15,337 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:01:15,337 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:01:15,337 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:01:15,338 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:01:15,338 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:01:15,338 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:01:15,338 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:01:15,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:01:15,339 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:01:15,339 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:01:15,339 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:01:15,339 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:01:15,339 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:01:15,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:01:15,340 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:01:15,340 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:01:15,340 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:01:15,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:01:15,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:01:15,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:01:15,407 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:01:15,407 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:01:15,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-11-07 22:01:15,473 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c1c112e/069895efc58e41c180cafe8fb6bbeed0/FLAG98facf34d [2018-11-07 22:01:15,963 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:01:15,964 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-11-07 22:01:15,970 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c1c112e/069895efc58e41c180cafe8fb6bbeed0/FLAG98facf34d [2018-11-07 22:01:15,982 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c1c112e/069895efc58e41c180cafe8fb6bbeed0 [2018-11-07 22:01:15,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:01:15,993 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:01:15,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:01:15,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:01:15,998 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:01:15,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:01:15" (1/1) ... [2018-11-07 22:01:16,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e926fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:16, skipping insertion in model container [2018-11-07 22:01:16,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:01:15" (1/1) ... [2018-11-07 22:01:16,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:01:16,030 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:01:16,248 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:01:16,259 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:01:16,291 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:01:16,318 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:01:16,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:16 WrapperNode [2018-11-07 22:01:16,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:01:16,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:01:16,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:01:16,320 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:01:16,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:16" (1/1) ... [2018-11-07 22:01:16,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:16" (1/1) ... [2018-11-07 22:01:16,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:01:16,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:01:16,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:01:16,351 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:01:16,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:16" (1/1) ... [2018-11-07 22:01:16,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:16" (1/1) ... [2018-11-07 22:01:16,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:16" (1/1) ... [2018-11-07 22:01:16,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:16" (1/1) ... [2018-11-07 22:01:16,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:16" (1/1) ... [2018-11-07 22:01:16,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:16" (1/1) ... [2018-11-07 22:01:16,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:16" (1/1) ... [2018-11-07 22:01:16,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:01:16,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:01:16,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:01:16,412 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:01:16,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:01:16,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 22:01:16,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:01:16,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:01:16,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 22:01:16,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:01:16,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:01:16,561 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-11-07 22:01:16,562 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-11-07 22:01:16,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:01:16,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:01:16,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 22:01:16,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-07 22:01:16,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:01:16,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:01:16,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 22:01:17,048 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:01:17,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:01:17 BoogieIcfgContainer [2018-11-07 22:01:17,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:01:17,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:01:17,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:01:17,053 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:01:17,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:01:15" (1/3) ... [2018-11-07 22:01:17,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453fd961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:01:17, skipping insertion in model container [2018-11-07 22:01:17,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:16" (2/3) ... [2018-11-07 22:01:17,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453fd961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:01:17, skipping insertion in model container [2018-11-07 22:01:17,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:01:17" (3/3) ... [2018-11-07 22:01:17,057 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-11-07 22:01:17,067 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:01:17,075 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:01:17,089 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:01:17,122 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:01:17,122 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:01:17,122 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:01:17,122 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:01:17,122 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:01:17,123 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:01:17,123 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:01:17,123 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:01:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-07 22:01:17,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 22:01:17,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:17,152 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, 1, 1, 1, 1, 1] [2018-11-07 22:01:17,154 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:17,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:17,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1074107771, now seen corresponding path program 1 times [2018-11-07 22:01:17,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:17,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:17,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:17,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:17,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:01:17,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:01:17,340 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:17,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:01:17,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:01:17,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:01:17,361 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-07 22:01:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:17,389 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-11-07 22:01:17,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:01:17,391 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-11-07 22:01:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:17,399 INFO L225 Difference]: With dead ends: 94 [2018-11-07 22:01:17,400 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 22:01:17,403 INFO L604 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-11-07 22:01:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 22:01:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-07 22:01:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 22:01:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-07 22:01:17,447 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 28 [2018-11-07 22:01:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:17,449 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-07 22:01:17,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:01:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-07 22:01:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 22:01:17,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:17,452 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:17,453 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:17,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:17,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2084935887, now seen corresponding path program 1 times [2018-11-07 22:01:17,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:17,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:17,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:17,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:17,456 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:17,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:01:17,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:01:17,557 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:17,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:01:17,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:01:17,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:01:17,560 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 3 states. [2018-11-07 22:01:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:17,641 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-11-07 22:01:17,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:01:17,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-07 22:01:17,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:17,643 INFO L225 Difference]: With dead ends: 86 [2018-11-07 22:01:17,643 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 22:01:17,646 INFO L604 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-11-07 22:01:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 22:01:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-07 22:01:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 22:01:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-07 22:01:17,655 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 30 [2018-11-07 22:01:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:17,655 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-07 22:01:17,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:01:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-07 22:01:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 22:01:17,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:17,657 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:17,657 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:17,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash -537387848, now seen corresponding path program 1 times [2018-11-07 22:01:17,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:17,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:17,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:17,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:17,659 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:17,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:17,739 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:17,740 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-07 22:01:17,742 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [16], [19], [54], [55], [56], [60], [63], [65], [66], [68], [73], [77], [82], [83], [94], [97], [99], [105], [106], [107], [109], [110], [111] [2018-11-07 22:01:17,776 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:01:17,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:01:17,988 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 22:01:17,989 INFO L272 AbstractInterpreter]: Visited 23 different actions 48 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-11-07 22:01:18,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:18,004 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 22:01:18,116 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 72.77% of their original sizes. [2018-11-07 22:01:18,117 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 22:01:18,433 INFO L415 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-11-07 22:01:18,433 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 22:01:18,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:01:18,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2018-11-07 22:01:18,434 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:18,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:01:18,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:01:18,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 22:01:18,436 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 8 states. [2018-11-07 22:01:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:19,273 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-11-07 22:01:19,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:01:19,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-07 22:01:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:19,277 INFO L225 Difference]: With dead ends: 88 [2018-11-07 22:01:19,277 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 22:01:19,278 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:01:19,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 22:01:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 54. [2018-11-07 22:01:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 22:01:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-07 22:01:19,291 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 34 [2018-11-07 22:01:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:19,292 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-07 22:01:19,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:01:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-07 22:01:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 22:01:19,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:19,294 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:19,294 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:19,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:19,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1292749679, now seen corresponding path program 1 times [2018-11-07 22:01:19,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:19,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:19,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:19,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:19,296 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 22:01:19,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:19,358 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:19,358 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-07 22:01:19,358 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [16], [19], [21], [25], [28], [43], [44], [45], [46], [47], [48], [50], [54], [55], [56], [60], [63], [65], [66], [68], [73], [77], [82], [83], [94], [97], [99], [105], [106], [107], [109], [110], [111] [2018-11-07 22:01:19,361 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:01:19,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:01:19,413 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 22:01:19,413 INFO L272 AbstractInterpreter]: Visited 26 different actions 51 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-11-07 22:01:19,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:19,446 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 22:01:19,497 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 57.75% of their original sizes. [2018-11-07 22:01:19,497 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 22:01:19,646 INFO L415 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-11-07 22:01:19,647 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 22:01:19,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:01:19,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-11-07 22:01:19,647 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:19,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 22:01:19,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 22:01:19,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:01:19,648 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 10 states. [2018-11-07 22:01:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:20,676 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-07 22:01:20,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:01:20,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-07 22:01:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:20,679 INFO L225 Difference]: With dead ends: 109 [2018-11-07 22:01:20,679 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 22:01:20,680 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:01:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 22:01:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 56. [2018-11-07 22:01:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 22:01:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-07 22:01:20,689 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 45 [2018-11-07 22:01:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:20,690 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-07 22:01:20,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 22:01:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-07 22:01:20,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 22:01:20,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:20,692 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:20,692 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:20,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:20,693 INFO L82 PathProgramCache]: Analyzing trace with hash -735946969, now seen corresponding path program 1 times [2018-11-07 22:01:20,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:20,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:20,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:20,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:20,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:01:20,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:20,771 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:20,771 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-07 22:01:20,772 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [16], [19], [21], [25], [28], [30], [31], [32], [35], [39], [43], [44], [45], [46], [47], [48], [50], [54], [55], [56], [60], [63], [65], [66], [68], [73], [77], [82], [83], [94], [97], [99], [105], [106], [107], [109], [110], [111] [2018-11-07 22:01:20,774 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:01:20,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:01:20,863 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:01:20,863 INFO L272 AbstractInterpreter]: Visited 48 different actions 137 times. Merged at 20 different actions 75 times. Widened at 3 different actions 3 times. Found 5 fixpoints after 4 different actions. Largest state had 26 variables. [2018-11-07 22:01:20,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:20,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:01:20,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:20,904 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:20,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:20,921 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:01:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:20,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:01:21,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:01:21,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:21,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 22:01:21,113 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:21,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 22:01:21,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 22:01:21,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:01:21,114 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2018-11-07 22:01:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:21,172 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-07 22:01:21,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 22:01:21,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-07 22:01:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:21,175 INFO L225 Difference]: With dead ends: 98 [2018-11-07 22:01:21,175 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 22:01:21,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:01:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 22:01:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-07 22:01:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 22:01:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-07 22:01:21,184 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 51 [2018-11-07 22:01:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:21,185 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-07 22:01:21,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 22:01:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-07 22:01:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-07 22:01:21,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:21,187 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:21,187 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:21,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:21,188 INFO L82 PathProgramCache]: Analyzing trace with hash -310563840, now seen corresponding path program 2 times [2018-11-07 22:01:21,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:21,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:21,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:21,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:21,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:01:21,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:21,385 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:21,385 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:21,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:21,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:21,386 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:21,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:01:21,398 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:01:21,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 22:01:21,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:01:21,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 22:01:21,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 22:01:21,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:21,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2018-11-07 22:01:21,975 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:21,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:01:21,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:01:21,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:01:21,977 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 8 states. [2018-11-07 22:01:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:22,218 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-11-07 22:01:22,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:01:22,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-11-07 22:01:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:22,221 INFO L225 Difference]: With dead ends: 130 [2018-11-07 22:01:22,221 INFO L226 Difference]: Without dead ends: 94 [2018-11-07 22:01:22,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:01:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-07 22:01:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2018-11-07 22:01:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-07 22:01:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-11-07 22:01:22,232 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 55 [2018-11-07 22:01:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:22,232 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-11-07 22:01:22,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:01:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-11-07 22:01:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-07 22:01:22,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:22,235 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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, 1, 1, 1] [2018-11-07 22:01:22,235 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:22,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:22,235 INFO L82 PathProgramCache]: Analyzing trace with hash -893647280, now seen corresponding path program 3 times [2018-11-07 22:01:22,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:22,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:22,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:01:22,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:22,237 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 22:01:22,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:22,554 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:22,554 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:22,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:22,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:22,554 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:22,564 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:01:22,564 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:01:22,607 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:01:22,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:01:22,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 22:01:22,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 22:01:22,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:22,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2018-11-07 22:01:22,855 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:22,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:01:22,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:01:22,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:01:22,857 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 6 states. [2018-11-07 22:01:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:22,927 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2018-11-07 22:01:22,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:01:22,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-07 22:01:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:22,930 INFO L225 Difference]: With dead ends: 136 [2018-11-07 22:01:22,930 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 22:01:22,932 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:01:22,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 22:01:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-11-07 22:01:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-07 22:01:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-11-07 22:01:22,950 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 70 [2018-11-07 22:01:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:22,951 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-11-07 22:01:22,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:01:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-11-07 22:01:22,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 22:01:22,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:22,953 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 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, 1, 1, 1] [2018-11-07 22:01:22,953 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:22,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:22,953 INFO L82 PathProgramCache]: Analyzing trace with hash -858298153, now seen corresponding path program 4 times [2018-11-07 22:01:22,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:22,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:22,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:01:22,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:22,955 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 22:01:23,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:23,076 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:23,077 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:23,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:23,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:23,077 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:23,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:23,086 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:01:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:23,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 22:01:23,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 22:01:23,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:23,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-11-07 22:01:23,328 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:23,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:01:23,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:01:23,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:01:23,329 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 7 states. [2018-11-07 22:01:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:23,524 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2018-11-07 22:01:23,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:01:23,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-07 22:01:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:23,526 INFO L225 Difference]: With dead ends: 162 [2018-11-07 22:01:23,526 INFO L226 Difference]: Without dead ends: 111 [2018-11-07 22:01:23,527 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:01:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-07 22:01:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2018-11-07 22:01:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 22:01:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-11-07 22:01:23,538 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 74 [2018-11-07 22:01:23,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:23,538 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-11-07 22:01:23,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:01:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-07 22:01:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-07 22:01:23,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:23,540 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 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, 1, 1, 1] [2018-11-07 22:01:23,541 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:23,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:23,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1243598882, now seen corresponding path program 5 times [2018-11-07 22:01:23,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:23,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:23,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:23,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:23,543 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-07 22:01:23,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:23,792 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:23,793 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:23,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:23,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:23,793 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:23,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:01:23,804 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:01:23,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:01:23,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:01:23,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-07 22:01:23,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-07 22:01:24,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:24,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2018-11-07 22:01:24,133 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:24,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 22:01:24,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 22:01:24,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:01:24,134 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 11 states. [2018-11-07 22:01:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:24,358 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2018-11-07 22:01:24,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:01:24,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-11-07 22:01:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:24,361 INFO L225 Difference]: With dead ends: 164 [2018-11-07 22:01:24,361 INFO L226 Difference]: Without dead ends: 125 [2018-11-07 22:01:24,362 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:01:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-07 22:01:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2018-11-07 22:01:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 22:01:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-11-07 22:01:24,372 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 78 [2018-11-07 22:01:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:24,372 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-11-07 22:01:24,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 22:01:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-11-07 22:01:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 22:01:24,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:24,375 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2018-11-07 22:01:24,375 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:24,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:24,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1357170623, now seen corresponding path program 6 times [2018-11-07 22:01:24,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:24,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:24,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:01:24,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:24,377 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-07 22:01:24,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:01:24,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:01:24,640 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:24,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:01:24,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:01:24,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:01:24,642 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 5 states. [2018-11-07 22:01:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:25,215 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2018-11-07 22:01:25,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:01:25,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-11-07 22:01:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:25,220 INFO L225 Difference]: With dead ends: 170 [2018-11-07 22:01:25,220 INFO L226 Difference]: Without dead ends: 131 [2018-11-07 22:01:25,221 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:01:25,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-07 22:01:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2018-11-07 22:01:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-07 22:01:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-11-07 22:01:25,233 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 95 [2018-11-07 22:01:25,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:25,233 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-11-07 22:01:25,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:01:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-11-07 22:01:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 22:01:25,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:25,236 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-07 22:01:25,236 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:25,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:25,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2060814037, now seen corresponding path program 7 times [2018-11-07 22:01:25,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:25,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:25,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:01:25,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:25,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-07 22:01:25,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:25,462 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:25,462 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:25,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:25,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:25,462 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:25,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:25,476 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:01:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:25,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-07 22:01:25,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-07 22:01:25,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:25,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 18 [2018-11-07 22:01:25,892 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:25,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 22:01:25,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 22:01:25,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:01:25,893 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 13 states. [2018-11-07 22:01:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:26,385 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2018-11-07 22:01:26,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:01:26,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 101 [2018-11-07 22:01:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:26,387 INFO L225 Difference]: With dead ends: 198 [2018-11-07 22:01:26,387 INFO L226 Difference]: Without dead ends: 131 [2018-11-07 22:01:26,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-11-07 22:01:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-07 22:01:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-11-07 22:01:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-07 22:01:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2018-11-07 22:01:26,405 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 101 [2018-11-07 22:01:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:26,406 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2018-11-07 22:01:26,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 22:01:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2018-11-07 22:01:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 22:01:26,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:26,407 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-07 22:01:26,407 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:26,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:26,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2079477055, now seen corresponding path program 8 times [2018-11-07 22:01:26,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:26,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:26,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:26,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:26,412 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 46 proven. 44 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-07 22:01:26,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:26,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:26,879 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:26,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:26,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:26,880 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:26,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:01:26,888 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:01:26,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 22:01:26,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:01:26,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 22:01:27,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 22:01:27,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:27,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 20 [2018-11-07 22:01:27,665 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:27,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 22:01:27,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 22:01:27,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-11-07 22:01:27,666 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand 14 states. [2018-11-07 22:01:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:28,895 INFO L93 Difference]: Finished difference Result 316 states and 362 transitions. [2018-11-07 22:01:28,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 22:01:28,895 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2018-11-07 22:01:28,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:28,898 INFO L225 Difference]: With dead ends: 316 [2018-11-07 22:01:28,898 INFO L226 Difference]: Without dead ends: 266 [2018-11-07 22:01:28,900 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=756, Invalid=1896, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 22:01:28,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-07 22:01:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 187. [2018-11-07 22:01:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-07 22:01:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 207 transitions. [2018-11-07 22:01:28,914 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 207 transitions. Word has length 107 [2018-11-07 22:01:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:28,914 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 207 transitions. [2018-11-07 22:01:28,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 22:01:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 207 transitions. [2018-11-07 22:01:28,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 22:01:28,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:28,916 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-11-07 22:01:28,917 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:28,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:28,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1662210968, now seen corresponding path program 9 times [2018-11-07 22:01:28,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:28,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:28,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:01:28,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:28,918 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-11-07 22:01:29,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:29,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:29,051 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:29,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:29,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:29,051 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:29,059 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:01:29,060 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:01:29,101 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:01:29,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:01:29,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 132 proven. 24 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-07 22:01:29,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 132 proven. 24 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-07 22:01:29,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:29,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 17 [2018-11-07 22:01:29,434 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:29,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 22:01:29,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 22:01:29,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:01:29,435 INFO L87 Difference]: Start difference. First operand 187 states and 207 transitions. Second operand 11 states. [2018-11-07 22:01:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:29,731 INFO L93 Difference]: Finished difference Result 324 states and 362 transitions. [2018-11-07 22:01:29,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:01:29,732 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 142 [2018-11-07 22:01:29,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:29,734 INFO L225 Difference]: With dead ends: 324 [2018-11-07 22:01:29,734 INFO L226 Difference]: Without dead ends: 197 [2018-11-07 22:01:29,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 276 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:01:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-07 22:01:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2018-11-07 22:01:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-07 22:01:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-11-07 22:01:29,748 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 142 [2018-11-07 22:01:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:29,749 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-11-07 22:01:29,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 22:01:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-11-07 22:01:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 22:01:29,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:29,751 INFO L375 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-11-07 22:01:29,751 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:29,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:29,751 INFO L82 PathProgramCache]: Analyzing trace with hash -800280201, now seen corresponding path program 10 times [2018-11-07 22:01:29,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:29,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:29,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:01:29,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:29,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:29,925 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 307 proven. 30 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-11-07 22:01:29,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:29,925 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:29,926 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:29,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:29,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:29,926 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:29,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:29,935 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:01:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:29,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 212 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 22:01:30,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 212 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 22:01:30,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:30,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2018-11-07 22:01:30,494 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:30,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 22:01:30,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 22:01:30,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:01:30,495 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 15 states. [2018-11-07 22:01:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:31,197 INFO L93 Difference]: Finished difference Result 326 states and 363 transitions. [2018-11-07 22:01:31,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 22:01:31,197 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 159 [2018-11-07 22:01:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:31,199 INFO L225 Difference]: With dead ends: 326 [2018-11-07 22:01:31,199 INFO L226 Difference]: Without dead ends: 222 [2018-11-07 22:01:31,201 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 316 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=1130, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 22:01:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-07 22:01:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 210. [2018-11-07 22:01:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 22:01:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 230 transitions. [2018-11-07 22:01:31,215 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 230 transitions. Word has length 159 [2018-11-07 22:01:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:31,216 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 230 transitions. [2018-11-07 22:01:31,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 22:01:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 230 transitions. [2018-11-07 22:01:31,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-07 22:01:31,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:31,218 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-11-07 22:01:31,218 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:31,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:31,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1318567839, now seen corresponding path program 11 times [2018-11-07 22:01:31,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:31,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:31,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:31,220 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-11-07 22:01:31,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:31,968 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:31,968 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:31,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:31,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:31,968 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:31,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:01:31,978 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:01:32,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 22:01:32,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:01:32,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:32,668 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 49 treesize of output 40 [2018-11-07 22:01:32,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:32,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:32,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-11-07 22:01:32,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:32,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:32,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:32,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:42 [2018-11-07 22:01:32,786 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 30 treesize of output 25 [2018-11-07 22:01:32,812 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:32,814 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:32,815 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-07 22:01:32,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:32,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:32,850 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-11-07 22:01:32,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2018-11-07 22:01:33,432 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 45 treesize of output 37 [2018-11-07 22:01:33,445 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:33,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:33,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 111 [2018-11-07 22:01:33,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2018-11-07 22:01:33,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 22:01:33,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-07 22:01:33,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:126 [2018-11-07 22:01:33,836 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-07 22:01:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 274 proven. 47 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-11-07 22:01:34,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:36,834 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 70 treesize of output 60 [2018-11-07 22:01:36,926 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 22:01:36,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:36,929 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 22:01:36,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:36,937 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,938 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:36,939 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,939 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,940 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,941 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,942 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 109 [2018-11-07 22:01:36,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:36,949 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,950 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:36,952 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,952 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,953 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,954 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,955 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,956 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,957 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,959 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,960 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:36,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 154 [2018-11-07 22:01:36,965 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:36,976 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 22:01:36,976 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:36,982 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 22:01:36,982 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:37,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:37,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:37,033 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:103, output treesize:40 [2018-11-07 22:01:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 252 proven. 69 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-11-07 22:01:37,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:37,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27, 26] total 65 [2018-11-07 22:01:37,264 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:37,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 22:01:37,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 22:01:37,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=3763, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 22:01:37,268 INFO L87 Difference]: Start difference. First operand 210 states and 230 transitions. Second operand 41 states. [2018-11-07 22:01:39,469 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2018-11-07 22:01:40,283 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-11-07 22:01:40,572 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-11-07 22:01:42,841 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-11-07 22:01:44,001 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2018-11-07 22:01:45,177 WARN L179 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-07 22:01:46,743 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2018-11-07 22:01:47,210 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-11-07 22:01:47,773 WARN L179 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2018-11-07 22:01:47,990 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2018-11-07 22:01:48,363 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2018-11-07 22:01:48,587 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-11-07 22:01:49,019 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-11-07 22:01:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:53,829 INFO L93 Difference]: Finished difference Result 1081 states and 1210 transitions. [2018-11-07 22:01:53,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-11-07 22:01:53,830 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 165 [2018-11-07 22:01:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:53,836 INFO L225 Difference]: With dead ends: 1081 [2018-11-07 22:01:53,837 INFO L226 Difference]: Without dead ends: 1029 [2018-11-07 22:01:53,846 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8348 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=3472, Invalid=25258, Unknown=0, NotChecked=0, Total=28730 [2018-11-07 22:01:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-11-07 22:01:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 540. [2018-11-07 22:01:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-11-07 22:01:53,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 621 transitions. [2018-11-07 22:01:53,911 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 621 transitions. Word has length 165 [2018-11-07 22:01:53,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:53,911 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 621 transitions. [2018-11-07 22:01:53,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 22:01:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 621 transitions. [2018-11-07 22:01:53,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-07 22:01:53,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:53,914 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 9, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2018-11-07 22:01:53,914 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:53,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:53,915 INFO L82 PathProgramCache]: Analyzing trace with hash 500946348, now seen corresponding path program 1 times [2018-11-07 22:01:53,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:53,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:53,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:01:53,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:53,916 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 1 proven. 284 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-07 22:01:54,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:54,622 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:54,622 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-07 22:01:54,622 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [16], [19], [21], [25], [28], [30], [31], [32], [35], [37], [39], [43], [44], [45], [46], [47], [48], [50], [54], [55], [56], [60], [63], [65], [66], [68], [73], [77], [82], [83], [85], [87], [94], [97], [99], [102], [104], [105], [106], [107], [109], [110], [111], [112] [2018-11-07 22:01:54,625 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:01:54,625 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:01:54,754 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:01:54,755 INFO L272 AbstractInterpreter]: Visited 54 different actions 220 times. Merged at 29 different actions 115 times. Widened at 4 different actions 5 times. Found 14 fixpoints after 8 different actions. Largest state had 26 variables. [2018-11-07 22:01:54,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:54,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:01:54,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:54,793 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:54,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:54,810 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:01:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:54,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:55,521 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 72 treesize of output 59 [2018-11-07 22:01:55,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,533 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,533 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 140 [2018-11-07 22:01:55,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 22:01:55,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:55,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:55,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:49 [2018-11-07 22:01:55,714 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 54 treesize of output 45 [2018-11-07 22:01:55,719 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,721 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,723 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,725 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,727 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,730 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 140 [2018-11-07 22:01:55,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:55,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:55,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:55,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:53 [2018-11-07 22:01:56,172 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 53 treesize of output 41 [2018-11-07 22:01:56,175 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:56,175 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:56,177 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:56,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:56,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:56,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:56,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-11-07 22:01:56,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:56,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:56,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:56,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:9 [2018-11-07 22:01:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 191 proven. 215 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-07 22:01:56,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:02:05,080 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-07 22:02:05,654 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 94 treesize of output 80 [2018-11-07 22:02:05,737 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:05,737 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:05,738 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:05,743 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:05,744 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:05,745 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:05,749 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:05,752 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:05,768 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:05,769 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:05,769 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:05,776 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:05,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 80 treesize of output 262 [2018-11-07 22:02:05,831 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-07 22:02:05,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 27 xjuncts. [2018-11-07 22:02:05,974 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:05,988 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,110 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,123 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,136 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,198 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,200 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,212 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,213 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,214 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,220 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,221 INFO L303 Elim1Store]: Index analysis took 304 ms [2018-11-07 22:02:06,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 265 [2018-11-07 22:02:06,275 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-07 22:02:06,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 36 xjuncts. [2018-11-07 22:02:06,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:06,476 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,488 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,501 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,513 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,557 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,590 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,603 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,688 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,689 INFO L303 Elim1Store]: Index analysis took 263 ms [2018-11-07 22:02:06,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 169 [2018-11-07 22:02:06,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 22:02:06,799 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:06,812 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,825 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,839 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,848 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,860 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,878 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,911 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,949 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:06,989 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,003 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,011 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,036 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,100 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,139 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,140 INFO L303 Elim1Store]: Index analysis took 377 ms [2018-11-07 22:02:07,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 241 [2018-11-07 22:02:07,312 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-07 22:02:07,358 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,371 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,479 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,487 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,500 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,599 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,653 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,750 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,768 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,777 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,884 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:07,884 INFO L303 Elim1Store]: Index analysis took 571 ms [2018-11-07 22:02:08,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 88 treesize of output 269 [2018-11-07 22:02:08,512 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-07 22:02:08,953 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 30 xjuncts. [2018-11-07 22:02:08,978 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:08,988 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,001 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,082 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,096 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,105 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,206 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,244 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,250 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,251 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,252 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,259 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,259 INFO L303 Elim1Store]: Index analysis took 304 ms [2018-11-07 22:02:09,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 83 treesize of output 266 [2018-11-07 22:02:09,317 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-07 22:02:09,474 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 23 xjuncts. [2018-11-07 22:02:09,492 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,501 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,514 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,526 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,539 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,551 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,564 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:09,606 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,615 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,627 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,648 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,657 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,669 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,682 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:09,682 INFO L303 Elim1Store]: Index analysis took 207 ms [2018-11-07 22:02:09,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 154 [2018-11-07 22:02:09,685 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:11,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:02:11,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:02:11,155 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:94, output treesize:83 [2018-11-07 22:02:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 350 proven. 56 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-07 22:02:11,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:02:11,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 21] total 63 [2018-11-07 22:02:11,475 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:02:11,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 22:02:11,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 22:02:11,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3649, Unknown=3, NotChecked=0, Total=3906 [2018-11-07 22:02:11,479 INFO L87 Difference]: Start difference. First operand 540 states and 621 transitions. Second operand 44 states. [2018-11-07 22:02:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:02:17,568 INFO L93 Difference]: Finished difference Result 907 states and 1048 transitions. [2018-11-07 22:02:17,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 22:02:17,568 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 175 [2018-11-07 22:02:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:02:17,572 INFO L225 Difference]: With dead ends: 907 [2018-11-07 22:02:17,572 INFO L226 Difference]: Without dead ends: 632 [2018-11-07 22:02:17,576 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 322 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2857 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=775, Invalid=9728, Unknown=3, NotChecked=0, Total=10506 [2018-11-07 22:02:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-11-07 22:02:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 580. [2018-11-07 22:02:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-11-07 22:02:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 666 transitions. [2018-11-07 22:02:17,630 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 666 transitions. Word has length 175 [2018-11-07 22:02:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:02:17,630 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 666 transitions. [2018-11-07 22:02:17,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 22:02:17,630 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 666 transitions. [2018-11-07 22:02:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-07 22:02:17,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:17,634 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-11-07 22:02:17,634 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:17,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:17,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1646190659, now seen corresponding path program 2 times [2018-11-07 22:02:17,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:17,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:17,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:17,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:17,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:18,800 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-11-07 22:02:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 43 proven. 355 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-07 22:02:19,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:19,615 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:02:19,615 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:02:19,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:02:19,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:19,615 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:02:19,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:02:19,623 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:02:19,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 22:02:19,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:02:19,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:02:19,775 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 6 treesize of output 5 [2018-11-07 22:02:19,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:19,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:19,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-07 22:02:19,840 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-11-07 22:02:19,848 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-11-07 22:02:19,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:19,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:19,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:19,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-07 22:02:19,890 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 21 treesize of output 16 [2018-11-07 22:02:19,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:19,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 23 [2018-11-07 22:02:19,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:19,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:19,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:19,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-07 22:02:19,949 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 30 treesize of output 23 [2018-11-07 22:02:19,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:19,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:19,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:19,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-07 22:02:19,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:19,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:19,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:19,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-11-07 22:02:20,021 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 39 treesize of output 30 [2018-11-07 22:02:20,025 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,025 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,026 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,027 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,028 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,029 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-11-07 22:02:20,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-07 22:02:20,147 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 48 treesize of output 37 [2018-11-07 22:02:20,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,177 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 116 [2018-11-07 22:02:20,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-07 22:02:20,337 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,338 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:20,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-07 22:02:20,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:54 [2018-11-07 22:02:20,416 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 59 treesize of output 60 [2018-11-07 22:02:20,419 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 12 treesize of output 11 [2018-11-07 22:02:20,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,453 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-11-07 22:02:20,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:65 [2018-11-07 22:02:20,535 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 70 treesize of output 69 [2018-11-07 22:02:20,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-07 22:02:20,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-07 22:02:20,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-07 22:02:20,666 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 70 treesize of output 69 [2018-11-07 22:02:20,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-07 22:02:20,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-07 22:02:20,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-07 22:02:20,799 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 70 treesize of output 69 [2018-11-07 22:02:20,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-07 22:02:20,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-07 22:02:20,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-07 22:02:20,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 70 treesize of output 69 [2018-11-07 22:02:20,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-07 22:02:20,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:20,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-07 22:02:20,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:80, output treesize:76 [2018-11-07 22:02:27,078 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-07 22:02:27,108 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 66 treesize of output 56 [2018-11-07 22:02:27,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:27,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:27,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:27,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:27,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:27,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:27,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:27,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:27,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:27,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:27,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 76 [2018-11-07 22:02:27,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:27,169 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 1 case distinctions, treesize of input 19 treesize of output 1 [2018-11-07 22:02:27,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:27,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:27,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:27,178 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:10 [2018-11-07 22:02:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 38 proven. 79 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2018-11-07 22:02:27,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:02:49,953 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 125 [2018-11-07 22:02:49,984 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 115 treesize of output 112 [2018-11-07 22:02:49,987 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:49,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 112 treesize of output 110 [2018-11-07 22:02:49,991 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:49,991 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:49,991 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:49,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 115 [2018-11-07 22:02:50,018 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,031 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,031 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,031 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,032 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,032 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 127 [2018-11-07 22:02:50,037 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,037 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,037 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,038 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,039 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,039 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,040 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,040 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,041 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,041 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 154 [2018-11-07 22:02:50,044 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:50,081 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:50,106 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:50,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:50,144 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:50,166 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 92 treesize of output 78 [2018-11-07 22:02:50,170 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,170 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,170 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,171 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,173 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,173 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,174 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,176 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,177 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,179 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:50,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 189 [2018-11-07 22:02:51,101 WARN L179 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 818 DAG size of output: 170 [2018-11-07 22:02:51,105 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,106 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,106 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,107 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,108 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,108 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,109 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,109 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,110 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,110 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 103 [2018-11-07 22:02:51,118 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:51,129 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 22:02:51,129 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:51,131 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,132 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,132 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,132 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,133 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,133 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,134 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,135 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,135 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,136 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,136 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 95 [2018-11-07 22:02:51,138 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:51,467 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,467 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,468 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,468 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:02:51,470 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,471 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,471 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,472 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,472 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,473 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,474 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 88 [2018-11-07 22:02:51,476 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:51,728 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,728 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,729 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,730 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,730 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,731 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,731 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,732 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,733 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,733 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,734 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,736 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 136 [2018-11-07 22:02:51,769 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-07 22:02:51,771 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,771 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,772 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,772 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,773 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,774 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,774 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,775 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,775 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,776 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,776 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,777 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,778 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,779 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,779 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:51,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 117 [2018-11-07 22:02:51,788 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:52,147 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,147 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,149 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,152 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,153 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,153 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,155 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,155 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,157 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,157 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,159 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 86 [2018-11-07 22:02:52,160 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:52,393 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,394 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,394 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,394 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,395 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,395 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,397 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 82 [2018-11-07 22:02:52,404 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:52,406 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,406 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,407 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,407 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,407 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,408 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,408 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,409 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 96 [2018-11-07 22:02:52,435 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-07 22:02:52,595 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,596 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,596 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,597 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,598 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,598 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,599 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,599 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 96 [2018-11-07 22:02:52,624 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-07 22:02:52,628 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,628 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,628 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,629 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,629 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,630 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,630 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,631 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,632 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,632 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:52,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 82 [2018-11-07 22:02:52,639 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:52,719 INFO L267 ElimStorePlain]: Start of recursive call 9: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 22:02:52,754 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 22:02:52,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-07 22:02:52,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:02:52,840 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:172, output treesize:6 [2018-11-07 22:03:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 67 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-11-07 22:03:03,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:03,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 19, 18] total 64 [2018-11-07 22:03:03,070 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:03,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 22:03:03,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 22:03:03,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=3678, Unknown=17, NotChecked=0, Total=4032 [2018-11-07 22:03:03,073 INFO L87 Difference]: Start difference. First operand 580 states and 666 transitions. Second operand 48 states. [2018-11-07 22:03:31,797 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 51 [2018-11-07 22:03:33,876 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 53 [2018-11-07 22:03:38,005 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-11-07 22:03:42,166 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-11-07 22:03:46,301 WARN L179 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2018-11-07 22:04:04,618 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 45 [2018-11-07 22:04:37,086 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 50 [2018-11-07 22:04:43,258 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2018-11-07 22:05:07,706 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2018-11-07 22:05:24,394 WARN L179 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 Received shutdown request... [2018-11-07 22:05:44,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 22:05:44,706 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 22:05:44,711 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 22:05:44,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:05:44 BoogieIcfgContainer [2018-11-07 22:05:44,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:05:44,712 INFO L168 Benchmark]: Toolchain (without parser) took 268719.93 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -982.3 MB). Peak memory consumption was 226.7 MB. Max. memory is 7.1 GB. [2018-11-07 22:05:44,713 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:05:44,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.40 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-11-07 22:05:44,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.25 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-11-07 22:05:44,714 INFO L168 Benchmark]: Boogie Preprocessor took 60.61 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-11-07 22:05:44,714 INFO L168 Benchmark]: RCFGBuilder took 637.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.3 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-07 22:05:44,715 INFO L168 Benchmark]: TraceAbstraction took 267661.54 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 474.5 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -220.6 MB). Peak memory consumption was 253.9 MB. Max. memory is 7.1 GB. [2018-11-07 22:05:44,717 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 325.40 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 30.25 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 60.61 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 637.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.3 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 267661.54 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 474.5 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -220.6 MB). Peak memory consumption was 253.9 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 (580states) and FLOYD_HOARE automaton (currently 30 states, 48 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 85 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 56 locations, 1 error locations. TIMEOUT Result, 267.6s OverallTime, 17 OverallIterations, 15 TraceHistogramMax, 190.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 791 SDtfs, 3198 SDslu, 4202 SDs, 0 SdLazy, 6236 SolverSat, 928 SolverUnsat, 30 SolverUnknown, 0 SolverNotchecked, 70.0s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 3235 GetRequests, 2649 SyntacticMatches, 35 SemanticMatches, 550 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14452 ImplicationChecksByTransitivity, 177.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=580occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9454242726969999 AbsIntWeakeningRatio, 0.5324675324675324 AbsIntAvgWeakeningVarsNumRemoved, 3.5194805194805197 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 754 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 73.2s InterpolantComputationTime, 2956 NumberOfCodeBlocks, 2832 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 4277 ConstructedInterpolants, 97 QuantifiedInterpolants, 5119415 SizeOfPredicates, 68 NumberOfNonLiveVariables, 2536 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 41 InterpolantComputations, 3 PerfectInterpolantSequences, 6776/8900 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown