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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:38:32,526 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:38:32,527 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:38:32,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:38:32,540 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:38:32,541 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:38:32,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:38:32,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:38:32,546 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:38:32,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:38:32,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:38:32,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:38:32,548 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:38:32,548 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:38:32,549 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:38:32,552 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:38:32,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:38:32,556 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:38:32,557 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:38:32,559 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:38:32,561 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:38:32,562 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:38:32,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:38:32,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:38:32,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:38:32,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:38:32,565 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:38:32,566 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:38:32,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:38:32,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:38:32,567 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:38:32,568 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:38:32,577 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:38:32,578 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:38:32,579 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:38:32,579 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:38:32,579 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:38:32,579 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:38:32,579 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:38:32,580 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:38:32,580 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:38:32,580 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:38:32,581 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:38:32,581 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:38:32,581 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:38:32,581 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:38:32,581 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:38:32,581 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:38:32,582 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:38:32,582 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:38:32,582 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:38:32,582 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:38:32,583 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:38:32,583 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:38:32,583 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:38:32,583 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:38:32,583 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:38:32,583 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:38:32,584 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:38:32,584 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:38:32,584 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:38:32,584 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:38:32,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:38:32,585 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:38:32,585 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:38:32,586 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:38:32,620 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:38:32,631 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:38:32,634 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:38:32,635 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:38:32,636 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:38:32,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-01-24 12:38:32,820 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:38:32,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:38:32,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:38:32,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:38:32,831 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:38:32,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:38:32" (1/1) ... [2018-01-24 12:38:32,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7119c162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:32, skipping insertion in model container [2018-01-24 12:38:32,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:38:32" (1/1) ... [2018-01-24 12:38:32,849 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:38:32,889 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:38:33,019 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:38:33,042 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:38:33,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:33 WrapperNode [2018-01-24 12:38:33,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:38:33,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:38:33,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:38:33,055 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:38:33,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:33" (1/1) ... [2018-01-24 12:38:33,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:33" (1/1) ... [2018-01-24 12:38:33,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:33" (1/1) ... [2018-01-24 12:38:33,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:33" (1/1) ... [2018-01-24 12:38:33,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:33" (1/1) ... [2018-01-24 12:38:33,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:33" (1/1) ... [2018-01-24 12:38:33,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:33" (1/1) ... [2018-01-24 12:38:33,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:38:33,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:38:33,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:38:33,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:38:33,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:33" (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 12:38:33,140 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:38:33,140 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:38:33,140 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:38:33,141 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:38:33,141 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:38:33,141 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:38:33,141 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:38:33,141 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:38:33,141 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:38:33,141 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:38:33,141 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:38:33,141 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:38:33,142 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:38:33,142 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 12:38:33,142 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:38:33,142 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:38:33,142 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:38:33,685 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:38:33,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:38:33 BoogieIcfgContainer [2018-01-24 12:38:33,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:38:33,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:38:33,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:38:33,690 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:38:33,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:38:32" (1/3) ... [2018-01-24 12:38:33,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d945a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:38:33, skipping insertion in model container [2018-01-24 12:38:33,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:38:33" (2/3) ... [2018-01-24 12:38:33,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d945a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:38:33, skipping insertion in model container [2018-01-24 12:38:33,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:38:33" (3/3) ... [2018-01-24 12:38:33,695 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-01-24 12:38:33,704 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:38:33,713 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-01-24 12:38:33,762 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:38:33,762 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:38:33,762 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:38:33,762 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:38:33,763 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:38:33,763 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:38:33,763 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:38:33,763 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:38:33,764 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:38:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2018-01-24 12:38:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:38:33,793 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:33,794 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:33,794 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:33,798 INFO L82 PathProgramCache]: Analyzing trace with hash -102951268, now seen corresponding path program 1 times [2018-01-24 12:38:33,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:33,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:33,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:33,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:33,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:33,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:33,976 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 12:38:33,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:33,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:38:33,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:38:33,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:38:33,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:38:33,992 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 4 states. [2018-01-24 12:38:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:34,373 INFO L93 Difference]: Finished difference Result 309 states and 373 transitions. [2018-01-24 12:38:34,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:38:34,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:38:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:34,384 INFO L225 Difference]: With dead ends: 309 [2018-01-24 12:38:34,384 INFO L226 Difference]: Without dead ends: 190 [2018-01-24 12:38:34,387 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 12:38:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-24 12:38:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 149. [2018-01-24 12:38:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-24 12:38:34,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2018-01-24 12:38:34,426 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 8 [2018-01-24 12:38:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:34,426 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2018-01-24 12:38:34,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:38:34,426 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2018-01-24 12:38:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:38:34,427 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:34,427 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:34,427 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:34,427 INFO L82 PathProgramCache]: Analyzing trace with hash -102951267, now seen corresponding path program 1 times [2018-01-24 12:38:34,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:34,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:34,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:34,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:34,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:34,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:34,539 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 12:38:34,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:34,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:38:34,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:38:34,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:38:34,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:38:34,543 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand 4 states. [2018-01-24 12:38:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:34,761 INFO L93 Difference]: Finished difference Result 230 states and 240 transitions. [2018-01-24 12:38:34,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:38:34,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:38:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:34,764 INFO L225 Difference]: With dead ends: 230 [2018-01-24 12:38:34,764 INFO L226 Difference]: Without dead ends: 226 [2018-01-24 12:38:34,765 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 12:38:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-24 12:38:34,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 145. [2018-01-24 12:38:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-24 12:38:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2018-01-24 12:38:34,775 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 8 [2018-01-24 12:38:34,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:34,775 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2018-01-24 12:38:34,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:38:34,775 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2018-01-24 12:38:34,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:38:34,776 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:34,776 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:34,776 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:34,776 INFO L82 PathProgramCache]: Analyzing trace with hash 966243267, now seen corresponding path program 1 times [2018-01-24 12:38:34,776 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:34,776 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:34,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:34,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:34,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:34,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:34,865 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 12:38:34,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:34,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:38:34,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:38:34,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:38:34,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:38:34,866 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand 6 states. [2018-01-24 12:38:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:35,152 INFO L93 Difference]: Finished difference Result 203 states and 215 transitions. [2018-01-24 12:38:35,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:38:35,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-24 12:38:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:35,154 INFO L225 Difference]: With dead ends: 203 [2018-01-24 12:38:35,154 INFO L226 Difference]: Without dead ends: 190 [2018-01-24 12:38:35,154 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:38:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-24 12:38:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 146. [2018-01-24 12:38:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-24 12:38:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2018-01-24 12:38:35,166 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 14 [2018-01-24 12:38:35,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:35,167 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2018-01-24 12:38:35,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:38:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2018-01-24 12:38:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:38:35,168 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:35,168 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:35,168 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:35,169 INFO L82 PathProgramCache]: Analyzing trace with hash 966243268, now seen corresponding path program 1 times [2018-01-24 12:38:35,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:35,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:35,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:35,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:35,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:35,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:35,288 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 12:38:35,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:35,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:38:35,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:38:35,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:38:35,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:38:35,290 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand 6 states. [2018-01-24 12:38:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:35,583 INFO L93 Difference]: Finished difference Result 204 states and 227 transitions. [2018-01-24 12:38:35,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:38:35,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-24 12:38:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:35,586 INFO L225 Difference]: With dead ends: 204 [2018-01-24 12:38:35,586 INFO L226 Difference]: Without dead ends: 200 [2018-01-24 12:38:35,586 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:38:35,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-01-24 12:38:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 142. [2018-01-24 12:38:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 12:38:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2018-01-24 12:38:35,599 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 14 [2018-01-24 12:38:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:35,599 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2018-01-24 12:38:35,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:38:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2018-01-24 12:38:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:38:35,600 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:35,600 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] [2018-01-24 12:38:35,600 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:35,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1611969301, now seen corresponding path program 1 times [2018-01-24 12:38:35,601 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:35,601 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:35,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:35,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:35,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:35,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:35,714 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 12:38:35,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:35,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:38:35,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:38:35,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:38:35,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:38:35,716 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand 6 states. [2018-01-24 12:38:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:35,957 INFO L93 Difference]: Finished difference Result 200 states and 223 transitions. [2018-01-24 12:38:35,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:38:35,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 12:38:35,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:35,959 INFO L225 Difference]: With dead ends: 200 [2018-01-24 12:38:35,959 INFO L226 Difference]: Without dead ends: 197 [2018-01-24 12:38:35,959 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:38:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-24 12:38:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 139. [2018-01-24 12:38:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-24 12:38:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2018-01-24 12:38:35,966 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 20 [2018-01-24 12:38:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:35,967 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2018-01-24 12:38:35,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:38:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2018-01-24 12:38:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:38:35,967 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:35,968 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] [2018-01-24 12:38:35,968 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:35,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1611969302, now seen corresponding path program 1 times [2018-01-24 12:38:35,968 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:35,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:35,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:35,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:35,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:35,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:36,063 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 12:38:36,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:36,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:38:36,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:38:36,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:38:36,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:38:36,064 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand 6 states. [2018-01-24 12:38:36,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:36,264 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2018-01-24 12:38:36,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:38:36,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 12:38:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:36,265 INFO L225 Difference]: With dead ends: 183 [2018-01-24 12:38:36,265 INFO L226 Difference]: Without dead ends: 182 [2018-01-24 12:38:36,266 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:38:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-24 12:38:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 138. [2018-01-24 12:38:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 12:38:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2018-01-24 12:38:36,272 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 20 [2018-01-24 12:38:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:36,273 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2018-01-24 12:38:36,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:38:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-01-24 12:38:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:38:36,274 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:36,274 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 12:38:36,274 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:36,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1348719488, now seen corresponding path program 1 times [2018-01-24 12:38:36,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:36,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:36,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:36,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:36,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:36,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:36,340 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 12:38:36,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:36,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:38:36,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:38:36,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:38:36,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:38:36,341 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand 4 states. [2018-01-24 12:38:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:36,705 INFO L93 Difference]: Finished difference Result 182 states and 198 transitions. [2018-01-24 12:38:36,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:38:36,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-24 12:38:36,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:36,749 INFO L225 Difference]: With dead ends: 182 [2018-01-24 12:38:36,749 INFO L226 Difference]: Without dead ends: 177 [2018-01-24 12:38:36,750 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:38:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-24 12:38:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 133. [2018-01-24 12:38:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 12:38:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2018-01-24 12:38:36,759 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 29 [2018-01-24 12:38:36,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:36,759 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-01-24 12:38:36,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:38:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-01-24 12:38:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:38:36,760 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:36,760 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 12:38:36,760 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1348719489, now seen corresponding path program 1 times [2018-01-24 12:38:36,761 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:36,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:36,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:36,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:36,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:36,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:36,862 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 12:38:36,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:36,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:38:36,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:38:36,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:38:36,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:38:36,864 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand 4 states. [2018-01-24 12:38:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:37,017 INFO L93 Difference]: Finished difference Result 201 states and 224 transitions. [2018-01-24 12:38:37,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:38:37,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-24 12:38:37,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:37,019 INFO L225 Difference]: With dead ends: 201 [2018-01-24 12:38:37,019 INFO L226 Difference]: Without dead ends: 196 [2018-01-24 12:38:37,020 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:38:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-24 12:38:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 128. [2018-01-24 12:38:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-24 12:38:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2018-01-24 12:38:37,031 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 29 [2018-01-24 12:38:37,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:37,031 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2018-01-24 12:38:37,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:38:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2018-01-24 12:38:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:38:37,032 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:37,032 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] [2018-01-24 12:38:37,032 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:37,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1136810599, now seen corresponding path program 1 times [2018-01-24 12:38:37,033 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:37,033 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:37,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:37,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:37,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:37,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:37,110 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 12:38:37,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:37,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:38:37,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:38:37,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:38:37,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:38:37,112 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand 5 states. [2018-01-24 12:38:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:37,247 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-01-24 12:38:37,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:38:37,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-24 12:38:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:37,249 INFO L225 Difference]: With dead ends: 174 [2018-01-24 12:38:37,249 INFO L226 Difference]: Without dead ends: 171 [2018-01-24 12:38:37,250 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:38:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-24 12:38:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 135. [2018-01-24 12:38:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 12:38:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2018-01-24 12:38:37,256 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 30 [2018-01-24 12:38:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:37,256 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2018-01-24 12:38:37,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:38:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2018-01-24 12:38:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:38:37,257 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:37,258 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] [2018-01-24 12:38:37,258 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:37,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1136810598, now seen corresponding path program 1 times [2018-01-24 12:38:37,258 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:37,258 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:37,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:37,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:37,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:37,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:37,455 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 12:38:37,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:37,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:38:37,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:38:37,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:38:37,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:38:37,456 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand 8 states. [2018-01-24 12:38:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:37,960 INFO L93 Difference]: Finished difference Result 347 states and 391 transitions. [2018-01-24 12:38:37,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:38:37,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-01-24 12:38:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:37,962 INFO L225 Difference]: With dead ends: 347 [2018-01-24 12:38:37,962 INFO L226 Difference]: Without dead ends: 337 [2018-01-24 12:38:37,963 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:38:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-01-24 12:38:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 178. [2018-01-24 12:38:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-24 12:38:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 211 transitions. [2018-01-24 12:38:37,976 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 211 transitions. Word has length 30 [2018-01-24 12:38:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:37,976 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 211 transitions. [2018-01-24 12:38:37,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:38:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 211 transitions. [2018-01-24 12:38:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:38:37,977 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:37,978 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] [2018-01-24 12:38:37,978 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:37,978 INFO L82 PathProgramCache]: Analyzing trace with hash -881389387, now seen corresponding path program 1 times [2018-01-24 12:38:37,978 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:37,978 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:37,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:37,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:37,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:37,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:38,030 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 12:38:38,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:38,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:38:38,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:38:38,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:38:38,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:38:38,032 INFO L87 Difference]: Start difference. First operand 178 states and 211 transitions. Second operand 5 states. [2018-01-24 12:38:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:38,141 INFO L93 Difference]: Finished difference Result 218 states and 246 transitions. [2018-01-24 12:38:38,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:38:38,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-24 12:38:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:38,143 INFO L225 Difference]: With dead ends: 218 [2018-01-24 12:38:38,144 INFO L226 Difference]: Without dead ends: 215 [2018-01-24 12:38:38,144 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 12:38:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-24 12:38:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 178. [2018-01-24 12:38:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-24 12:38:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 210 transitions. [2018-01-24 12:38:38,156 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 210 transitions. Word has length 31 [2018-01-24 12:38:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:38,156 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 210 transitions. [2018-01-24 12:38:38,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:38:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 210 transitions. [2018-01-24 12:38:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 12:38:38,157 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:38,157 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, 1, 1] [2018-01-24 12:38:38,157 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:38,157 INFO L82 PathProgramCache]: Analyzing trace with hash 12023425, now seen corresponding path program 1 times [2018-01-24 12:38:38,158 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:38,158 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:38,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:38,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:38,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:38,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:38,584 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 12:38:38,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:38:38,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 12:38:38,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 12:38:38,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 12:38:38,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:38:38,585 INFO L87 Difference]: Start difference. First operand 178 states and 210 transitions. Second operand 16 states. [2018-01-24 12:38:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:39,658 INFO L93 Difference]: Finished difference Result 288 states and 343 transitions. [2018-01-24 12:38:39,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-24 12:38:39,658 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-01-24 12:38:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:39,661 INFO L225 Difference]: With dead ends: 288 [2018-01-24 12:38:39,661 INFO L226 Difference]: Without dead ends: 211 [2018-01-24 12:38:39,661 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 12:38:39,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-24 12:38:39,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 189. [2018-01-24 12:38:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-24 12:38:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 222 transitions. [2018-01-24 12:38:39,672 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 222 transitions. Word has length 35 [2018-01-24 12:38:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:39,673 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 222 transitions. [2018-01-24 12:38:39,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 12:38:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 222 transitions. [2018-01-24 12:38:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 12:38:39,674 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:39,674 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, 1, 1, 1] [2018-01-24 12:38:39,674 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:39,675 INFO L82 PathProgramCache]: Analyzing trace with hash -646683238, now seen corresponding path program 1 times [2018-01-24 12:38:39,675 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:39,675 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:39,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:39,676 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:39,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:39,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:38:40,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:38:40,250 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 12:38:40,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:40,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:38:40,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:38:40,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-01-24 12:38:40,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:38:40,456 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 12:38:40,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,463 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 12:38:40,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 12:38:40,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-01-24 12:38:40,601 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 12:38:40,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2018-01-24 12:38:40,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 12:38:40,626 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 12:38:40,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-24 12:38:40,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-01-24 12:38:40,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:33 [2018-01-24 12:38:40,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-01-24 12:38:40,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:38:40,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,751 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 12:38:40,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-01-24 12:38:40,910 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:40,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 80 [2018-01-24 12:38:40,947 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 82 treesize of output 66 [2018-01-24 12:38:40,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:40,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:41,008 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 4 case distinctions, treesize of input 51 treesize of output 57 [2018-01-24 12:38:41,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-24 12:38:41,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:38:41,067 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 3 xjuncts. [2018-01-24 12:38:41,067 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:77, output treesize:127 [2018-01-24 12:38:41,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:41,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 78 [2018-01-24 12:38:41,162 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 80 treesize of output 79 [2018-01-24 12:38:41,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:41,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:41,230 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 2 case distinctions, treesize of input 49 treesize of output 62 [2018-01-24 12:38:41,231 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:38:41,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:38:41,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-01-24 12:38:41,319 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:41,320 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 18 treesize of output 27 [2018-01-24 12:38:41,320 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:41,327 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:41,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-01-24 12:38:41,380 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 18 treesize of output 9 [2018-01-24 12:38:41,380 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:41,389 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:41,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:38:41,447 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:166, output treesize:102 [2018-01-24 12:38:41,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-01-24 12:38:41,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:41,541 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 20 treesize of output 31 [2018-01-24 12:38:41,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:41,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:41,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 79 [2018-01-24 12:38:41,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:41,596 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 86 treesize of output 101 [2018-01-24 12:38:41,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:41,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:41,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:41,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 75 [2018-01-24 12:38:41,676 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-24 12:38:41,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:38:41,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-24 12:38:41,747 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:146, output treesize:172 [2018-01-24 12:38:41,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 73 [2018-01-24 12:38:41,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:41,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2018-01-24 12:38:41,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:41,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:42,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-01-24 12:38:42,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:42,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 57 [2018-01-24 12:38:42,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:42,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:42,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 12:38:42,074 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:152, output treesize:144 [2018-01-24 12:38:42,513 WARN L143 SmtUtils]: Spent 294ms on a formula simplification that was a NOOP. DAG size: 48 [2018-01-24 12:38:42,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 68 [2018-01-24 12:38:42,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:42,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-01-24 12:38:42,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:42,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:42,685 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 45 treesize of output 39 [2018-01-24 12:38:42,685 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:42,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:42,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-01-24 12:38:42,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:42,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:42,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:42,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:158, output treesize:14 [2018-01-24 12:38:42,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:42,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-24 12:38:42,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:42,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:38:42,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2018-01-24 12:38:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:38:42,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:38:42,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 37 [2018-01-24 12:38:42,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-24 12:38:42,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-24 12:38:42,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1252, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 12:38:42,849 INFO L87 Difference]: Start difference. First operand 189 states and 222 transitions. Second operand 38 states. [2018-01-24 12:38:44,299 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 73 DAG size of output 69 [2018-01-24 12:38:44,496 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 92 DAG size of output 88 [2018-01-24 12:38:44,782 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 71 DAG size of output 69 [2018-01-24 12:38:49,186 WARN L146 SmtUtils]: Spent 4247ms on a formula simplification. DAG size of input: 89 DAG size of output 85 [2018-01-24 12:38:49,423 WARN L146 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 93 DAG size of output 89 [2018-01-24 12:38:50,907 WARN L146 SmtUtils]: Spent 1348ms on a formula simplification. DAG size of input: 62 DAG size of output 56 [2018-01-24 12:38:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:51,587 INFO L93 Difference]: Finished difference Result 264 states and 283 transitions. [2018-01-24 12:38:51,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-24 12:38:51,587 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-01-24 12:38:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:51,588 INFO L225 Difference]: With dead ends: 264 [2018-01-24 12:38:51,588 INFO L226 Difference]: Without dead ends: 263 [2018-01-24 12:38:51,589 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=752, Invalid=3668, Unknown=2, NotChecked=0, Total=4422 [2018-01-24 12:38:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-01-24 12:38:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 200. [2018-01-24 12:38:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-01-24 12:38:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 235 transitions. [2018-01-24 12:38:51,604 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 235 transitions. Word has length 45 [2018-01-24 12:38:51,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:51,604 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 235 transitions. [2018-01-24 12:38:51,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-24 12:38:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 235 transitions. [2018-01-24 12:38:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 12:38:51,605 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:51,605 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, 1, 1, 1] [2018-01-24 12:38:51,605 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:51,606 INFO L82 PathProgramCache]: Analyzing trace with hash -646683237, now seen corresponding path program 1 times [2018-01-24 12:38:51,606 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:51,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:51,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:51,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:51,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:51,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:38:52,140 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:38:52,140 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:38:52,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:52,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:38:52,192 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 12:38:52,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,200 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 12:38:52,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-24 12:38:52,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:38:52,227 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 12:38:52,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:38:52,240 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 12:38:52,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,248 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 12:38:52,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-01-24 12:38:52,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-01-24 12:38:52,312 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 20 treesize of output 19 [2018-01-24 12:38:52,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-01-24 12:38:52,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 12:38:52,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,349 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2018-01-24 12:38:52,375 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-01-24 12:38:52,380 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 12:38:52,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-01-24 12:38:52,409 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 12:38:52,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,429 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:84, output treesize:80 [2018-01-24 12:38:52,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,468 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 23 treesize of output 41 [2018-01-24 12:38:52,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,485 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,485 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-24 12:38:52,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:87 [2018-01-24 12:38:52,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-01-24 12:38:52,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 12:38:52,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2018-01-24 12:38:52,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,580 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 20 treesize of output 31 [2018-01-24 12:38:52,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,603 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 12:38:52,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:99 [2018-01-24 12:38:52,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 122 [2018-01-24 12:38:52,744 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 12:38:52,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2018-01-24 12:38:52,802 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 24 treesize of output 23 [2018-01-24 12:38:52,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:38:52,826 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:157, output treesize:111 [2018-01-24 12:38:52,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,875 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 116 [2018-01-24 12:38:52,883 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 12:38:52,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:52,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-01-24 12:38:52,932 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 18 treesize of output 17 [2018-01-24 12:38:52,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:52,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:38:52,959 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:145, output treesize:137 [2018-01-24 12:38:53,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 141 [2018-01-24 12:38:53,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:53,014 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 24 treesize of output 39 [2018-01-24 12:38:53,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 80 [2018-01-24 12:38:53,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:53,092 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 24 treesize of output 39 [2018-01-24 12:38:53,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:38:53,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:196, output treesize:172 [2018-01-24 12:38:53,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 132 [2018-01-24 12:38:53,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:53,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 175 [2018-01-24 12:38:53,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 97 [2018-01-24 12:38:53,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:53,370 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 12:38:53,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:38:53,429 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:198, output treesize:190 [2018-01-24 12:38:53,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 111 [2018-01-24 12:38:53,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:53,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-01-24 12:38:53,536 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 12:38:53,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:53,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 52 treesize of output 36 [2018-01-24 12:38:53,570 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:53,589 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 13 treesize of output 6 [2018-01-24 12:38:53,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:38:53,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-01-24 12:38:53,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:53,634 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 13 treesize of output 6 [2018-01-24 12:38:53,634 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,650 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 7 treesize of output 1 [2018-01-24 12:38:53,650 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:53,657 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 18 treesize of output 10 [2018-01-24 12:38:53,657 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,660 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:53,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:38:53,671 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:204, output treesize:23 [2018-01-24 12:38:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:38:53,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:38:53,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2018-01-24 12:38:53,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-24 12:38:53,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-24 12:38:53,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 12:38:53,789 INFO L87 Difference]: Start difference. First operand 200 states and 235 transitions. Second operand 34 states. [2018-01-24 12:38:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:38:56,309 INFO L93 Difference]: Finished difference Result 269 states and 300 transitions. [2018-01-24 12:38:56,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 12:38:56,309 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2018-01-24 12:38:56,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:38:56,310 INFO L225 Difference]: With dead ends: 269 [2018-01-24 12:38:56,311 INFO L226 Difference]: Without dead ends: 264 [2018-01-24 12:38:56,312 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=491, Invalid=2701, Unknown=0, NotChecked=0, Total=3192 [2018-01-24 12:38:56,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-24 12:38:56,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 199. [2018-01-24 12:38:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-24 12:38:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2018-01-24 12:38:56,325 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 45 [2018-01-24 12:38:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:38:56,326 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2018-01-24 12:38:56,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-24 12:38:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2018-01-24 12:38:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:38:56,326 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:38:56,327 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:38:56,327 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:38:56,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1427656916, now seen corresponding path program 1 times [2018-01-24 12:38:56,327 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:38:56,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:38:56,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:56,328 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:56,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:38:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:56,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:38:56,661 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 12:38:56,661 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:38:56,661 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 12:38:56,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:38:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:38:56,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:38:56,705 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:56,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:56,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-01-24 12:38:56,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-01-24 12:38:56,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:38:56,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:38:56,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,735 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 12:38:56,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2018-01-24 12:38:56,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:56,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-01-24 12:38:56,780 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 12:38:56,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:29 [2018-01-24 12:38:56,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:56,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-01-24 12:38:56,794 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 12:38:56,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-24 12:38:56,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:56,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:56,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:38:56,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:37 [2018-01-24 12:38:56,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:56,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-01-24 12:38:56,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:56,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:38:56,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:56,872 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 12:38:56,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 [2018-01-24 12:38:56,962 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:56,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 79 [2018-01-24 12:38:56,981 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 81 treesize of output 65 [2018-01-24 12:38:56,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:57,010 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,026 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 4 case distinctions, treesize of input 52 treesize of output 64 [2018-01-24 12:38:57,027 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-24 12:38:57,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:38:57,086 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 3 xjuncts. [2018-01-24 12:38:57,086 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:72, output treesize:112 [2018-01-24 12:38:57,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-01-24 12:38:57,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,143 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 18 treesize of output 27 [2018-01-24 12:38:57,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:57,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:57,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,184 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 49 [2018-01-24 12:38:57,186 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 26 treesize of output 14 [2018-01-24 12:38:57,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:57,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:57,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 73 [2018-01-24 12:38:57,239 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 75 treesize of output 74 [2018-01-24 12:38:57,239 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:57,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,330 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,337 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 2 case distinctions, treesize of input 44 treesize of output 61 [2018-01-24 12:38:57,337 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-24 12:38:57,371 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:38:57,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:38:57,390 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:151, output treesize:92 [2018-01-24 12:38:57,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-01-24 12:38:57,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,440 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 20 treesize of output 31 [2018-01-24 12:38:57,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:57,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:57,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 74 [2018-01-24 12:38:57,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,488 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 81 treesize of output 96 [2018-01-24 12:38:57,489 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:57,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:57,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 88 [2018-01-24 12:38:57,542 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-24 12:38:57,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:38:57,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-24 12:38:57,599 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:136, output treesize:167 [2018-01-24 12:38:58,732 WARN L146 SmtUtils]: Spent 1091ms on a formula simplification. DAG size of input: 50 DAG size of output 39 [2018-01-24 12:38:58,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 68 [2018-01-24 12:38:58,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:58,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 89 [2018-01-24 12:38:58,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:58,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:58,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-01-24 12:38:58,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:58,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 56 [2018-01-24 12:38:58,841 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:58,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:58,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 12:38:58,865 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:142, output treesize:134 [2018-01-24 12:38:58,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2018-01-24 12:38:58,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-01-24 12:38:58,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:58,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:58,954 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 13 treesize of output 6 [2018-01-24 12:38:58,954 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:58,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:58,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 63 [2018-01-24 12:38:58,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 56 treesize of output 46 [2018-01-24 12:38:58,996 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:59,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:59,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-01-24 12:38:59,024 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:59,040 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:38:59,041 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 21 treesize of output 15 [2018-01-24 12:38:59,041 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:38:59,050 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:59,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:38:59,055 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:148, output treesize:4 [2018-01-24 12:38:59,066 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 12:38:59,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:38:59,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 32 [2018-01-24 12:38:59,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-24 12:38:59,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-24 12:38:59,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2018-01-24 12:38:59,087 INFO L87 Difference]: Start difference. First operand 199 states and 233 transitions. Second operand 32 states. [2018-01-24 12:39:00,389 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 76 DAG size of output 66 [2018-01-24 12:39:00,549 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 83 DAG size of output 83 [2018-01-24 12:39:04,680 WARN L143 SmtUtils]: Spent 3890ms on a formula simplification that was a NOOP. DAG size: 75 [2018-01-24 12:39:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:39:05,520 INFO L93 Difference]: Finished difference Result 261 states and 289 transitions. [2018-01-24 12:39:05,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 12:39:05,520 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 46 [2018-01-24 12:39:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:39:05,521 INFO L225 Difference]: With dead ends: 261 [2018-01-24 12:39:05,521 INFO L226 Difference]: Without dead ends: 258 [2018-01-24 12:39:05,523 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=476, Invalid=2494, Unknown=0, NotChecked=0, Total=2970 [2018-01-24 12:39:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-24 12:39:05,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 197. [2018-01-24 12:39:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-24 12:39:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 230 transitions. [2018-01-24 12:39:05,540 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 230 transitions. Word has length 46 [2018-01-24 12:39:05,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:39:05,540 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 230 transitions. [2018-01-24 12:39:05,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-24 12:39:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 230 transitions. [2018-01-24 12:39:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:39:05,541 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:39:05,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:39:05,541 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:39:05,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1219639155, now seen corresponding path program 1 times [2018-01-24 12:39:05,542 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:39:05,542 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:39:05,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:39:05,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:39:05,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:39:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:39:05,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:39:06,071 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 12:39:06,071 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:39:06,071 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 12:39:06,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:39:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:39:06,112 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:39:06,142 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:06,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:06,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:39:06,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-24 12:39:06,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:39:06,172 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 12:39:06,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,189 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 12:39:06,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-01-24 12:39:06,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:06,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-01-24 12:39:06,278 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 12:39:06,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2018-01-24 12:39:06,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:06,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 12:39:06,305 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 12:39:06,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-01-24 12:39:06,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:06,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:06,337 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 12:39:06,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:39 [2018-01-24 12:39:06,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:06,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-01-24 12:39:06,379 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:06,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:39:06,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,396 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 12:39:06,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:52 [2018-01-24 12:39:06,498 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:06,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 87 [2018-01-24 12:39:06,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:06,531 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 4 case distinctions, treesize of input 70 treesize of output 70 [2018-01-24 12:39:06,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-24 12:39:06,595 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 83 treesize of output 67 [2018-01-24 12:39:06,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:39:06,650 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 3 xjuncts. [2018-01-24 12:39:06,650 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:91, output treesize:151 [2018-01-24 12:39:06,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:06,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 86 [2018-01-24 12:39:06,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:06,742 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 2 case distinctions, treesize of input 69 treesize of output 76 [2018-01-24 12:39:06,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:39:06,796 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 82 treesize of output 81 [2018-01-24 12:39:06,797 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:39:06,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:06,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-01-24 12:39:06,891 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 18 treesize of output 9 [2018-01-24 12:39:06,892 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,899 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:06,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:39:06,943 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:190, output treesize:121 [2018-01-24 12:39:07,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 87 [2018-01-24 12:39:07,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:07,012 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 100 treesize of output 115 [2018-01-24 12:39:07,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:07,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:07,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:07,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 76 [2018-01-24 12:39:07,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:39:07,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:39:07,132 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 55 treesize of output 45 [2018-01-24 12:39:07,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:07,135 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 20 treesize of output 31 [2018-01-24 12:39:07,135 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:07,142 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:07,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-24 12:39:07,171 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:161, output treesize:188 [2018-01-24 12:39:07,349 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 54 DAG size of output 45 [2018-01-24 12:39:07,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:07,361 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:07,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:07,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:07,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 128 [2018-01-24 12:39:07,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:07,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:07,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:07,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:07,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 70 [2018-01-24 12:39:07,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:07,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 12:39:07,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:163, output treesize:187 [2018-01-24 12:39:07,806 WARN L143 SmtUtils]: Spent 265ms on a formula simplification that was a NOOP. DAG size: 54 [2018-01-24 12:39:07,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 112 [2018-01-24 12:39:07,833 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 12:39:07,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:07,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:07,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2018-01-24 12:39:07,897 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 12:39:07,897 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:07,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:07,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 12:39:07,944 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:209, output treesize:201 [2018-01-24 12:39:10,053 WARN L143 SmtUtils]: Spent 2063ms on a formula simplification that was a NOOP. DAG size: 58 [2018-01-24 12:39:10,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 125 [2018-01-24 12:39:10,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:10,076 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 22 treesize of output 14 [2018-01-24 12:39:10,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:10,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:10,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 84 [2018-01-24 12:39:10,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:10,147 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 22 treesize of output 14 [2018-01-24 12:39:10,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:10,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:10,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-01-24 12:39:10,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:239, output treesize:201 [2018-01-24 12:39:10,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 99 [2018-01-24 12:39:10,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 81 [2018-01-24 12:39:10,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:10,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 71 [2018-01-24 12:39:10,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:10,530 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 77 treesize of output 72 [2018-01-24 12:39:10,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:10,569 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 71 treesize of output 66 [2018-01-24 12:39:10,569 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:10,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:10,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 63 [2018-01-24 12:39:10,610 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 12:39:10,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:10,661 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 57 treesize of output 51 [2018-01-24 12:39:10,661 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:10,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:10,696 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:10,706 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 2 case distinctions, treesize of input 66 treesize of output 71 [2018-01-24 12:39:10,708 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:39:10,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 7 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 12:39:10,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2018-01-24 12:39:10,812 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 12:39:10,813 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:10,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:10,849 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 13 treesize of output 6 [2018-01-24 12:39:10,849 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:10,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-01-24 12:39:10,860 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:10,867 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:10,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-01-24 12:39:10,915 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:215, output treesize:156 [2018-01-24 12:39:11,023 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 12:39:11,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:39:11,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2018-01-24 12:39:11,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-24 12:39:11,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-24 12:39:11,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1469, Unknown=1, NotChecked=0, Total=1640 [2018-01-24 12:39:11,045 INFO L87 Difference]: Start difference. First operand 197 states and 230 transitions. Second operand 41 states. [2018-01-24 12:39:13,075 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 91 DAG size of output 72 [2018-01-24 12:39:13,488 WARN L146 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 102 DAG size of output 86 [2018-01-24 12:39:13,867 WARN L146 SmtUtils]: Spent 282ms on a formula simplification. DAG size of input: 106 DAG size of output 90 [2018-01-24 12:39:16,215 WARN L146 SmtUtils]: Spent 2179ms on a formula simplification. DAG size of input: 93 DAG size of output 78 [2018-01-24 12:39:18,729 WARN L146 SmtUtils]: Spent 2352ms on a formula simplification. DAG size of input: 131 DAG size of output 127 [2018-01-24 12:39:19,372 WARN L146 SmtUtils]: Spent 456ms on a formula simplification. DAG size of input: 140 DAG size of output 130 [2018-01-24 12:39:19,608 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 91 DAG size of output 76 [2018-01-24 12:39:22,025 WARN L146 SmtUtils]: Spent 2119ms on a formula simplification. DAG size of input: 106 DAG size of output 101 [2018-01-24 12:39:22,248 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 77 DAG size of output 73 [2018-01-24 12:39:24,650 WARN L146 SmtUtils]: Spent 2138ms on a formula simplification. DAG size of input: 80 DAG size of output 76 [2018-01-24 12:39:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:39:26,397 INFO L93 Difference]: Finished difference Result 578 states and 640 transitions. [2018-01-24 12:39:26,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-24 12:39:26,398 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 47 [2018-01-24 12:39:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:39:26,399 INFO L225 Difference]: With dead ends: 578 [2018-01-24 12:39:26,399 INFO L226 Difference]: Without dead ends: 577 [2018-01-24 12:39:26,401 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=1470, Invalid=6530, Unknown=10, NotChecked=0, Total=8010 [2018-01-24 12:39:26,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-01-24 12:39:26,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 275. [2018-01-24 12:39:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-01-24 12:39:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 333 transitions. [2018-01-24 12:39:26,417 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 333 transitions. Word has length 47 [2018-01-24 12:39:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:39:26,417 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 333 transitions. [2018-01-24 12:39:26,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-24 12:39:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 333 transitions. [2018-01-24 12:39:26,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:39:26,418 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:39:26,418 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:39:26,418 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:39:26,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1219639156, now seen corresponding path program 1 times [2018-01-24 12:39:26,418 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:39:26,418 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:39:26,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:39:26,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:39:26,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:39:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:39:26,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:39:27,025 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 12:39:27,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:39:27,025 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:39:27,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:39:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:39:27,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:39:27,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,081 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 12:39:27,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-01-24 12:39:27,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:39:27,106 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 12:39:27,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:39:27,117 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 12:39:27,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,124 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 12:39:27,124 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-01-24 12:39:27,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-24 12:39:27,194 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 12:39:27,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,209 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-01-24 12:39:27,214 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 20 treesize of output 19 [2018-01-24 12:39:27,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,224 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:44 [2018-01-24 12:39:27,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-01-24 12:39:27,258 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 12:39:27,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-01-24 12:39:27,280 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 12:39:27,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:66 [2018-01-24 12:39:27,329 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,330 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 14 treesize of output 21 [2018-01-24 12:39:27,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-01-24 12:39:27,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:92 [2018-01-24 12:39:27,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-01-24 12:39:27,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 12:39:27,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2018-01-24 12:39:27,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,466 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 20 treesize of output 31 [2018-01-24 12:39:27,467 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,493 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 12:39:27,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:122, output treesize:107 [2018-01-24 12:39:27,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 131 [2018-01-24 12:39:27,658 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 12:39:27,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,705 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2018-01-24 12:39:27,715 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 24 treesize of output 23 [2018-01-24 12:39:27,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:39:27,742 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:173, output treesize:127 [2018-01-24 12:39:27,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-01-24 12:39:27,806 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 18 treesize of output 17 [2018-01-24 12:39:27,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,847 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 138 [2018-01-24 12:39:27,858 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 12:39:27,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:39:27,906 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:161, output treesize:153 [2018-01-24 12:39:27,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 80 [2018-01-24 12:39:27,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:27,980 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 24 treesize of output 39 [2018-01-24 12:39:27,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:27,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 142 [2018-01-24 12:39:28,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,031 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 24 treesize of output 39 [2018-01-24 12:39:28,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:39:28,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:212, output treesize:188 [2018-01-24 12:39:28,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 90 [2018-01-24 12:39:28,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,211 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,211 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-01-24 12:39:28,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:39:28,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:199, output treesize:170 [2018-01-24 12:39:28,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 121 [2018-01-24 12:39:28,357 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 12:39:28,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 153 [2018-01-24 12:39:28,418 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 12:39:28,418 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:39:28,467 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:192, output treesize:184 [2018-01-24 12:39:28,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 166 [2018-01-24 12:39:28,551 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,552 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 22 treesize of output 14 [2018-01-24 12:39:28,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 134 [2018-01-24 12:39:28,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,627 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 22 treesize of output 14 [2018-01-24 12:39:28,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 12:39:28,668 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:222, output treesize:184 [2018-01-24 12:39:28,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 118 [2018-01-24 12:39:28,828 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 12:39:28,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2018-01-24 12:39:28,852 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,871 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,872 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 13 treesize of output 6 [2018-01-24 12:39:28,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-01-24 12:39:28,890 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:39:28,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:39:28,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-01-24 12:39:28,936 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 12:39:28,936 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,951 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 12:39:28,951 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,959 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:39:28,959 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 13 treesize of output 6 [2018-01-24 12:39:28,959 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,964 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 7 treesize of output 1 [2018-01-24 12:39:28,964 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,965 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:39:28,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:39:28,975 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:198, output treesize:23 [2018-01-24 12:39:29,070 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 12:39:29,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:39:29,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2018-01-24 12:39:29,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-24 12:39:29,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-24 12:39:29,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1417, Unknown=1, NotChecked=0, Total=1560 [2018-01-24 12:39:29,093 INFO L87 Difference]: Start difference. First operand 275 states and 333 transitions. Second operand 40 states. [2018-01-24 12:39:29,907 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 96 DAG size of output 70 [2018-01-24 12:39:30,064 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 116 DAG size of output 75 Received shutdown request... [2018-01-24 12:39:30,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:39:30,581 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:39:30,587 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:39:30,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:39:30 BoogieIcfgContainer [2018-01-24 12:39:30,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:39:30,588 INFO L168 Benchmark]: Toolchain (without parser) took 57767.55 ms. Allocated memory was 300.9 MB in the beginning and 755.0 MB in the end (delta: 454.0 MB). Free memory was 261.0 MB in the beginning and 582.2 MB in the end (delta: -321.2 MB). Peak memory consumption was 132.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:39:30,590 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:39:30,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.44 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 247.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:39:30,590 INFO L168 Benchmark]: Boogie Preprocessor took 38.48 ms. Allocated memory is still 300.9 MB. Free memory was 247.9 MB in the beginning and 245.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:39:30,591 INFO L168 Benchmark]: RCFGBuilder took 592.89 ms. Allocated memory is still 300.9 MB. Free memory was 245.8 MB in the beginning and 206.5 MB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:39:30,591 INFO L168 Benchmark]: TraceAbstraction took 56899.78 ms. Allocated memory was 300.9 MB in the beginning and 755.0 MB in the end (delta: 454.0 MB). Free memory was 205.6 MB in the beginning and 582.2 MB in the end (delta: -376.7 MB). Peak memory consumption was 77.4 MB. Max. memory is 5.3 GB. [2018-01-24 12:39:30,593 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.13 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.44 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 247.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.48 ms. Allocated memory is still 300.9 MB. Free memory was 247.9 MB in the beginning and 245.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 592.89 ms. Allocated memory is still 300.9 MB. Free memory was 245.8 MB in the beginning and 206.5 MB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56899.78 ms. Allocated memory was 300.9 MB in the beginning and 755.0 MB in the end (delta: 454.0 MB). Free memory was 205.6 MB in the beginning and 582.2 MB in the end (delta: -376.7 MB). Peak memory consumption was 77.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1056). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1056). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 18 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 156 locations, 65 error locations. TIMEOUT Result, 56.8s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 38.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1512 SDtfs, 9071 SDslu, 7951 SDs, 0 SdLazy, 9135 SolverSat, 1480 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 621 GetRequests, 160 SyntacticMatches, 45 SemanticMatches, 415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6366 ImplicationChecksByTransitivity, 38.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 1183 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 706 ConstructedInterpolants, 131 QuantifiedInterpolants, 1132159 SizeOfPredicates, 69 NumberOfNonLiveVariables, 1107 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 0/24 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/sll-buckets_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-39-30-604.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-buckets_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-39-30-604.csv Completed graceful shutdown