java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:33:39,537 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:33:39,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:33:39,556 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:33:39,557 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:33:39,558 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:33:39,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:33:39,563 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:33:39,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:33:39,567 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:33:39,568 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:33:39,568 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:33:39,569 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:33:39,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:33:39,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:33:39,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:33:39,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:33:39,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:33:39,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:33:39,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:33:39,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:33:39,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:33:39,585 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:33:39,586 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:33:39,587 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:33:39,589 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:33:39,589 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:33:39,590 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:33:39,590 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:33:39,590 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:33:39,591 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:33:39,591 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:33:39,602 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:33:39,602 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:33:39,603 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:33:39,604 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:33:39,604 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:33:39,604 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:33:39,604 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:33:39,604 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:33:39,605 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:33:39,605 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:33:39,606 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:33:39,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:33:39,606 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:33:39,606 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:33:39,606 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:33:39,607 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:33:39,607 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:33:39,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:33:39,607 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:33:39,607 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:33:39,608 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:33:39,608 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:33:39,608 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:33:39,608 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:33:39,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:33:39,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:33:39,609 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:33:39,609 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:33:39,609 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:33:39,609 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:33:39,610 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:33:39,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:33:39,610 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:33:39,610 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:33:39,611 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:33:39,612 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:33:39,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:33:39,691 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:33:39,697 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:33:39,699 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:33:39,699 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:33:39,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-01-24 17:33:39,927 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:33:39,937 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:33:39,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:33:39,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:33:39,947 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:33:39,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:33:39" (1/1) ... [2018-01-24 17:33:39,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321f72c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:33:39, skipping insertion in model container [2018-01-24 17:33:39,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:33:39" (1/1) ... [2018-01-24 17:33:39,974 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:33:40,041 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:33:40,213 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:33:40,243 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:33:40,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:33:40 WrapperNode [2018-01-24 17:33:40,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:33:40,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:33:40,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:33:40,258 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:33:40,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:33:40" (1/1) ... [2018-01-24 17:33:40,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:33:40" (1/1) ... [2018-01-24 17:33:40,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:33:40" (1/1) ... [2018-01-24 17:33:40,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:33:40" (1/1) ... [2018-01-24 17:33:40,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:33:40" (1/1) ... [2018-01-24 17:33:40,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:33:40" (1/1) ... [2018-01-24 17:33:40,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:33:40" (1/1) ... [2018-01-24 17:33:40,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:33:40,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:33:40,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:33:40,320 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:33:40,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:33:40" (1/1) ... No working directory specified, using /storage/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-01-24 17:33:40,380 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:33:40,380 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:33:40,380 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:33:40,380 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 17:33:40,381 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 17:33:40,381 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:33:40,381 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:33:40,381 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:33:40,381 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:33:40,382 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:33:40,382 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:33:40,382 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:33:40,382 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:33:40,382 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 17:33:40,382 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:33:40,383 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:33:40,383 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:33:41,238 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:33:41,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:33:41 BoogieIcfgContainer [2018-01-24 17:33:41,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:33:41,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:33:41,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:33:41,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:33:41,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:33:39" (1/3) ... [2018-01-24 17:33:41,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cec5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:33:41, skipping insertion in model container [2018-01-24 17:33:41,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:33:40" (2/3) ... [2018-01-24 17:33:41,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cec5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:33:41, skipping insertion in model container [2018-01-24 17:33:41,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:33:41" (3/3) ... [2018-01-24 17:33:41,246 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-01-24 17:33:41,253 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:33:41,261 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 61 error locations. [2018-01-24 17:33:41,317 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:33:41,318 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:33:41,318 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:33:41,318 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:33:41,318 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:33:41,318 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:33:41,318 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:33:41,319 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:33:41,319 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:33:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-01-24 17:33:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 17:33:41,353 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:41,354 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:33:41,354 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:41,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1532119549, now seen corresponding path program 1 times [2018-01-24 17:33:41,365 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:41,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:41,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:41,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:41,432 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:41,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:41,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:41,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:33:41,550 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:41,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:33:41,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:33:41,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:33:41,662 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 4 states. [2018-01-24 17:33:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:41,941 INFO L93 Difference]: Finished difference Result 296 states and 366 transitions. [2018-01-24 17:33:41,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:33:41,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 17:33:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:41,953 INFO L225 Difference]: With dead ends: 296 [2018-01-24 17:33:41,953 INFO L226 Difference]: Without dead ends: 157 [2018-01-24 17:33:41,957 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:33:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-24 17:33:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 142. [2018-01-24 17:33:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 17:33:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2018-01-24 17:33:41,999 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 8 [2018-01-24 17:33:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:42,000 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2018-01-24 17:33:42,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:33:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2018-01-24 17:33:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 17:33:42,001 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:42,001 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:33:42,001 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:42,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1532119550, now seen corresponding path program 1 times [2018-01-24 17:33:42,001 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:42,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:42,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:42,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:42,004 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:42,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:42,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:42,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:33:42,091 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:42,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:33:42,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:33:42,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:33:42,093 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand 4 states. [2018-01-24 17:33:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:42,385 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-01-24 17:33:42,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:33:42,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 17:33:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:42,406 INFO L225 Difference]: With dead ends: 162 [2018-01-24 17:33:42,406 INFO L226 Difference]: Without dead ends: 154 [2018-01-24 17:33:42,407 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:33:42,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-24 17:33:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2018-01-24 17:33:42,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-24 17:33:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2018-01-24 17:33:42,420 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 8 [2018-01-24 17:33:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:42,421 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2018-01-24 17:33:42,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:33:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2018-01-24 17:33:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 17:33:42,422 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:42,422 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:33:42,422 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash 579798922, now seen corresponding path program 1 times [2018-01-24 17:33:42,423 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:42,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:42,424 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:42,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:42,424 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:42,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:42,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:42,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:33:42,524 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:42,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:33:42,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:33:42,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:33:42,524 INFO L87 Difference]: Start difference. First operand 146 states and 153 transitions. Second operand 4 states. [2018-01-24 17:33:42,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:42,659 INFO L93 Difference]: Finished difference Result 165 states and 173 transitions. [2018-01-24 17:33:42,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:33:42,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 17:33:42,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:42,660 INFO L225 Difference]: With dead ends: 165 [2018-01-24 17:33:42,660 INFO L226 Difference]: Without dead ends: 149 [2018-01-24 17:33:42,661 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:33:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-24 17:33:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 134. [2018-01-24 17:33:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 17:33:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-01-24 17:33:42,669 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 16 [2018-01-24 17:33:42,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:42,669 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-01-24 17:33:42,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:33:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-01-24 17:33:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 17:33:42,670 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:42,670 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:33:42,670 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:42,670 INFO L82 PathProgramCache]: Analyzing trace with hash 579798923, now seen corresponding path program 1 times [2018-01-24 17:33:42,671 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:42,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:42,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:42,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:42,672 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:42,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:42,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:42,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:33:42,826 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:42,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:33:42,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:33:42,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:33:42,827 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 7 states. [2018-01-24 17:33:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:43,129 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2018-01-24 17:33:43,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:33:43,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-24 17:33:43,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:43,132 INFO L225 Difference]: With dead ends: 177 [2018-01-24 17:33:43,132 INFO L226 Difference]: Without dead ends: 170 [2018-01-24 17:33:43,133 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:33:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-24 17:33:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 145. [2018-01-24 17:33:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-24 17:33:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2018-01-24 17:33:43,145 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 16 [2018-01-24 17:33:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:43,145 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2018-01-24 17:33:43,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:33:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2018-01-24 17:33:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 17:33:43,146 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:43,146 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:33:43,146 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:43,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1158984530, now seen corresponding path program 1 times [2018-01-24 17:33:43,147 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:43,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:43,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:43,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:43,149 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:43,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:43,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:43,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:33:43,239 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:43,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:33:43,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:33:43,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:33:43,240 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand 5 states. [2018-01-24 17:33:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:43,548 INFO L93 Difference]: Finished difference Result 216 states and 235 transitions. [2018-01-24 17:33:43,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:33:43,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 17:33:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:43,549 INFO L225 Difference]: With dead ends: 216 [2018-01-24 17:33:43,549 INFO L226 Difference]: Without dead ends: 215 [2018-01-24 17:33:43,550 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:33:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-24 17:33:43,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 144. [2018-01-24 17:33:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 17:33:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-01-24 17:33:43,560 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 18 [2018-01-24 17:33:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:43,560 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-01-24 17:33:43,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:33:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-01-24 17:33:43,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 17:33:43,561 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:43,561 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:33:43,561 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:43,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1158984531, now seen corresponding path program 1 times [2018-01-24 17:33:43,561 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:43,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:43,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:43,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:43,563 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:43,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:43,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:43,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:33:43,611 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:43,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:33:43,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:33:43,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:33:43,612 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 5 states. [2018-01-24 17:33:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:43,788 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2018-01-24 17:33:43,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:33:43,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 17:33:43,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:43,789 INFO L225 Difference]: With dead ends: 192 [2018-01-24 17:33:43,790 INFO L226 Difference]: Without dead ends: 191 [2018-01-24 17:33:43,790 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:33:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-24 17:33:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 143. [2018-01-24 17:33:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 17:33:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-01-24 17:33:43,801 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 18 [2018-01-24 17:33:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:43,802 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-01-24 17:33:43,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:33:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-01-24 17:33:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 17:33:43,803 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:43,803 INFO L322 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] [2018-01-24 17:33:43,803 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:43,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2048091345, now seen corresponding path program 1 times [2018-01-24 17:33:43,804 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:43,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:43,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:43,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:43,805 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:43,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:43,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:43,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:33:43,998 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:43,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:33:43,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:33:43,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:33:43,999 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 9 states. [2018-01-24 17:33:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:44,386 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2018-01-24 17:33:44,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:33:44,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 17:33:44,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:44,387 INFO L225 Difference]: With dead ends: 157 [2018-01-24 17:33:44,387 INFO L226 Difference]: Without dead ends: 156 [2018-01-24 17:33:44,388 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:33:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-24 17:33:44,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 142. [2018-01-24 17:33:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 17:33:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-01-24 17:33:44,394 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 22 [2018-01-24 17:33:44,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:44,394 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-01-24 17:33:44,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:33:44,394 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-01-24 17:33:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 17:33:44,395 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:44,395 INFO L322 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] [2018-01-24 17:33:44,395 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:44,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2048091344, now seen corresponding path program 1 times [2018-01-24 17:33:44,395 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:44,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:44,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:44,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:44,397 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:44,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:44,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:44,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 17:33:44,725 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:44,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:33:44,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:33:44,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:33:44,726 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 10 states. [2018-01-24 17:33:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:46,076 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-01-24 17:33:46,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 17:33:46,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 17:33:46,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:46,078 INFO L225 Difference]: With dead ends: 183 [2018-01-24 17:33:46,079 INFO L226 Difference]: Without dead ends: 172 [2018-01-24 17:33:46,079 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-24 17:33:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-24 17:33:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 147. [2018-01-24 17:33:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-24 17:33:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-01-24 17:33:46,089 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 22 [2018-01-24 17:33:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:46,089 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-01-24 17:33:46,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:33:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-01-24 17:33:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:33:46,091 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:46,091 INFO L322 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-01-24 17:33:46,091 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:46,091 INFO L82 PathProgramCache]: Analyzing trace with hash -328401667, now seen corresponding path program 1 times [2018-01-24 17:33:46,091 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:46,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:46,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:46,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:46,094 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:46,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:46,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:46,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:33:46,267 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:46,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:33:46,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:33:46,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:33:46,268 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 5 states. [2018-01-24 17:33:46,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:46,611 INFO L93 Difference]: Finished difference Result 201 states and 215 transitions. [2018-01-24 17:33:46,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:33:46,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 17:33:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:46,613 INFO L225 Difference]: With dead ends: 201 [2018-01-24 17:33:46,613 INFO L226 Difference]: Without dead ends: 165 [2018-01-24 17:33:46,614 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:33:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-24 17:33:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 147. [2018-01-24 17:33:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-24 17:33:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-01-24 17:33:46,627 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 28 [2018-01-24 17:33:46,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:46,627 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-01-24 17:33:46,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:33:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-01-24 17:33:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:33:46,628 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:46,629 INFO L322 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] [2018-01-24 17:33:46,629 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:46,629 INFO L82 PathProgramCache]: Analyzing trace with hash 143362465, now seen corresponding path program 1 times [2018-01-24 17:33:46,629 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:46,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:46,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:46,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:46,633 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:46,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:46,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:46,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:33:46,913 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:46,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:33:46,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:33:46,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:33:46,914 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 5 states. [2018-01-24 17:33:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:47,214 INFO L93 Difference]: Finished difference Result 219 states and 233 transitions. [2018-01-24 17:33:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:33:47,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 17:33:47,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:47,216 INFO L225 Difference]: With dead ends: 219 [2018-01-24 17:33:47,216 INFO L226 Difference]: Without dead ends: 218 [2018-01-24 17:33:47,217 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:33:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-24 17:33:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 146. [2018-01-24 17:33:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-24 17:33:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2018-01-24 17:33:47,231 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 29 [2018-01-24 17:33:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:47,232 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2018-01-24 17:33:47,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:33:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2018-01-24 17:33:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:33:47,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:47,234 INFO L322 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] [2018-01-24 17:33:47,234 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:47,234 INFO L82 PathProgramCache]: Analyzing trace with hash 143362466, now seen corresponding path program 1 times [2018-01-24 17:33:47,234 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:47,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:47,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:47,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:47,236 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:47,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:47,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:47,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:33:47,456 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:47,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:33:47,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:33:47,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:33:47,456 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand 5 states. [2018-01-24 17:33:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:47,798 INFO L93 Difference]: Finished difference Result 244 states and 259 transitions. [2018-01-24 17:33:47,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:33:47,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 17:33:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:47,801 INFO L225 Difference]: With dead ends: 244 [2018-01-24 17:33:47,801 INFO L226 Difference]: Without dead ends: 243 [2018-01-24 17:33:47,802 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:33:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-24 17:33:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 145. [2018-01-24 17:33:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-24 17:33:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-01-24 17:33:47,816 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 29 [2018-01-24 17:33:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:47,816 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-01-24 17:33:47,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:33:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-01-24 17:33:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 17:33:47,817 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:47,818 INFO L322 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] [2018-01-24 17:33:47,818 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:47,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1819547941, now seen corresponding path program 1 times [2018-01-24 17:33:47,822 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:47,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:47,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:47,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:47,824 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:47,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:48,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:33:48,036 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:33:48,037 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-01-24 17:33:48,041 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [11], [15], [17], [20], [135], [139], [144], [148], [156], [157], [164], [168], [176], [182], [183], [184], [232], [234], [237], [287], [288], [292], [293], [294] [2018-01-24 17:33:48,113 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:33:48,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:33:48,537 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:33:48,539 INFO L268 AbstractInterpreter]: Visited 29 different actions 38 times. Merged at 6 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-24 17:33:48,579 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:33:48,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:33:48,579 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 17:33:48,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:48,593 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:33:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:48,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:33:48,806 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-01-24 17:33:48,822 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-01-24 17:33:48,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:48,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:48,897 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-01-24 17:33:48,899 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-01-24 17:33:48,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:48,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:48,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:48,907 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-01-24 17:33:48,936 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-01-24 17:33:48,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:48,945 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-01-24 17:33:48,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:48,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,055 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-01-24 17:33:49,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,070 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-01-24 17:33:49,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,076 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2018-01-24 17:33:49,110 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 36 treesize of output 29 [2018-01-24 17:33:49,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,172 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,189 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 29 treesize of output 37 [2018-01-24 17:33:49,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,213 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 36 treesize of output 29 [2018-01-24 17:33:49,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,232 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 29 treesize of output 37 [2018-01-24 17:33:49,232 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2018-01-24 17:33:49,272 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 22 treesize of output 16 [2018-01-24 17:33:49,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-01-24 17:33:49,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,308 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 22 treesize of output 16 [2018-01-24 17:33:49,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-01-24 17:33:49,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,316 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-01-24 17:33:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:49,323 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:33:49,412 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:33:49,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:33:49,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,471 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,475 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,489 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:33:49,493 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:33:49,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:33:49,499 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:107, output treesize:25 [2018-01-24 17:33:49,584 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 17:33:49,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:1 [2018-01-24 17:33:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:49,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:33:49,644 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:33:49,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:49,653 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:33:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:49,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:33:49,732 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-01-24 17:33:49,750 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-01-24 17:33:49,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,781 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-01-24 17:33:49,785 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-01-24 17:33:49,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,794 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-24 17:33:49,811 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-01-24 17:33:49,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,817 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-01-24 17:33:49,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,871 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-01-24 17:33:49,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,880 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-01-24 17:33:49,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,899 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-01-24 17:33:49,923 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 36 treesize of output 29 [2018-01-24 17:33:49,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,931 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 29 treesize of output 37 [2018-01-24 17:33:49,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33: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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-24 17:33:49,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:33:49,972 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 29 treesize of output 37 [2018-01-24 17:33:49,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:49,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2018-01-24 17:33:49,997 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 22 treesize of output 16 [2018-01-24 17:33:50,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-01-24 17:33:50,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:50,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:50,009 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 22 treesize of output 16 [2018-01-24 17:33:50,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-01-24 17:33:50,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:50,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:50,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:50,052 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-01-24 17:33:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:50,057 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:33:50,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:50,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:50,176 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:33:50,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:33:50,245 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:33:50,249 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:33:50,258 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:50,265 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:50,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:33:50,272 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:107, output treesize:25 [2018-01-24 17:33:50,280 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 17:33:50,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:50,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:50,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:1 [2018-01-24 17:33:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:50,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:33:50,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7, 9, 6] total 12 [2018-01-24 17:33:50,286 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:33:50,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:33:50,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:33:50,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:33:50,288 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 11 states. [2018-01-24 17:33:50,650 WARN L143 SmtUtils]: Spent 143ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-24 17:33:51,260 WARN L143 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-24 17:33:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:51,840 INFO L93 Difference]: Finished difference Result 261 states and 279 transitions. [2018-01-24 17:33:51,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 17:33:51,840 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-01-24 17:33:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:51,841 INFO L225 Difference]: With dead ends: 261 [2018-01-24 17:33:51,841 INFO L226 Difference]: Without dead ends: 204 [2018-01-24 17:33:51,842 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 114 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2018-01-24 17:33:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-24 17:33:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 164. [2018-01-24 17:33:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-24 17:33:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-01-24 17:33:51,854 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 31 [2018-01-24 17:33:51,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:51,854 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-01-24 17:33:51,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:33:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-01-24 17:33:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 17:33:51,856 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:51,856 INFO L322 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, 1, 1, 1] [2018-01-24 17:33:51,856 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:51,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1392569911, now seen corresponding path program 1 times [2018-01-24 17:33:51,856 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:51,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:51,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:51,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:51,858 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:51,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:52,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:52,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:33:52,098 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:52,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:33:52,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:33:52,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:33:52,099 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 5 states. [2018-01-24 17:33:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:52,540 INFO L93 Difference]: Finished difference Result 226 states and 240 transitions. [2018-01-24 17:33:52,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:33:52,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 17:33:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:52,568 INFO L225 Difference]: With dead ends: 226 [2018-01-24 17:33:52,568 INFO L226 Difference]: Without dead ends: 168 [2018-01-24 17:33:52,569 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:33:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-24 17:33:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 163. [2018-01-24 17:33:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-01-24 17:33:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2018-01-24 17:33:52,579 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 33 [2018-01-24 17:33:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:52,580 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2018-01-24 17:33:52,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:33:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2018-01-24 17:33:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 17:33:52,581 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:52,581 INFO L322 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, 1, 1, 1] [2018-01-24 17:33:52,581 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:52,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1586189731, now seen corresponding path program 1 times [2018-01-24 17:33:52,582 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:52,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:52,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:52,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:52,583 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:52,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:52,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:52,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:33:52,726 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:52,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:33:52,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:33:52,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:33:52,727 INFO L87 Difference]: Start difference. First operand 163 states and 171 transitions. Second operand 8 states. [2018-01-24 17:33:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:52,980 INFO L93 Difference]: Finished difference Result 165 states and 173 transitions. [2018-01-24 17:33:52,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:33:52,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-01-24 17:33:52,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:52,981 INFO L225 Difference]: With dead ends: 165 [2018-01-24 17:33:52,981 INFO L226 Difference]: Without dead ends: 164 [2018-01-24 17:33:52,981 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:33:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-24 17:33:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-01-24 17:33:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 17:33:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 170 transitions. [2018-01-24 17:33:52,989 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 170 transitions. Word has length 33 [2018-01-24 17:33:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:52,989 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 170 transitions. [2018-01-24 17:33:52,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:33:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 170 transitions. [2018-01-24 17:33:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 17:33:52,990 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:52,991 INFO L322 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, 1, 1, 1] [2018-01-24 17:33:52,991 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:52,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1586189732, now seen corresponding path program 1 times [2018-01-24 17:33:52,991 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:52,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:52,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:52,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:52,993 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:53,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:53,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:33:53,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 17:33:53,295 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:53,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 17:33:53,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 17:33:53,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:33:53,296 INFO L87 Difference]: Start difference. First operand 162 states and 170 transitions. Second operand 13 states. [2018-01-24 17:33:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:54,085 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2018-01-24 17:33:54,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 17:33:54,086 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-24 17:33:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:54,087 INFO L225 Difference]: With dead ends: 164 [2018-01-24 17:33:54,087 INFO L226 Difference]: Without dead ends: 157 [2018-01-24 17:33:54,088 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2018-01-24 17:33:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-24 17:33:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 135. [2018-01-24 17:33:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 17:33:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-01-24 17:33:54,103 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 33 [2018-01-24 17:33:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:54,104 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-01-24 17:33:54,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 17:33:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-01-24 17:33:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 17:33:54,105 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:54,105 INFO L322 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, 1, 1, 1, 1] [2018-01-24 17:33:54,105 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:54,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1600298851, now seen corresponding path program 1 times [2018-01-24 17:33:54,105 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:54,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:54,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:54,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:54,112 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:54,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:54,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:33:54,484 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:33:54,485 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-24 17:33:54,485 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [11], [15], [17], [20], [135], [139], [144], [148], [156], [157], [164], [168], [176], [180], [182], [183], [232], [234], [237], [243], [249], [250], [255], [256], [259], [260], [264], [287], [288], [292], [293], [294] [2018-01-24 17:33:54,487 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:33:54,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:33:54,792 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:33:54,793 INFO L268 AbstractInterpreter]: Visited 37 different actions 55 times. Merged at 10 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 17:33:54,796 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:33:54,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:33:54,796 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 17:33:54,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:54,808 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:33:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:54,832 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:33:54,841 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 13 treesize of output 10 [2018-01-24 17:33:54,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 17:33:54,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:54,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:54,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:54,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-24 17:33:54,852 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 19 treesize of output 15 [2018-01-24 17:33:54,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-24 17:33:54,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:54,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:54,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:54,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-24 17:33:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:33:54,872 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:33:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:33:54,934 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:33:54,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2018-01-24 17:33:54,935 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:33:54,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:33:54,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:33:54,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:33:54,936 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 4 states. [2018-01-24 17:33:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:55,097 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-01-24 17:33:55,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:33:55,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-24 17:33:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:55,098 INFO L225 Difference]: With dead ends: 174 [2018-01-24 17:33:55,098 INFO L226 Difference]: Without dead ends: 145 [2018-01-24 17:33:55,099 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:33:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-24 17:33:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2018-01-24 17:33:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-24 17:33:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-01-24 17:33:55,107 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 38 [2018-01-24 17:33:55,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:55,107 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-01-24 17:33:55,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:33:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2018-01-24 17:33:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 17:33:55,108 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:55,109 INFO L322 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] [2018-01-24 17:33:55,109 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:55,109 INFO L82 PathProgramCache]: Analyzing trace with hash -25033053, now seen corresponding path program 1 times [2018-01-24 17:33:55,109 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:55,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:55,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:55,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:55,111 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:55,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:33:55,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:55,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:33:55,288 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:33:55,288 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 17:33:55,288 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [11], [15], [17], [20], [135], [139], [144], [148], [156], [157], [164], [168], [176], [180], [182], [183], [232], [234], [237], [243], [249], [250], [251], [271], [272], [275], [276], [279], [287], [288], [292], [293], [294] [2018-01-24 17:33:55,290 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:33:55,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:33:55,648 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:33:55,649 INFO L268 AbstractInterpreter]: Visited 38 different actions 81 times. Merged at 16 different actions 39 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 30 variables. [2018-01-24 17:33:55,656 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:33:55,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:33:55,657 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 17:33:55,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:55,668 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:33:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:55,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:33:55,712 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 19 treesize of output 16 [2018-01-24 17:33:55,714 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 16 treesize of output 1 [2018-01-24 17:33:55,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:55,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:55,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:55,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:3 [2018-01-24 17:33:55,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 17:33:55,837 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 11 treesize of output 8 [2018-01-24 17:33:55,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 17:33:55,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:33:55,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 17:33:55,862 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 11 treesize of output 8 [2018-01-24 17:33:55,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 17:33:55,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:33:55,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:33:55,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:18 [2018-01-24 17:33:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:55,967 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:33:56,086 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 31 treesize of output 29 [2018-01-24 17:33:56,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 17:33:56,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-01-24 17:33:56,116 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-24 17:33:56,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-24 17:33:56,135 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-24 17:33:56,152 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:33:56,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:33:56,180 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:63, output treesize:39 [2018-01-24 17:33:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:56,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:33:56,240 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:33:56,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:56,243 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:33:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:56,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:33:56,330 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 19 treesize of output 16 [2018-01-24 17:33:56,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-24 17:33:56,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,339 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 19 treesize of output 16 [2018-01-24 17:33:56,341 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 16 treesize of output 1 [2018-01-24 17:33:56,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2018-01-24 17:33:56,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 17:33:56,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 17:33:56,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 17:33:56,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 17:33:56,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:33:56,467 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-01-24 17:33:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:56,482 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:33:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:33:56,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:33:56,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10, 11, 9] total 31 [2018-01-24 17:33:56,593 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:33:56,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 17:33:56,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 17:33:56,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=802, Unknown=6, NotChecked=0, Total=930 [2018-01-24 17:33:56,594 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 16 states. [2018-01-24 17:33:57,264 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 11 DAG size of output 9 [2018-01-24 17:33:58,136 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 37 DAG size of output 25 [2018-01-24 17:33:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:33:59,945 INFO L93 Difference]: Finished difference Result 217 states and 230 transitions. [2018-01-24 17:33:59,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 17:33:59,945 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-01-24 17:33:59,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:33:59,946 INFO L225 Difference]: With dead ends: 217 [2018-01-24 17:33:59,946 INFO L226 Difference]: Without dead ends: 191 [2018-01-24 17:33:59,947 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 133 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=269, Invalid=1442, Unknown=11, NotChecked=0, Total=1722 [2018-01-24 17:33:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-24 17:33:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 152. [2018-01-24 17:33:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-24 17:33:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-01-24 17:33:59,953 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 41 [2018-01-24 17:33:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:33:59,953 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-01-24 17:33:59,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 17:33:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-01-24 17:33:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 17:33:59,954 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:33:59,954 INFO L322 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] [2018-01-24 17:33:59,954 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:33:59,954 INFO L82 PathProgramCache]: Analyzing trace with hash -776025256, now seen corresponding path program 1 times [2018-01-24 17:33:59,954 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:33:59,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:59,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:33:59,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:33:59,955 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:33:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:33:59,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:34:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:34:00,215 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:34:00,215 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:34:00,215 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-01-24 17:34:00,215 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [11], [15], [17], [20], [135], [139], [144], [148], [156], [157], [164], [168], [176], [180], [182], [183], [232], [234], [237], [243], [247], [249], [250], [271], [272], [275], [276], [279], [284], [286], [287], [288], [292], [293], [294] [2018-01-24 17:34:00,217 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:34:00,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:34:00,608 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:34:00,608 INFO L268 AbstractInterpreter]: Visited 40 different actions 86 times. Merged at 18 different actions 41 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 31 variables. [2018-01-24 17:34:00,625 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:34:00,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:34:00,625 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 17:34:00,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:34:00,639 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:34:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:34:00,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:34:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:34:01,056 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:34:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:34:01,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:34:01,364 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:34:01,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:34:01,370 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:34:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:34:01,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:34:01,433 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-01-24 17:34:01,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:01,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:34:01,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:34:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:34:01,539 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:34:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:34:01,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:34:01,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7, 6, 5] total 19 [2018-01-24 17:34:01,638 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:34:01,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:34:01,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:34:01,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=297, Unknown=10, NotChecked=0, Total=380 [2018-01-24 17:34:01,640 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 10 states. [2018-01-24 17:34:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:34:02,920 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2018-01-24 17:34:02,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:34:02,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-24 17:34:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:34:02,921 INFO L225 Difference]: With dead ends: 162 [2018-01-24 17:34:02,921 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 17:34:02,921 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=467, Unknown=10, NotChecked=0, Total=600 [2018-01-24 17:34:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 17:34:02,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-01-24 17:34:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 17:34:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-01-24 17:34:02,929 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 42 [2018-01-24 17:34:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:34:02,929 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-01-24 17:34:02,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:34:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-01-24 17:34:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-24 17:34:02,930 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:34:02,930 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:34:02,930 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:34:02,930 INFO L82 PathProgramCache]: Analyzing trace with hash -460710900, now seen corresponding path program 1 times [2018-01-24 17:34:02,931 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:34:02,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:34:02,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:34:02,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:34:02,932 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:34:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:34:02,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:34:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:34:03,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:34:03,577 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:34:03,577 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-01-24 17:34:03,577 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [11], [15], [17], [20], [22], [23], [24], [27], [30], [33], [34], [37], [38], [41], [44], [45], [77], [78], [85], [89], [97], [98], [105], [109], [117], [122], [126], [135], [139], [144], [148], [156], [157], [164], [168], [176], [182], [183], [184], [232], [234], [237], [287], [288], [292], [293], [294] [2018-01-24 17:34:03,579 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:34:03,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:34:04,062 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:34:04,062 INFO L268 AbstractInterpreter]: Visited 52 different actions 146 times. Merged at 41 different actions 91 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 37 variables. [2018-01-24 17:34:04,100 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:34:04,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:34:04,100 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 17:34:04,114 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:34:04,114 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:34:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:34:04,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:34:04,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:34:04,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:34:04,259 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 17:34:04,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:04,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:34:04,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-24 17:34:04,293 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-01-24 17:34:04,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-01-24 17:34:04,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:04,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:34:04,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:34:04,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-01-24 17:34:04,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:34:04,413 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-01-24 17:34:04,416 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 14 treesize of output 13 [2018-01-24 17:34:04,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:04,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:34:04,431 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-01-24 17:34:04,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-01-24 17:34:04,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-01-24 17:34:04,943 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 16 treesize of output 23 [2018-01-24 17:34:04,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 17:34:04,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:34:04,987 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 2 xjuncts. [2018-01-24 17:34:04,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:84 [2018-01-24 17:34:05,103 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-01-24 17:34:05,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:34:05,109 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 30 treesize of output 18 [2018-01-24 17:34:05,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:05,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:34:05,129 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-01-24 17:34:05,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-01-24 17:34:05,338 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 36 treesize of output 24 [2018-01-24 17:34:05,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 17:34:05,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:05,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-24 17:34:05,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:05,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:34:05,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:34:05,507 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-01-24 17:34:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:34:05,769 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:34:06,004 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:34:06,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:34:06,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:34:06,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-01-24 17:34:23,463 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 134 treesize of output 80 [2018-01-24 17:34:23,504 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 9 treesize of output 8 [2018-01-24 17:34:23,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:23,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 63 [2018-01-24 17:34:23,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 52 treesize of output 51 [2018-01-24 17:34:23,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:23,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 53 treesize of output 52 [2018-01-24 17:34:23,615 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:23,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 39 treesize of output 38 [2018-01-24 17:34:23,617 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:23,720 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 0 case distinctions, treesize of input 47 treesize of output 44 [2018-01-24 17:34:23,721 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:23,724 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 36 treesize of output 35 [2018-01-24 17:34:23,725 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:23,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-01-24 17:34:23,854 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2018-01-24 17:34:23,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2018-01-24 17:34:23,936 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-01-24 17:34:23,944 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 26 treesize of output 22 [2018-01-24 17:34:23,944 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-24 17:34:23,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2018-01-24 17:34:23,968 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-01-24 17:34:24,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-01-24 17:34:24,150 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:24,158 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2018-01-24 17:34:24,159 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 17:34:24,237 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-01-24 17:34:24,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-01-24 17:34:24,335 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:24,437 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-01-24 17:34:24,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2018-01-24 17:34:24,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2018-01-24 17:34:24,461 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 17:34:24,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-01-24 17:34:24,496 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:24,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-24 17:34:24,498 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:24,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-01-24 17:34:24,527 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:24,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-24 17:34:24,548 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:34:24,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-01-24 17:34:24,587 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:24,604 INFO L267 ElimStorePlain]: Start of recursive call 18: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 17:34:24,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-24 17:34:24,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 45 [2018-01-24 17:34:24,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 55 [2018-01-24 17:34:24,899 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-01-24 17:34:24,948 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 55 [2018-01-24 17:34:24,950 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-01-24 17:34:24,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 30 [2018-01-24 17:34:24,966 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-01-24 17:34:25,171 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 26 treesize of output 22 [2018-01-24 17:34:25,171 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-01-24 17:34:25,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 43 [2018-01-24 17:34:25,192 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-01-24 17:34:25,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-01-24 17:34:25,393 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-01-24 17:34:25,399 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 24 treesize of output 20 [2018-01-24 17:34:25,399 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-01-24 17:34:25,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-01-24 17:34:25,676 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:25,694 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-01-24 17:34:25,695 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 17:34:25,951 INFO L267 ElimStorePlain]: Start of recursive call 26: 4 dim-1 vars, End of recursive call: 9 dim-0 vars, and 16 xjuncts. [2018-01-24 17:34:26,183 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 16 xjuncts. [2018-01-24 17:34:26,199 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 35 treesize of output 32 [2018-01-24 17:34:26,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-01-24 17:34:26,204 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:26,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 17:34:26,211 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:34:26,215 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:34:26,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 45 [2018-01-24 17:34:26,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 59 [2018-01-24 17:34:27,103 WARN L146 SmtUtils]: Spent 283ms on a formula simplification. DAG size of input: 126 DAG size of output 117 [2018-01-24 17:34:27,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-24 17:34:27,111 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:27,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 45 [2018-01-24 17:34:27,126 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-01-24 17:34:27,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 45 [2018-01-24 17:34:27,150 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-01-24 17:34:28,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2018-01-24 17:34:28,699 INFO L267 ElimStorePlain]: Start of recursive call 44: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 32 xjuncts. [2018-01-24 17:34:28,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 39 [2018-01-24 17:34:28,726 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 4 xjuncts. [2018-01-24 17:34:29,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2018-01-24 17:34:29,828 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-01-24 17:34:29,836 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 38 treesize of output 34 [2018-01-24 17:34:29,837 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-01-24 17:34:30,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:34:30,321 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2018-01-24 17:34:30,323 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-01-24 17:34:30,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-01-24 17:34:30,347 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 8 xjuncts. [2018-01-24 17:34:30,839 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-01-24 17:34:30,840 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 17:34:30,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-01-24 17:34:30,843 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:31,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 51 [2018-01-24 17:34:31,382 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-01-24 17:34:31,401 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 34 treesize of output 30 [2018-01-24 17:34:31,402 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-01-24 17:34:32,156 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 35 treesize of output 31 [2018-01-24 17:34:32,157 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-01-24 17:34:32,162 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:34:32,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 47 [2018-01-24 17:34:32,181 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-01-24 17:34:32,744 INFO L267 ElimStorePlain]: Start of recursive call 40: 7 dim-1 vars, End of recursive call: 14 dim-0 vars, and 24 xjuncts. [2018-01-24 17:34:33,396 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 2 case distinctions, treesize of input 36 treesize of output 44 [2018-01-24 17:34:33,413 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 47 [2018-01-24 17:34:33,470 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2018-01-24 17:34:33,471 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 17:34:33,478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2018-01-24 17:34:33,478 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 17:34:33,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-24 17:34:33,483 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:33,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 52 [2018-01-24 17:34:33,639 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-01-24 17:34:33,709 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 39 treesize of output 35 [2018-01-24 17:34:33,709 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-01-24 17:34:33,998 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-01-24 17:34:34,107 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:34:34,110 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:34:34,129 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 4 case distinctions, treesize of input 37 treesize of output 60 [2018-01-24 17:34:34,257 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 78 DAG size of output 68 [2018-01-24 17:34:34,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 48 [2018-01-24 17:34:34,282 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-01-24 17:34:34,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-01-24 17:34:34,287 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-01-24 17:34:34,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 48 [2018-01-24 17:34:34,312 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-01-24 17:34:34,501 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:34:34,504 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:34:34,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 45 [2018-01-24 17:34:34,514 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 4 xjuncts. [2018-01-24 17:34:34,519 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:34:34,524 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:34:34,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 70 [2018-01-24 17:34:34,550 INFO L267 ElimStorePlain]: Start of recursive call 68: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 24 xjuncts. Received shutdown request... [2018-01-24 17:34:36,338 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 17:34:36,339 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 17:34:36,346 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 17:34:36,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:34:36 BoogieIcfgContainer [2018-01-24 17:34:36,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:34:36,349 INFO L168 Benchmark]: Toolchain (without parser) took 56421.22 ms. Allocated memory was 299.4 MB in the beginning and 703.1 MB in the end (delta: 403.7 MB). Free memory was 259.4 MB in the beginning and 430.5 MB in the end (delta: -171.1 MB). Peak memory consumption was 370.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:34:36,350 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:34:36,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.28 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 246.1 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 5.3 GB. [2018-01-24 17:34:36,350 INFO L168 Benchmark]: Boogie Preprocessor took 61.86 ms. Allocated memory is still 299.4 MB. Free memory was 246.1 MB in the beginning and 244.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:34:36,351 INFO L168 Benchmark]: RCFGBuilder took 919.02 ms. Allocated memory is still 299.4 MB. Free memory was 244.1 MB in the beginning and 207.5 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 5.3 GB. [2018-01-24 17:34:36,353 INFO L168 Benchmark]: TraceAbstraction took 55108.08 ms. Allocated memory was 299.4 MB in the beginning and 703.1 MB in the end (delta: 403.7 MB). Free memory was 207.5 MB in the beginning and 430.5 MB in the end (delta: -223.0 MB). Peak memory consumption was 318.1 MB. Max. memory is 5.3 GB. [2018-01-24 17:34:36,361 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 319.28 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 246.1 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 61.86 ms. Allocated memory is still 299.4 MB. Free memory was 246.1 MB in the beginning and 244.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 919.02 ms. Allocated memory is still 299.4 MB. Free memory was 244.1 MB in the beginning and 207.5 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55108.08 ms. Allocated memory was 299.4 MB in the beginning and 703.1 MB in the end (delta: 403.7 MB). Free memory was 207.5 MB in the beginning and 430.5 MB in the end (delta: -223.0 MB). Peak memory consumption was 318.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 309 LocStat_NO_SUPPORTING_DISEQUALITIES : 96 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 48 TransStat_NO_SUPPORTING_DISEQUALITIES : 10 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.797510 RENAME_VARIABLES(MILLISECONDS) : 0.490086 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.721900 PROJECTAWAY(MILLISECONDS) : 0.086050 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001525 DISJOIN(MILLISECONDS) : 1.342959 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.547207 ADD_EQUALITY(MILLISECONDS) : 0.030412 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.021728 #CONJOIN_DISJUNCTIVE : 59 #RENAME_VARIABLES : 96 #UNFREEZE : 0 #CONJOIN : 112 #PROJECTAWAY : 81 #ADD_WEAK_EQUALITY : 21 #DISJOIN : 2 #RENAME_VARIABLES_DISJUNCTIVE : 91 #ADD_EQUALITY : 61 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 36 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 429 LocStat_NO_SUPPORTING_DISEQUALITIES : 125 LocStat_NO_DISJUNCTIONS : -72 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 72 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 47 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.748946 RENAME_VARIABLES(MILLISECONDS) : 0.377698 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.687659 PROJECTAWAY(MILLISECONDS) : 0.090063 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002497 DISJOIN(MILLISECONDS) : 0.847117 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.420766 ADD_EQUALITY(MILLISECONDS) : 0.016044 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.043487 #CONJOIN_DISJUNCTIVE : 88 #RENAME_VARIABLES : 149 #UNFREEZE : 0 #CONJOIN : 174 #PROJECTAWAY : 115 #ADD_WEAK_EQUALITY : 22 #DISJOIN : 5 #RENAME_VARIABLES_DISJUNCTIVE : 139 #ADD_EQUALITY : 77 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 36 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 373 LocStat_NO_SUPPORTING_DISEQUALITIES : 115 LocStat_NO_DISJUNCTIONS : -72 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 42 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 73 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 48 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.548512 RENAME_VARIABLES(MILLISECONDS) : 0.461989 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.513066 PROJECTAWAY(MILLISECONDS) : 1.082968 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002053 DISJOIN(MILLISECONDS) : 0.661814 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.495235 ADD_EQUALITY(MILLISECONDS) : 0.015692 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012711 #CONJOIN_DISJUNCTIVE : 134 #RENAME_VARIABLES : 257 #UNFREEZE : 0 #CONJOIN : 238 #PROJECTAWAY : 165 #ADD_WEAK_EQUALITY : 22 #DISJOIN : 21 #RENAME_VARIABLES_DISJUNCTIVE : 229 #ADD_EQUALITY : 78 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 11 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 38 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 398 LocStat_NO_SUPPORTING_DISEQUALITIES : 119 LocStat_NO_DISJUNCTIONS : -76 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 44 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 76 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 50 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.467702 RENAME_VARIABLES(MILLISECONDS) : 0.431879 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.429884 PROJECTAWAY(MILLISECONDS) : 0.746771 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.003327 DISJOIN(MILLISECONDS) : 0.662056 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.467314 ADD_EQUALITY(MILLISECONDS) : 0.033808 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016475 #CONJOIN_DISJUNCTIVE : 141 #RENAME_VARIABLES : 269 #UNFREEZE : 0 #CONJOIN : 245 #PROJECTAWAY : 170 #ADD_WEAK_EQUALITY : 22 #DISJOIN : 20 #RENAME_VARIABLES_DISJUNCTIVE : 241 #ADD_EQUALITY : 81 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 11 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 50 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 539 LocStat_NO_SUPPORTING_DISEQUALITIES : 144 LocStat_NO_DISJUNCTIONS : -100 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 56 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 79 TransStat_NO_SUPPORTING_DISEQUALITIES : 18 TransStat_NO_DISJUNCTIONS : 59 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.023850 RENAME_VARIABLES(MILLISECONDS) : 0.269123 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.001734 PROJECTAWAY(MILLISECONDS) : 0.047689 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001265 DISJOIN(MILLISECONDS) : 0.831691 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.302461 ADD_EQUALITY(MILLISECONDS) : 0.013084 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006946 #CONJOIN_DISJUNCTIVE : 213 #RENAME_VARIABLES : 388 #UNFREEZE : 0 #CONJOIN : 316 #PROJECTAWAY : 251 #ADD_WEAK_EQUALITY : 47 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 375 #ADD_EQUALITY : 109 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1054). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1059). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1054). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1059). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1023). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1023). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 105. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 61 error locations. TIMEOUT Result, 55.0s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 12.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1722 SDtfs, 3265 SDslu, 4516 SDs, 0 SdLazy, 5092 SolverSat, 279 SolverUnsat, 64 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 731 GetRequests, 496 SyntacticMatches, 33 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 524 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 731 NumberOfCodeBlocks, 731 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 965 ConstructedInterpolants, 20 QuantifiedInterpolants, 334466 SizeOfPredicates, 60 NumberOfNonLiveVariables, 971 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 32 InterpolantComputations, 16 PerfectInterpolantSequences, 24/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-34-36-379.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-34-36-379.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-34-36-379.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-34-36-379.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-34-36-379.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-34-36-379.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-34-36-379.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_17-34-36-379.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_17-34-36-379.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_17-34-36-379.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_17-34-36-379.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-34-36-379.csv Completed graceful shutdown