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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_true-valid-memsafety.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-ccafca9-m
[2018-02-03 23:24:38,138 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-03 23:24:38,139 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-03 23:24:38,152 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-03 23:24:38,153 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-03 23:24:38,153 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-03 23:24:38,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-03 23:24:38,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-03 23:24:38,158 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-03 23:24:38,159 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-03 23:24:38,159 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-03 23:24:38,160 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-03 23:24:38,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-03 23:24:38,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-03 23:24:38,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-03 23:24:38,164 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-03 23:24:38,166 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-03 23:24:38,168 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-03 23:24:38,169 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-03 23:24:38,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-03 23:24:38,171 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-03 23:24:38,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-03 23:24:38,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-03 23:24:38,173 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-03 23:24:38,174 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-03 23:24:38,175 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-03 23:24:38,175 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-03 23:24:38,175 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-03 23:24:38,175 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-03 23:24:38,176 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-03 23:24:38,176 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-03 23:24:38,176 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf
[2018-02-03 23:24:38,186 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-03 23:24:38,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-03 23:24:38,187 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-03 23:24:38,187 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-03 23:24:38,187 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-03 23:24:38,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-03 23:24:38,187 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-03 23:24:38,187 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-03 23:24:38,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-03 23:24:38,188 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-03 23:24:38,188 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-03 23:24:38,188 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-03 23:24:38,188 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-03 23:24:38,188 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-03 23:24:38,188 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-03 23:24:38,188 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-03 23:24:38,188 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-03 23:24:38,188 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-03 23:24:38,189 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-03 23:24:38,189 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-03 23:24:38,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-03 23:24:38,189 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-03 23:24:38,189 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-02-03 23:24:38,189 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-02-03 23:24:38,189 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-02-03 23:24:38,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-03 23:24:38,225 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-03 23:24:38,228 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-03 23:24:38,229 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-03 23:24:38,229 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-03 23:24:38,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_true-valid-memsafety.i
[2018-02-03 23:24:38,351 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-03 23:24:38,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-03 23:24:38,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-03 23:24:38,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-03 23:24:38,357 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-03 23:24:38,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:24:38" (1/1) ...
[2018-02-03 23:24:38,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ddcc363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:38, skipping insertion in model container
[2018-02-03 23:24:38,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:24:38" (1/1) ...
[2018-02-03 23:24:38,371 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-03 23:24:38,397 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-03 23:24:38,485 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-03 23:24:38,498 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-03 23:24:38,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:38 WrapperNode
[2018-02-03 23:24:38,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-03 23:24:38,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-03 23:24:38,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-03 23:24:38,505 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-03 23:24:38,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:38" (1/1) ...
[2018-02-03 23:24:38,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:38" (1/1) ...
[2018-02-03 23:24:38,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:38" (1/1) ...
[2018-02-03 23:24:38,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:38" (1/1) ...
[2018-02-03 23:24:38,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:38" (1/1) ...
[2018-02-03 23:24:38,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:38" (1/1) ...
[2018-02-03 23:24:38,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:38" (1/1) ...
[2018-02-03 23:24:38,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-03 23:24:38,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-03 23:24:38,531 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-03 23:24:38,532 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-03 23:24:38,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:38" (1/1) ...
No working directory specified, using /home/ultimate/work/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-02-03 23:24:38,571 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-03 23:24:38,571 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-03 23:24:38,571 INFO L136 BoogieDeclarations]: Found implementation of procedure append
[2018-02-03 23:24:38,571 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-03 23:24:38,571 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-03 23:24:38,571 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-03 23:24:38,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-03 23:24:38,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-03 23:24:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-03 23:24:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-03 23:24:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-02-03 23:24:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-03 23:24:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure append
[2018-02-03 23:24:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-03 23:24:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-03 23:24:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-03 23:24:38,828 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-03 23:24:38,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:24:38 BoogieIcfgContainer
[2018-02-03 23:24:38,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-03 23:24:38,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-03 23:24:38,829 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-03 23:24:38,831 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-03 23:24:38,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:24:38" (1/3) ...
[2018-02-03 23:24:38,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2ffa62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:24:38, skipping insertion in model container
[2018-02-03 23:24:38,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:38" (2/3) ...
[2018-02-03 23:24:38,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2ffa62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:24:38, skipping insertion in model container
[2018-02-03 23:24:38,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:24:38" (3/3) ...
[2018-02-03 23:24:38,833 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_true-valid-memsafety.i
[2018-02-03 23:24:38,840 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-02-03 23:24:38,844 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations.
[2018-02-03 23:24:38,875 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-03 23:24:38,875 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-03 23:24:38,875 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-02-03 23:24:38,875 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-02-03 23:24:38,875 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-03 23:24:38,875 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-03 23:24:38,875 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-03 23:24:38,876 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-03 23:24:38,876 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-03 23:24:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states.
[2018-02-03 23:24:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2018-02-03 23:24:38,896 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:38,897 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:38,897 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:38,901 INFO L82 PathProgramCache]: Analyzing trace with hash -473238968, now seen corresponding path program 1 times
[2018-02-03 23:24:38,903 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:38,904 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:38,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:38,947 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:38,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:38,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:39,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:39,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-03 23:24:39,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-03 23:24:39,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-03 23:24:39,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-03 23:24:39,045 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 3 states.
[2018-02-03 23:24:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:39,183 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions.
[2018-02-03 23:24:39,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-03 23:24:39,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2018-02-03 23:24:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:39,247 INFO L225 Difference]: With dead ends: 102
[2018-02-03 23:24:39,247 INFO L226 Difference]: Without dead ends: 99
[2018-02-03 23:24:39,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-03 23:24:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2018-02-03 23:24:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97.
[2018-02-03 23:24:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2018-02-03 23:24:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions.
[2018-02-03 23:24:39,280 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 7
[2018-02-03 23:24:39,280 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:39,280 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions.
[2018-02-03 23:24:39,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-03 23:24:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions.
[2018-02-03 23:24:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2018-02-03 23:24:39,280 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:39,281 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:39,281 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:39,281 INFO L82 PathProgramCache]: Analyzing trace with hash -473238967, now seen corresponding path program 1 times
[2018-02-03 23:24:39,281 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:39,281 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:39,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:39,282 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:39,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:39,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:39,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:39,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-03 23:24:39,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-03 23:24:39,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-03 23:24:39,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-03 23:24:39,340 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 3 states.
[2018-02-03 23:24:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:39,415 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions.
[2018-02-03 23:24:39,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-03 23:24:39,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2018-02-03 23:24:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:39,417 INFO L225 Difference]: With dead ends: 98
[2018-02-03 23:24:39,417 INFO L226 Difference]: Without dead ends: 98
[2018-02-03 23:24:39,418 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-03 23:24:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2018-02-03 23:24:39,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96.
[2018-02-03 23:24:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states.
[2018-02-03 23:24:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions.
[2018-02-03 23:24:39,425 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 7
[2018-02-03 23:24:39,425 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:39,425 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions.
[2018-02-03 23:24:39,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-03 23:24:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions.
[2018-02-03 23:24:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-02-03 23:24:39,426 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:39,426 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:39,426 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash -799395641, now seen corresponding path program 1 times
[2018-02-03 23:24:39,427 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:39,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:39,428 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:39,428 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:39,428 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:39,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:39,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:39,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-03 23:24:39,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-03 23:24:39,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-03 23:24:39,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-03 23:24:39,493 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 5 states.
[2018-02-03 23:24:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:39,600 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions.
[2018-02-03 23:24:39,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-03 23:24:39,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2018-02-03 23:24:39,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:39,601 INFO L225 Difference]: With dead ends: 93
[2018-02-03 23:24:39,601 INFO L226 Difference]: Without dead ends: 93
[2018-02-03 23:24:39,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-02-03 23:24:39,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2018-02-03 23:24:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93.
[2018-02-03 23:24:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2018-02-03 23:24:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions.
[2018-02-03 23:24:39,607 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 13
[2018-02-03 23:24:39,607 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:39,607 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions.
[2018-02-03 23:24:39,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-03 23:24:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions.
[2018-02-03 23:24:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-02-03 23:24:39,608 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:39,608 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:39,608 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash -799395640, now seen corresponding path program 1 times
[2018-02-03 23:24:39,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:39,609 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:39,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:39,610 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:39,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:39,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:39,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:39,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-03 23:24:39,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-03 23:24:39,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-03 23:24:39,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-03 23:24:39,709 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 7 states.
[2018-02-03 23:24:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:39,939 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions.
[2018-02-03 23:24:39,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-03 23:24:39,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13
[2018-02-03 23:24:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:39,943 INFO L225 Difference]: With dead ends: 123
[2018-02-03 23:24:39,943 INFO L226 Difference]: Without dead ends: 123
[2018-02-03 23:24:39,943 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2018-02-03 23:24:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states.
[2018-02-03 23:24:39,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113.
[2018-02-03 23:24:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2018-02-03 23:24:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions.
[2018-02-03 23:24:39,947 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 13
[2018-02-03 23:24:39,947 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:39,948 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions.
[2018-02-03 23:24:39,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-03 23:24:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions.
[2018-02-03 23:24:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-02-03 23:24:39,948 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:39,948 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:39,948 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:39,948 INFO L82 PathProgramCache]: Analyzing trace with hash 988538978, now seen corresponding path program 1 times
[2018-02-03 23:24:39,948 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:39,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:39,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:39,949 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:39,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:39,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:39,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-02-03 23:24:39,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:39,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-03 23:24:39,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-03 23:24:39,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-03 23:24:39,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-03 23:24:39,977 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 4 states.
[2018-02-03 23:24:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:40,036 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions.
[2018-02-03 23:24:40,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-03 23:24:40,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2018-02-03 23:24:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:40,037 INFO L225 Difference]: With dead ends: 109
[2018-02-03 23:24:40,037 INFO L226 Difference]: Without dead ends: 109
[2018-02-03 23:24:40,037 INFO L554 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-02-03 23:24:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2018-02-03 23:24:40,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109.
[2018-02-03 23:24:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states.
[2018-02-03 23:24:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions.
[2018-02-03 23:24:40,042 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 14
[2018-02-03 23:24:40,042 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:40,042 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions.
[2018-02-03 23:24:40,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-03 23:24:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions.
[2018-02-03 23:24:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-02-03 23:24:40,043 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:40,043 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:40,043 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:40,043 INFO L82 PathProgramCache]: Analyzing trace with hash 988538979, now seen corresponding path program 1 times
[2018-02-03 23:24:40,043 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:40,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:40,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:40,044 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:40,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:40,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:40,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:40,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-03 23:24:40,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-03 23:24:40,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-03 23:24:40,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-03 23:24:40,090 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 4 states.
[2018-02-03 23:24:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:40,135 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions.
[2018-02-03 23:24:40,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-03 23:24:40,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2018-02-03 23:24:40,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:40,136 INFO L225 Difference]: With dead ends: 105
[2018-02-03 23:24:40,137 INFO L226 Difference]: Without dead ends: 105
[2018-02-03 23:24:40,137 INFO L554 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-02-03 23:24:40,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states.
[2018-02-03 23:24:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105.
[2018-02-03 23:24:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states.
[2018-02-03 23:24:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions.
[2018-02-03 23:24:40,140 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 14
[2018-02-03 23:24:40,141 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:40,141 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions.
[2018-02-03 23:24:40,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-03 23:24:40,141 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions.
[2018-02-03 23:24:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-03 23:24:40,141 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:40,141 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:40,141 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:40,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1876114930, now seen corresponding path program 1 times
[2018-02-03 23:24:40,142 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:40,142 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:40,142 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:40,142 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:40,143 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:40,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:40,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:40,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-02-03 23:24:40,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-03 23:24:40,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-03 23:24:40,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-02-03 23:24:40,239 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 8 states.
[2018-02-03 23:24:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:40,423 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions.
[2018-02-03 23:24:40,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-03 23:24:40,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19
[2018-02-03 23:24:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:40,423 INFO L225 Difference]: With dead ends: 102
[2018-02-03 23:24:40,424 INFO L226 Difference]: Without dead ends: 102
[2018-02-03 23:24:40,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156
[2018-02-03 23:24:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2018-02-03 23:24:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102.
[2018-02-03 23:24:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states.
[2018-02-03 23:24:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions.
[2018-02-03 23:24:40,428 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 19
[2018-02-03 23:24:40,428 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:40,428 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions.
[2018-02-03 23:24:40,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-03 23:24:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions.
[2018-02-03 23:24:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2018-02-03 23:24:40,429 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:40,429 INFO L351 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]
[2018-02-03 23:24:40,429 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:40,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1075458389, now seen corresponding path program 1 times
[2018-02-03 23:24:40,429 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:40,429 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:40,430 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:40,430 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:40,430 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:40,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:40,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:40,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-03 23:24:40,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-03 23:24:40,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-03 23:24:40,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2018-02-03 23:24:40,513 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 6 states.
[2018-02-03 23:24:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:40,615 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions.
[2018-02-03 23:24:40,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-03 23:24:40,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27
[2018-02-03 23:24:40,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:40,616 INFO L225 Difference]: With dead ends: 104
[2018-02-03 23:24:40,616 INFO L226 Difference]: Without dead ends: 104
[2018-02-03 23:24:40,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2018-02-03 23:24:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2018-02-03 23:24:40,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97.
[2018-02-03 23:24:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2018-02-03 23:24:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions.
[2018-02-03 23:24:40,620 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 27
[2018-02-03 23:24:40,621 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:40,621 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions.
[2018-02-03 23:24:40,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-03 23:24:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions.
[2018-02-03 23:24:40,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-02-03 23:24:40,621 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:40,621 INFO L351 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-02-03 23:24:40,621 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:40,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1475130712, now seen corresponding path program 1 times
[2018-02-03 23:24:40,621 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:40,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:40,622 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:40,622 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:40,622 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:40,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:40,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:40,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-03 23:24:40,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-03 23:24:40,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-03 23:24:40,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2018-02-03 23:24:40,688 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 7 states.
[2018-02-03 23:24:40,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:40,814 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions.
[2018-02-03 23:24:40,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-03 23:24:40,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30
[2018-02-03 23:24:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:40,815 INFO L225 Difference]: With dead ends: 110
[2018-02-03 23:24:40,815 INFO L226 Difference]: Without dead ends: 110
[2018-02-03 23:24:40,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2018-02-03 23:24:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2018-02-03 23:24:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96.
[2018-02-03 23:24:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states.
[2018-02-03 23:24:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions.
[2018-02-03 23:24:40,819 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 30
[2018-02-03 23:24:40,819 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:40,819 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions.
[2018-02-03 23:24:40,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-03 23:24:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions.
[2018-02-03 23:24:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-02-03 23:24:40,820 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:40,820 INFO L351 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-02-03 23:24:40,820 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:40,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1475130713, now seen corresponding path program 1 times
[2018-02-03 23:24:40,820 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:40,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:40,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:40,821 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:40,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:40,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:40,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:40,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-02-03 23:24:40,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-03 23:24:40,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-03 23:24:40,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2018-02-03 23:24:40,926 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 9 states.
[2018-02-03 23:24:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:41,114 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions.
[2018-02-03 23:24:41,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-03 23:24:41,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30
[2018-02-03 23:24:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:41,115 INFO L225 Difference]: With dead ends: 113
[2018-02-03 23:24:41,115 INFO L226 Difference]: Without dead ends: 113
[2018-02-03 23:24:41,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240
[2018-02-03 23:24:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2018-02-03 23:24:41,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95.
[2018-02-03 23:24:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states.
[2018-02-03 23:24:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions.
[2018-02-03 23:24:41,118 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 30
[2018-02-03 23:24:41,119 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:41,119 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions.
[2018-02-03 23:24:41,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-03 23:24:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions.
[2018-02-03 23:24:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-03 23:24:41,120 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:41,120 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:41,123 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:41,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1794665042, now seen corresponding path program 1 times
[2018-02-03 23:24:41,123 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:41,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:41,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:41,124 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:41,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:41,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:41,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:24:41,217 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/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-02-03 23:24:41,230 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:41,267 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:24:41,334 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:41,339 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 12 treesize of output 15
[2018-02-03 23:24:41,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:41,354 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:41,363 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:41,366 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-02-03 23:24:41,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:41,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:24:41,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18
[2018-02-03 23:24:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:41,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:24:41,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12
[2018-02-03 23:24:41,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-03 23:24:41,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-03 23:24:41,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156
[2018-02-03 23:24:41,415 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 13 states.
[2018-02-03 23:24:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:41,619 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions.
[2018-02-03 23:24:41,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-03 23:24:41,620 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32
[2018-02-03 23:24:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:41,620 INFO L225 Difference]: With dead ends: 92
[2018-02-03 23:24:41,620 INFO L226 Difference]: Without dead ends: 92
[2018-02-03 23:24:41,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210
[2018-02-03 23:24:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2018-02-03 23:24:41,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89.
[2018-02-03 23:24:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2018-02-03 23:24:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions.
[2018-02-03 23:24:41,622 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 32
[2018-02-03 23:24:41,622 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:41,622 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions.
[2018-02-03 23:24:41,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-03 23:24:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions.
[2018-02-03 23:24:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-02-03 23:24:41,623 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:41,623 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:41,623 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:41,623 INFO L82 PathProgramCache]: Analyzing trace with hash 374430840, now seen corresponding path program 1 times
[2018-02-03 23:24:41,623 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:41,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:41,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:41,624 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:41,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:41,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:41,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:41,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-03 23:24:41,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-03 23:24:41,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-03 23:24:41,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-03 23:24:41,679 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 5 states.
[2018-02-03 23:24:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:41,749 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions.
[2018-02-03 23:24:41,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-03 23:24:41,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33
[2018-02-03 23:24:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:41,750 INFO L225 Difference]: With dead ends: 95
[2018-02-03 23:24:41,750 INFO L226 Difference]: Without dead ends: 95
[2018-02-03 23:24:41,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-02-03 23:24:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2018-02-03 23:24:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92.
[2018-02-03 23:24:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states.
[2018-02-03 23:24:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions.
[2018-02-03 23:24:41,753 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 33
[2018-02-03 23:24:41,753 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:41,753 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions.
[2018-02-03 23:24:41,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-03 23:24:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions.
[2018-02-03 23:24:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-02-03 23:24:41,754 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:41,754 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:41,754 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:41,754 INFO L82 PathProgramCache]: Analyzing trace with hash -486325487, now seen corresponding path program 1 times
[2018-02-03 23:24:41,754 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:41,754 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:41,755 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:41,755 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:41,755 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:41,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:41,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:41,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-03 23:24:41,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-03 23:24:41,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-03 23:24:41,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-03 23:24:41,788 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 5 states.
[2018-02-03 23:24:41,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:41,864 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions.
[2018-02-03 23:24:41,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-03 23:24:41,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33
[2018-02-03 23:24:41,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:41,865 INFO L225 Difference]: With dead ends: 91
[2018-02-03 23:24:41,865 INFO L226 Difference]: Without dead ends: 91
[2018-02-03 23:24:41,866 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-02-03 23:24:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2018-02-03 23:24:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91.
[2018-02-03 23:24:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states.
[2018-02-03 23:24:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions.
[2018-02-03 23:24:41,868 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 33
[2018-02-03 23:24:41,868 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:41,868 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions.
[2018-02-03 23:24:41,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-03 23:24:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions.
[2018-02-03 23:24:41,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-02-03 23:24:41,869 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:41,869 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:41,869 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:41,870 INFO L82 PathProgramCache]: Analyzing trace with hash -486325486, now seen corresponding path program 1 times
[2018-02-03 23:24:41,870 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:41,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:41,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:41,871 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:41,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:41,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:42,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:42,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-02-03 23:24:42,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-03 23:24:42,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-03 23:24:42,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2018-02-03 23:24:42,038 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 11 states.
[2018-02-03 23:24:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:42,278 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions.
[2018-02-03 23:24:42,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-02-03 23:24:42,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33
[2018-02-03 23:24:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:42,279 INFO L225 Difference]: With dead ends: 93
[2018-02-03 23:24:42,279 INFO L226 Difference]: Without dead ends: 93
[2018-02-03 23:24:42,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306
[2018-02-03 23:24:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2018-02-03 23:24:42,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90.
[2018-02-03 23:24:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states.
[2018-02-03 23:24:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions.
[2018-02-03 23:24:42,284 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 33
[2018-02-03 23:24:42,284 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:42,284 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions.
[2018-02-03 23:24:42,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-03 23:24:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions.
[2018-02-03 23:24:42,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2018-02-03 23:24:42,285 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:42,285 INFO L351 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]
[2018-02-03 23:24:42,285 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:42,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2103779100, now seen corresponding path program 1 times
[2018-02-03 23:24:42,285 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:42,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:42,286 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:42,286 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:42,286 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:42,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:42,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:42,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-02-03 23:24:42,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-03 23:24:42,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-03 23:24:42,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210
[2018-02-03 23:24:42,538 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 15 states.
[2018-02-03 23:24:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:42,986 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions.
[2018-02-03 23:24:42,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-03 23:24:42,987 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34
[2018-02-03 23:24:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:42,987 INFO L225 Difference]: With dead ends: 128
[2018-02-03 23:24:42,987 INFO L226 Difference]: Without dead ends: 128
[2018-02-03 23:24:42,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870
[2018-02-03 23:24:42,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states.
[2018-02-03 23:24:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 100.
[2018-02-03 23:24:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states.
[2018-02-03 23:24:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions.
[2018-02-03 23:24:42,989 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 34
[2018-02-03 23:24:42,990 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:42,990 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions.
[2018-02-03 23:24:42,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-03 23:24:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions.
[2018-02-03 23:24:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2018-02-03 23:24:42,990 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:42,990 INFO L351 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]
[2018-02-03 23:24:42,990 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:42,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2103779101, now seen corresponding path program 1 times
[2018-02-03 23:24:42,990 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:42,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:42,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:42,992 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:42,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:43,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:43,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:43,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-02-03 23:24:43,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-03 23:24:43,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-03 23:24:43,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2018-02-03 23:24:43,201 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 15 states.
[2018-02-03 23:24:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:43,698 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions.
[2018-02-03 23:24:43,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-02-03 23:24:43,698 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34
[2018-02-03 23:24:43,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:43,698 INFO L225 Difference]: With dead ends: 131
[2018-02-03 23:24:43,699 INFO L226 Difference]: Without dead ends: 131
[2018-02-03 23:24:43,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992
[2018-02-03 23:24:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2018-02-03 23:24:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100.
[2018-02-03 23:24:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states.
[2018-02-03 23:24:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions.
[2018-02-03 23:24:43,702 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 34
[2018-02-03 23:24:43,702 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:43,702 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions.
[2018-02-03 23:24:43,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-03 23:24:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions.
[2018-02-03 23:24:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2018-02-03 23:24:43,704 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:43,704 INFO L351 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-02-03 23:24:43,705 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:43,705 INFO L82 PathProgramCache]: Analyzing trace with hash -950447499, now seen corresponding path program 1 times
[2018-02-03 23:24:43,705 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:43,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:43,705 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:43,706 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:43,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:43,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:43,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:43,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-02-03 23:24:43,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-03 23:24:43,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-03 23:24:43,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-02-03 23:24:43,757 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 8 states.
[2018-02-03 23:24:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:43,838 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions.
[2018-02-03 23:24:43,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-03 23:24:43,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35
[2018-02-03 23:24:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:43,839 INFO L225 Difference]: With dead ends: 97
[2018-02-03 23:24:43,839 INFO L226 Difference]: Without dead ends: 97
[2018-02-03 23:24:43,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2018-02-03 23:24:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2018-02-03 23:24:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97.
[2018-02-03 23:24:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2018-02-03 23:24:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions.
[2018-02-03 23:24:43,840 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 35
[2018-02-03 23:24:43,840 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:43,840 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions.
[2018-02-03 23:24:43,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-03 23:24:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions.
[2018-02-03 23:24:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2018-02-03 23:24:43,841 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:43,841 INFO L351 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, 1]
[2018-02-03 23:24:43,841 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:43,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1197880803, now seen corresponding path program 1 times
[2018-02-03 23:24:43,841 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:43,841 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:43,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:43,842 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:43,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:43,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:44,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:44,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-02-03 23:24:44,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-03 23:24:44,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-03 23:24:44,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210
[2018-02-03 23:24:44,115 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 15 states.
[2018-02-03 23:24:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:44,659 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions.
[2018-02-03 23:24:44,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-02-03 23:24:44,659 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36
[2018-02-03 23:24:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:44,660 INFO L225 Difference]: With dead ends: 140
[2018-02-03 23:24:44,660 INFO L226 Difference]: Without dead ends: 140
[2018-02-03 23:24:44,660 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930
[2018-02-03 23:24:44,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2018-02-03 23:24:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114.
[2018-02-03 23:24:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-02-03 23:24:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions.
[2018-02-03 23:24:44,662 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 36
[2018-02-03 23:24:44,662 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:44,662 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions.
[2018-02-03 23:24:44,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-03 23:24:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions.
[2018-02-03 23:24:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2018-02-03 23:24:44,663 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:44,663 INFO L351 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, 1, 1]
[2018-02-03 23:24:44,663 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:44,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1520400791, now seen corresponding path program 1 times
[2018-02-03 23:24:44,663 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:44,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:44,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:44,664 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:44,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:44,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:44,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:44,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-03 23:24:44,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-03 23:24:44,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-03 23:24:44,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-02-03 23:24:44,704 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 8 states.
[2018-02-03 23:24:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:44,767 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions.
[2018-02-03 23:24:44,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-03 23:24:44,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37
[2018-02-03 23:24:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:44,767 INFO L225 Difference]: With dead ends: 113
[2018-02-03 23:24:44,767 INFO L226 Difference]: Without dead ends: 113
[2018-02-03 23:24:44,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2018-02-03 23:24:44,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2018-02-03 23:24:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113.
[2018-02-03 23:24:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2018-02-03 23:24:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions.
[2018-02-03 23:24:44,770 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 37
[2018-02-03 23:24:44,770 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:44,770 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions.
[2018-02-03 23:24:44,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-03 23:24:44,770 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions.
[2018-02-03 23:24:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2018-02-03 23:24:44,770 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:44,770 INFO L351 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, 1, 1]
[2018-02-03 23:24:44,770 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1520400792, now seen corresponding path program 1 times
[2018-02-03 23:24:44,771 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:44,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:44,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:44,771 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:44,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:44,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:45,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:45,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-02-03 23:24:45,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-03 23:24:45,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-03 23:24:45,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210
[2018-02-03 23:24:45,132 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 15 states.
[2018-02-03 23:24:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:45,739 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions.
[2018-02-03 23:24:45,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-03 23:24:45,740 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37
[2018-02-03 23:24:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:45,741 INFO L225 Difference]: With dead ends: 123
[2018-02-03 23:24:45,741 INFO L226 Difference]: Without dead ends: 123
[2018-02-03 23:24:45,741 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756
[2018-02-03 23:24:45,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states.
[2018-02-03 23:24:45,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114.
[2018-02-03 23:24:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-02-03 23:24:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions.
[2018-02-03 23:24:45,745 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 37
[2018-02-03 23:24:45,745 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:45,745 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions.
[2018-02-03 23:24:45,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-03 23:24:45,745 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions.
[2018-02-03 23:24:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-02-03 23:24:45,745 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:45,746 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:45,746 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:45,746 INFO L82 PathProgramCache]: Analyzing trace with hash -482433028, now seen corresponding path program 1 times
[2018-02-03 23:24:45,746 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:45,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:45,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:45,747 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:45,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:45,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:45,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:24:45,856 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/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-02-03 23:24:45,864 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:45,890 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:24:45,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:24:45,911 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-02-03 23:24:45,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:45,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:45,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:45,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9
[2018-02-03 23:24:45,957 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 16 treesize of output 15
[2018-02-03 23:24:45,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:45,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:45,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18
[2018-02-03 23:24:46,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35
[2018-02-03 23:24:46,027 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 26 treesize of output 25
[2018-02-03 23:24:46,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:46,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:46,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:24:46,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26
[2018-02-03 23:24:46,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28
[2018-02-03 23:24:46,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5
[2018-02-03 23:24:46,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:46,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:46,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:24:46,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11
[2018-02-03 23:24:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:46,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:24:46,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19
[2018-02-03 23:24:46,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-03 23:24:46,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-03 23:24:46,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380
[2018-02-03 23:24:46,136 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 20 states.
[2018-02-03 23:24:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:46,636 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions.
[2018-02-03 23:24:46,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-03 23:24:46,637 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38
[2018-02-03 23:24:46,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:46,637 INFO L225 Difference]: With dead ends: 113
[2018-02-03 23:24:46,637 INFO L226 Difference]: Without dead ends: 113
[2018-02-03 23:24:46,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930
[2018-02-03 23:24:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2018-02-03 23:24:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113.
[2018-02-03 23:24:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2018-02-03 23:24:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions.
[2018-02-03 23:24:46,640 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 38
[2018-02-03 23:24:46,640 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:46,640 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions.
[2018-02-03 23:24:46,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-03 23:24:46,640 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions.
[2018-02-03 23:24:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-02-03 23:24:46,641 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:46,641 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:46,641 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:46,641 INFO L82 PathProgramCache]: Analyzing trace with hash -482433027, now seen corresponding path program 1 times
[2018-02-03 23:24:46,641 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:46,641 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:46,641 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:46,642 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:46,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:46,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:46,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:24:46,788 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/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-02-03 23:24:46,793 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:46,811 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:24:46,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:24:46,834 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-02-03 23:24:46,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:46,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:46,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:24:46,850 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-02-03 23:24:46,851 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:46,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:46,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:46,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26
[2018-02-03 23:24:46,909 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:46,909 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:46,910 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 15 treesize of output 8
[2018-02-03 23:24:46,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:46,917 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-02-03 23:24:46,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:46,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:46,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33
[2018-02-03 23:24:46,990 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 3 case distinctions, treesize of input 33 treesize of output 41
[2018-02-03 23:24:46,993 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 34 treesize of output 33
[2018-02-03 23:24:46,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:47,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:47,041 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 3 case distinctions, treesize of input 23 treesize of output 33
[2018-02-03 23:24:47,044 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-02-03 23:24:47,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:47,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:47,062 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-02-03 23:24:47,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52
[2018-02-03 23:24:47,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34
[2018-02-03 23:24:47,106 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 26 treesize of output 10
[2018-02-03 23:24:47,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:47,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:47,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26
[2018-02-03 23:24:47,123 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 22 treesize of output 15
[2018-02-03 23:24:47,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:47,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8
[2018-02-03 23:24:47,129 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:47,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3
[2018-02-03 23:24:47,136 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:47,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:47,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:24:47,143 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18
[2018-02-03 23:24:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:47,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:24:47,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21
[2018-02-03 23:24:47,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-02-03 23:24:47,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-02-03 23:24:47,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=405, Unknown=1, NotChecked=0, Total=462
[2018-02-03 23:24:47,193 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 22 states.
[2018-02-03 23:24:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:47,745 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions.
[2018-02-03 23:24:47,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-03 23:24:47,746 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38
[2018-02-03 23:24:47,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:47,746 INFO L225 Difference]: With dead ends: 112
[2018-02-03 23:24:47,746 INFO L226 Difference]: Without dead ends: 112
[2018-02-03 23:24:47,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=866, Unknown=1, NotChecked=0, Total=1056
[2018-02-03 23:24:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2018-02-03 23:24:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112.
[2018-02-03 23:24:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states.
[2018-02-03 23:24:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions.
[2018-02-03 23:24:47,748 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 38
[2018-02-03 23:24:47,748 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:47,748 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions.
[2018-02-03 23:24:47,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-02-03 23:24:47,748 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions.
[2018-02-03 23:24:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-02-03 23:24:47,748 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:47,749 INFO L351 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, 1, 1, 1, 1]
[2018-02-03 23:24:47,749 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash 816280248, now seen corresponding path program 1 times
[2018-02-03 23:24:47,749 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:47,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:47,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:47,749 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:47,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:47,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:47,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:47,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-02-03 23:24:47,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-02-03 23:24:47,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-02-03 23:24:47,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2018-02-03 23:24:47,837 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 12 states.
[2018-02-03 23:24:47,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:47,989 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions.
[2018-02-03 23:24:47,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-02-03 23:24:47,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39
[2018-02-03 23:24:47,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:47,990 INFO L225 Difference]: With dead ends: 119
[2018-02-03 23:24:47,990 INFO L226 Difference]: Without dead ends: 119
[2018-02-03 23:24:47,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272
[2018-02-03 23:24:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2018-02-03 23:24:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117.
[2018-02-03 23:24:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states.
[2018-02-03 23:24:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions.
[2018-02-03 23:24:47,993 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 39
[2018-02-03 23:24:47,993 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:47,993 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions.
[2018-02-03 23:24:47,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-02-03 23:24:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions.
[2018-02-03 23:24:47,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-02-03 23:24:47,994 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:47,994 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:47,994 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:47,994 INFO L82 PathProgramCache]: Analyzing trace with hash -469859278, now seen corresponding path program 1 times
[2018-02-03 23:24:47,994 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:47,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:47,995 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:47,995 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:47,995 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:48,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:48,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:48,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2018-02-03 23:24:48,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-03 23:24:48,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-03 23:24:48,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342
[2018-02-03 23:24:48,433 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 19 states.
[2018-02-03 23:24:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:49,021 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions.
[2018-02-03 23:24:49,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-03 23:24:49,022 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44
[2018-02-03 23:24:49,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:49,022 INFO L225 Difference]: With dead ends: 127
[2018-02-03 23:24:49,022 INFO L226 Difference]: Without dead ends: 127
[2018-02-03 23:24:49,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930
[2018-02-03 23:24:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2018-02-03 23:24:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120.
[2018-02-03 23:24:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states.
[2018-02-03 23:24:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions.
[2018-02-03 23:24:49,026 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 44
[2018-02-03 23:24:49,026 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:49,026 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions.
[2018-02-03 23:24:49,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-03 23:24:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions.
[2018-02-03 23:24:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2018-02-03 23:24:49,027 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:49,027 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:49,027 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:49,027 INFO L82 PathProgramCache]: Analyzing trace with hash -564431953, now seen corresponding path program 1 times
[2018-02-03 23:24:49,027 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:49,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:49,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:49,028 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:49,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:49,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:49,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:24:49,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2018-02-03 23:24:49,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-02-03 23:24:49,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-02-03 23:24:49,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462
[2018-02-03 23:24:49,907 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand 22 states.
[2018-02-03 23:24:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:50,909 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions.
[2018-02-03 23:24:50,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-02-03 23:24:50,909 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46
[2018-02-03 23:24:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:50,910 INFO L225 Difference]: With dead ends: 126
[2018-02-03 23:24:50,910 INFO L226 Difference]: Without dead ends: 106
[2018-02-03 23:24:50,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260
[2018-02-03 23:24:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2018-02-03 23:24:50,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104.
[2018-02-03 23:24:50,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states.
[2018-02-03 23:24:50,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions.
[2018-02-03 23:24:50,912 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 46
[2018-02-03 23:24:50,912 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:50,912 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions.
[2018-02-03 23:24:50,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-02-03 23:24:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions.
[2018-02-03 23:24:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2018-02-03 23:24:50,913 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:50,913 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:50,913 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:50,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1674895406, now seen corresponding path program 1 times
[2018-02-03 23:24:50,913 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:50,913 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:50,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:50,914 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:50,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:50,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:51,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:24:51,009 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/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-02-03 23:24:51,013 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:51,032 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:24:51,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:24:51,049 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-02-03 23:24:51,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:51,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:51,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:51,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8
[2018-02-03 23:24:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:51,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:24:51,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 17
[2018-02-03 23:24:51,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-02-03 23:24:51,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-02-03 23:24:51,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272
[2018-02-03 23:24:51,127 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 17 states.
[2018-02-03 23:24:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:51,472 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions.
[2018-02-03 23:24:51,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-02-03 23:24:51,473 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53
[2018-02-03 23:24:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:51,473 INFO L225 Difference]: With dead ends: 84
[2018-02-03 23:24:51,473 INFO L226 Difference]: Without dead ends: 84
[2018-02-03 23:24:51,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332
[2018-02-03 23:24:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2018-02-03 23:24:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2018-02-03 23:24:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states.
[2018-02-03 23:24:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions.
[2018-02-03 23:24:51,475 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 53
[2018-02-03 23:24:51,476 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:51,476 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions.
[2018-02-03 23:24:51,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-02-03 23:24:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions.
[2018-02-03 23:24:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-02-03 23:24:51,476 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:51,476 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:51,476 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:51,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1337769880, now seen corresponding path program 1 times
[2018-02-03 23:24:51,477 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:51,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:51,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:51,477 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:51,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:51,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:52,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:24:52,194 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/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-02-03 23:24:52,199 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:52,225 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:24: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 6 treesize of output 5
[2018-02-03 23:24:52,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-03 23:24:52,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-02-03 23:24:52,324 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-02-03 23:24:52,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29
[2018-02-03 23:24:52,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:24:52,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-02-03 23:24:52,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 43
[2018-02-03 23:24:52,377 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 28 treesize of output 27
[2018-02-03 23:24:52,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42
[2018-02-03 23:24:52,419 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:52,419 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:52,422 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 15 treesize of output 8
[2018-02-03 23:24:52,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44
[2018-02-03 23:24:52,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:24:52,725 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-02-03 23:24:52,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:135
[2018-02-03 23:24:52,819 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:52,820 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:52,820 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:52,821 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 24 treesize of output 29
[2018-02-03 23:24:52,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72
[2018-02-03 23:24:52,832 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64
[2018-02-03 23:24:52,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:24:52,838 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:24:52,852 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 59 treesize of output 75
[2018-02-03 23:24:52,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36
[2018-02-03 23:24:52,867 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:52,867 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:24:52,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86
[2018-02-03 23:24:52,868 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,872 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,883 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:24:52,884 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 78 treesize of output 87
[2018-02-03 23:24:52,887 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 60 treesize of output 51
[2018-02-03 23:24:52,887 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,894 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,899 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:24:52,906 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:178, output treesize:78
[2018-02-03 23:24:52,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48
[2018-02-03 23:24:52,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35
[2018-02-03 23:24:52,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:52,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:24:52,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:60
[2018-02-03 23:24:53,040 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 54 treesize of output 48
[2018-02-03 23:24:53,042 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:53,043 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:24:53,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23
[2018-02-03 23:24:53,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:53,053 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-02-03 23:24:53,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:53,057 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-02-03 23:24:53,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:53,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:53,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:53,063 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:3
[2018-02-03 23:24:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:53,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:24:53,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 41
[2018-02-03 23:24:53,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states
[2018-02-03 23:24:53,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2018-02-03 23:24:53,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1587, Unknown=0, NotChecked=0, Total=1722
[2018-02-03 23:24:53,111 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 42 states.
[2018-02-03 23:24:55,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:24:55,550 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions.
[2018-02-03 23:24:55,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states.
[2018-02-03 23:24:55,550 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 54
[2018-02-03 23:24:55,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:24:55,551 INFO L225 Difference]: With dead ends: 134
[2018-02-03 23:24:55,551 INFO L226 Difference]: Without dead ends: 134
[2018-02-03 23:24:55,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2247 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=611, Invalid=6699, Unknown=0, NotChecked=0, Total=7310
[2018-02-03 23:24:55,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states.
[2018-02-03 23:24:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 83.
[2018-02-03 23:24:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states.
[2018-02-03 23:24:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions.
[2018-02-03 23:24:55,554 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 54
[2018-02-03 23:24:55,554 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:24:55,554 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions.
[2018-02-03 23:24:55,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states.
[2018-02-03 23:24:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions.
[2018-02-03 23:24:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-02-03 23:24:55,554 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:24:55,554 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:24:55,554 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:24:55,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1337769881, now seen corresponding path program 1 times
[2018-02-03 23:24:55,554 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:24:55,554 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:24:55,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:55,555 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:55,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:24:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:55,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:24:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:56,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:24:56,600 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:24:56,605 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:24:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:24:56,629 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:24:56,631 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-02-03 23:24:56,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-03 23:24:56,698 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-02-03 23:24:56,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20
[2018-02-03 23:24:56,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-02-03 23:24:56,749 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-02-03 23:24:56,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31
[2018-02-03 23:24:56,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:24:56,784 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-02-03 23:24:56,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33
[2018-02-03 23:24:56,804 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 22 treesize of output 21
[2018-02-03 23:24:56,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,825 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44
[2018-02-03 23:24:56,857 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:56,857 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:56,858 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 15 treesize of output 8
[2018-02-03 23:24:56,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:56,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46
[2018-02-03 23:24:57,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:24:57,273 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-02-03 23:24:57,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:24:57,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:112
[2018-02-03 23:24:57,413 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:57,414 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:57,415 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:57,416 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:57,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 71
[2018-02-03 23:24:57,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44
[2018-02-03 23:24:57,435 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 44 treesize of output 40
[2018-02-03 23:24:57,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,437 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 86
[2018-02-03 23:24:57,457 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28
[2018-02-03 23:24:57,459 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 28 treesize of output 29
[2018-02-03 23:24:57,460 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,464 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,475 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:57,476 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:57,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 87
[2018-02-03 23:24:57,479 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 46 treesize of output 41
[2018-02-03 23:24:57,480 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,489 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,495 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,506 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:157, output treesize:128
[2018-02-03 23:24:57,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-02-03 23:24:57,651 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-02-03 23:24:57,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:24:57,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:137, output treesize:126
[2018-02-03 23:24:57,705 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:57,707 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:24:57,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 76
[2018-02-03 23:24:57,712 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36
[2018-02-03 23:24:57,713 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:24:57,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35
[2018-02-03 23:24:57,728 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29
[2018-02-03 23:24:57,729 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:24:57,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 52
[2018-02-03 23:24:57,752 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts.
[2018-02-03 23:24:57,756 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 47 treesize of output 32
[2018-02-03 23:24:57,757 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:24:57,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts.
[2018-02-03 23:24:57,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts.
[2018-02-03 23:24:57,844 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:127, output treesize:177
[2018-02-03 23:24:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:24:57,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:24:57,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 47
[2018-02-03 23:24:57,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states
[2018-02-03 23:24:57,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2018-02-03 23:24:57,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2081, Unknown=1, NotChecked=0, Total=2256
[2018-02-03 23:24:57,962 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 48 states.
[2018-02-03 23:25:02,148 WARN L146 SmtUtils]: Spent 3042ms on a formula simplification. DAG size of input: 76 DAG size of output 60
[2018-02-03 23:25:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:25:02,682 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions.
[2018-02-03 23:25:02,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2018-02-03 23:25:02,683 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54
[2018-02-03 23:25:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:25:02,683 INFO L225 Difference]: With dead ends: 84
[2018-02-03 23:25:02,683 INFO L226 Difference]: Without dead ends: 84
[2018-02-03 23:25:02,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=414, Invalid=4415, Unknown=1, NotChecked=0, Total=4830
[2018-02-03 23:25:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2018-02-03 23:25:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82.
[2018-02-03 23:25:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states.
[2018-02-03 23:25:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions.
[2018-02-03 23:25:02,686 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 54
[2018-02-03 23:25:02,686 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:25:02,686 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions.
[2018-02-03 23:25:02,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states.
[2018-02-03 23:25:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions.
[2018-02-03 23:25:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-02-03 23:25:02,686 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:25:02,686 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:25:02,687 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:25:02,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1401633689, now seen corresponding path program 1 times
[2018-02-03 23:25:02,687 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:25:02,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:25:02,687 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:02,687 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:02,687 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:02,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:25:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:03,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:25:03,373 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:25:03,378 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:03,404 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:25:03,405 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-02-03 23:25:03,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:03,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:03,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-03 23:25:03,486 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:03,486 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:03,486 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-02-03 23:25:03,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:03,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:03,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19
[2018-02-03 23:25:03,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-02-03 23:25:03,544 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 10 treesize of output 9
[2018-02-03 23:25:03,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:03,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:03,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:03,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30
[2018-02-03 23:25:03,584 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 3 case distinctions, treesize of input 20 treesize of output 32
[2018-02-03 23:25:03,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26
[2018-02-03 23:25:03,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 23:25:03,603 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 17 treesize of output 16
[2018-02-03 23:25:03,603 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:03,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:25:03,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:25:03,624 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-02-03 23:25:03,624 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:03,625 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:03,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:25:03,636 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:46, output treesize:72
[2018-02-03 23:25:03,669 WARN L307 Elim1Store]: Array PQE input equivalent to false
[2018-02-03 23:25:03,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:03,677 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:03,678 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:03,678 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 15 treesize of output 8
[2018-02-03 23:25:03,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:03,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:03,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:45
[2018-02-03 23:25:04,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:25:04,036 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-02-03 23:25:04,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:04,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:134
[2018-02-03 23:25:04,172 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:04,172 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:04,173 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:04,173 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-02-03 23:25:04,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54
[2018-02-03 23:25:04,189 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 54 treesize of output 50
[2018-02-03 23:25:04,189 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,208 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 75 treesize of output 78
[2018-02-03 23:25:04,210 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38
[2018-02-03 23:25:04,212 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:04,213 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 38 treesize of output 53
[2018-02-03 23:25:04,213 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,216 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,226 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:04,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 76
[2018-02-03 23:25:04,230 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 34 treesize of output 32
[2018-02-03 23:25:04,230 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,236 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,249 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:178, output treesize:110
[2018-02-03 23:25:04,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 95
[2018-02-03 23:25:04,430 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 95 treesize of output 76
[2018-02-03 23:25:04,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:123, output treesize:88
[2018-02-03 23:25:04,491 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:04,493 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:04,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 57
[2018-02-03 23:25:04,495 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:04,502 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 48
[2018-02-03 23:25:04,503 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:25:04,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4
[2018-02-03 23:25:04,519 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4
[2018-02-03 23:25:04,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,526 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:10
[2018-02-03 23:25:04,555 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:04,556 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 21
[2018-02-03 23:25:04,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:04,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:25:04,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34
[2018-02-03 23:25:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:04,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:25:04,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 49
[2018-02-03 23:25:04,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states
[2018-02-03 23:25:04,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2018-02-03 23:25:04,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2287, Unknown=1, NotChecked=0, Total=2450
[2018-02-03 23:25:04,637 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 50 states.
[2018-02-03 23:25:08,906 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 117 DAG size of output 79
[2018-02-03 23:25:09,163 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 85 DAG size of output 73
[2018-02-03 23:25:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:25:10,253 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions.
[2018-02-03 23:25:10,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states.
[2018-02-03 23:25:10,253 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 56
[2018-02-03 23:25:10,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:25:10,254 INFO L225 Difference]: With dead ends: 131
[2018-02-03 23:25:10,254 INFO L226 Difference]: Without dead ends: 131
[2018-02-03 23:25:10,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1969 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=602, Invalid=6368, Unknown=2, NotChecked=0, Total=6972
[2018-02-03 23:25:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2018-02-03 23:25:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96.
[2018-02-03 23:25:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states.
[2018-02-03 23:25:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions.
[2018-02-03 23:25:10,257 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 56
[2018-02-03 23:25:10,257 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:25:10,257 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions.
[2018-02-03 23:25:10,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states.
[2018-02-03 23:25:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions.
[2018-02-03 23:25:10,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2018-02-03 23:25:10,259 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:25:10,259 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:25:10,259 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:25:10,259 INFO L82 PathProgramCache]: Analyzing trace with hash 500971420, now seen corresponding path program 1 times
[2018-02-03 23:25:10,259 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:25:10,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:25:10,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:10,260 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:10,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:10,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:25:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:11,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:25:11,149 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:25:11,153 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:11,176 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:25:11,179 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-02-03 23:25:11,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-03 23:25:11,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, 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-02-03 23:25:11,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20
[2018-02-03 23:25:11,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-02-03 23:25:11,291 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-02-03 23:25:11,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31
[2018-02-03 23:25:11,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:25:11,329 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-02-03 23:25:11,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33
[2018-02-03 23:25:11,344 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 22 treesize of output 21
[2018-02-03 23:25:11,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,361 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39
[2018-02-03 23:25:11,385 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:11,386 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:11,386 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 15 treesize of output 8
[2018-02-03 23:25:11,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:41
[2018-02-03 23:25:11,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:25:11,770 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-02-03 23:25:11,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:11,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:11,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:106
[2018-02-03 23:25:11,982 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 68 DAG size of output 52
[2018-02-03 23:25:11,985 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:11,986 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:11,989 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:11,989 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 28 treesize of output 21
[2018-02-03 23:25:11,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,022 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:25:12,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 98
[2018-02-03 23:25:12,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 71
[2018-02-03 23:25:12,030 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,041 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,041 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 53 treesize of output 76
[2018-02-03 23:25:12,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43
[2018-02-03 23:25:12,052 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,053 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38
[2018-02-03 23:25:12,056 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 34 treesize of output 43
[2018-02-03 23:25:12,057 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,061 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,066 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:25:12,067 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 22 treesize of output 18
[2018-02-03 23:25:12,067 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,070 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,073 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 72
[2018-02-03 23:25:12,083 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32
[2018-02-03 23:25:12,085 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 32 treesize of output 33
[2018-02-03 23:25:12,086 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,089 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,105 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,106 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 75
[2018-02-03 23:25:12,111 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 39 treesize of output 32
[2018-02-03 23:25:12,112 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,118 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,123 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2018-02-03 23:25:12,137 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 3
[2018-02-03 23:25:12,137 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,140 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60
[2018-02-03 23:25:12,143 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 25 treesize of output 21
[2018-02-03 23:25:12,143 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,147 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:25:12,160 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 4 variables, input treesize:146, output treesize:111
[2018-02-03 23:25:12,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45
[2018-02-03 23:25:12,313 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 7
[2018-02-03 23:25:12,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 103
[2018-02-03 23:25:12,335 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 7
[2018-02-03 23:25:12,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:25:12,362 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:157, output treesize:135
[2018-02-03 23:25:12,468 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,468 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,469 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 116 treesize of output 143
[2018-02-03 23:25:12,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,471 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,471 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,471 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 58 treesize of output 85
[2018-02-03 23:25:12,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts.
[2018-02-03 23:25:12,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:459, output treesize:257
[2018-02-03 23:25:12,585 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,587 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 67
[2018-02-03 23:25:12,592 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 36
[2018-02-03 23:25:12,593 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:25:12,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22
[2018-02-03 23:25:12,604 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,611 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 24 treesize of output 13
[2018-02-03 23:25:12,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 29
[2018-02-03 23:25:12,636 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 29 treesize of output 13
[2018-02-03 23:25:12,636 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,638 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,658 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,659 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 61
[2018-02-03 23:25:12,664 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30
[2018-02-03 23:25:12,664 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:25:12,676 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 36 treesize of output 25
[2018-02-03 23:25:12,677 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:12,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2018-02-03 23:25:12,682 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:12,686 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:12,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23
[2018-02-03 23:25:12,705 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:12,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13
[2018-02-03 23:25:12,706 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:12,709 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:12,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts.
[2018-02-03 23:25:12,725 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:281, output treesize:61
[2018-02-03 23:25:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:12,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:25:12,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 50
[2018-02-03 23:25:12,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states
[2018-02-03 23:25:12,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2018-02-03 23:25:12,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2386, Unknown=1, NotChecked=0, Total=2550
[2018-02-03 23:25:12,823 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 51 states.
[2018-02-03 23:25:17,258 WARN L146 SmtUtils]: Spent 2078ms on a formula simplification. DAG size of input: 84 DAG size of output 69
[2018-02-03 23:25:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:25:18,469 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions.
[2018-02-03 23:25:18,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states.
[2018-02-03 23:25:18,470 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 57
[2018-02-03 23:25:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:25:18,470 INFO L225 Difference]: With dead ends: 130
[2018-02-03 23:25:18,470 INFO L226 Difference]: Without dead ends: 130
[2018-02-03 23:25:18,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=531, Invalid=6437, Unknown=4, NotChecked=0, Total=6972
[2018-02-03 23:25:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2018-02-03 23:25:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 97.
[2018-02-03 23:25:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2018-02-03 23:25:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions.
[2018-02-03 23:25:18,473 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 57
[2018-02-03 23:25:18,474 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:25:18,474 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions.
[2018-02-03 23:25:18,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states.
[2018-02-03 23:25:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions.
[2018-02-03 23:25:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-02-03 23:25:18,474 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:25:18,475 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:25:18,475 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:25:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash 397197244, now seen corresponding path program 1 times
[2018-02-03 23:25:18,475 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:25:18,475 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:25:18,476 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:18,476 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:18,476 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:18,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:25:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:18,593 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:25:18,593 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:25:18,599 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:18,620 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:25:18,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:25:18,649 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-02-03 23:25:18,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:18,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:18,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:18,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18
[2018-02-03 23:25:18,658 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:18,659 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:18,659 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 15 treesize of output 8
[2018-02-03 23:25:18,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:18,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:18,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20
[2018-02-03 23:25:18,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18
[2018-02-03 23:25:18,672 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 18 treesize of output 9
[2018-02-03 23:25:18,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:18,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:18,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:18,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14
[2018-02-03 23:25:18,683 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:18,683 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-02-03 23:25:18,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:18,687 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-02-03 23:25:18,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15
[2018-02-03 23:25:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:18,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:25:18,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 15
[2018-02-03 23:25:18,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-03 23:25:18,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-03 23:25:18,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240
[2018-02-03 23:25:18,722 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 16 states.
[2018-02-03 23:25:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:25:18,996 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions.
[2018-02-03 23:25:18,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-03 23:25:18,996 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59
[2018-02-03 23:25:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:25:18,997 INFO L225 Difference]: With dead ends: 110
[2018-02-03 23:25:18,997 INFO L226 Difference]: Without dead ends: 110
[2018-02-03 23:25:18,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650
[2018-02-03 23:25:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2018-02-03 23:25:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96.
[2018-02-03 23:25:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states.
[2018-02-03 23:25:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions.
[2018-02-03 23:25:18,999 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 59
[2018-02-03 23:25:18,999 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:25:18,999 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions.
[2018-02-03 23:25:18,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-03 23:25:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions.
[2018-02-03 23:25:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-02-03 23:25:18,999 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:25:18,999 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:25:18,999 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:25:18,999 INFO L82 PathProgramCache]: Analyzing trace with hash 68467118, now seen corresponding path program 1 times
[2018-02-03 23:25:18,999 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:25:18,999 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:25:19,000 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:19,000 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:19,000 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:19,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:25:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:20,236 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:25:20,237 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:25:20,244 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:20,274 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:25:20,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-03 23:25:20,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:20,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:20,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-03 23:25:20,467 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:20,467 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:20,468 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-02-03 23:25:20,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:20,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:20,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19
[2018-02-03 23:25:20,534 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 13 treesize of output 10
[2018-02-03 23:25:20,535 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 10 treesize of output 9
[2018-02-03 23:25:20,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:20,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:20,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:20,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30
[2018-02-03 23:25:20,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 32
[2018-02-03 23:25:20,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26
[2018-02-03 23:25:20,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 23:25:20,608 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 17 treesize of output 16
[2018-02-03 23:25:20,609 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:20,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:25:20,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:25:20,632 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-02-03 23:25:20,632 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:20,633 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:20,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:25:20,642 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:41, output treesize:71
[2018-02-03 23:25:20,688 WARN L307 Elim1Store]: Array PQE input equivalent to false
[2018-02-03 23:25:20,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:20,694 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:20,695 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:20,695 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 15 treesize of output 8
[2018-02-03 23:25:20,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:20,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:20,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:44
[2018-02-03 23:25:23,198 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:23,199 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:23,199 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8
[2018-02-03 23:25:23,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,221 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:25:23,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 107
[2018-02-03 23:25:23,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76
[2018-02-03 23:25:23,228 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 63
[2018-02-03 23:25:23,240 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:23,240 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:23,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 74
[2018-02-03 23:25:23,241 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12
[2018-02-03 23:25:23,249 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,253 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,261 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:23,261 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 41 treesize of output 36
[2018-02-03 23:25:23,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 36 treesize of output 33
[2018-02-03 23:25:23,264 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:23,269 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:23,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:23,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85
[2018-02-03 23:25:23,281 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32
[2018-02-03 23:25:23,283 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:23,284 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 32 treesize of output 55
[2018-02-03 23:25:23,284 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,288 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,301 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:23,302 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:23,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84
[2018-02-03 23:25:23,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57
[2018-02-03 23:25:23,304 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,312 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,319 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33
[2018-02-03 23:25:23,337 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 3
[2018-02-03 23:25:23,337 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,342 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73
[2018-02-03 23:25:23,344 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 25 treesize of output 21
[2018-02-03 23:25:23,345 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,351 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:23,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:25:23,366 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 4 variables, input treesize:155, output treesize:135
[2018-02-03 23:25:23,823 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:23,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 102
[2018-02-03 23:25:23,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts.
[2018-02-03 23:25:23,832 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:23,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 180
[2018-02-03 23:25:23,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 23:25:23,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 7 xjuncts.
[2018-02-03 23:25:23,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:641, output treesize:758
[2018-02-03 23:25:24,165 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 84 DAG size of output 74
[2018-02-03 23:25:24,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 142
[2018-02-03 23:25:24,173 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 34 treesize of output 25
[2018-02-03 23:25:24,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:24,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:24,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 170
[2018-02-03 23:25:24,273 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 75 treesize of output 62
[2018-02-03 23:25:24,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:24,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:24,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 78 treesize of output 72
[2018-02-03 23:25:24,377 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 34 treesize of output 25
[2018-02-03 23:25:24,377 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:24,386 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:24,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109
[2018-02-03 23:25:24,476 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 88 treesize of output 73
[2018-02-03 23:25:24,476 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:24,485 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:24,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 80 treesize of output 74
[2018-02-03 23:25:24,570 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 36 treesize of output 27
[2018-02-03 23:25:24,571 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:24,579 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:24,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 144
[2018-02-03 23:25:24,661 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 36 treesize of output 27
[2018-02-03 23:25:24,661 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:24,672 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:24,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts.
[2018-02-03 23:25:24,748 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:758, output treesize:648
[2018-02-03 23:25:24,907 WARN L307 Elim1Store]: Array PQE input equivalent to false
[2018-02-03 23:25:24,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:24,971 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:24,972 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:24,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 145
[2018-02-03 23:25:24,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:25,119 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:25,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 147
[2018-02-03 23:25:25,120 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:25,213 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:25,214 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 64 treesize of output 77
[2018-02-03 23:25:25,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:25,301 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:25,302 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:25,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 83
[2018-02-03 23:25:25,303 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:25,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 9 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts.
[2018-02-03 23:25:25,350 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 13 variables, input treesize:854, output treesize:325
[2018-02-03 23:25:25,471 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:25,472 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:25,473 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:25,474 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:25,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 107
[2018-02-03 23:25:25,488 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103
[2018-02-03 23:25:25,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:25:25,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:25:25,620 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:25,621 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:25,621 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:25,624 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:25,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 117
[2018-02-03 23:25:25,641 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 117
[2018-02-03 23:25:25,643 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:25:25,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:25:25,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 6 xjuncts.
[2018-02-03 23:25:25,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:377, output treesize:603
[2018-02-03 23:25:32,310 WARN L146 SmtUtils]: Spent 6249ms on a formula simplification. DAG size of input: 164 DAG size of output 58
[2018-02-03 23:25:32,316 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:32,317 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:32,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69
[2018-02-03 23:25:32,322 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:32,322 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35
[2018-02-03 23:25:32,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:32,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10
[2018-02-03 23:25:32,332 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:32,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2018-02-03 23:25:32,337 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:32,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:32,358 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:32,359 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:32,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 75
[2018-02-03 23:25:32,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-02-03 23:25:32,362 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:32,372 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 39 treesize of output 21
[2018-02-03 23:25:32,372 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:32,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4
[2018-02-03 23:25:32,378 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:32,383 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:32,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:25:32,393 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:163, output treesize:58
[2018-02-03 23:25:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:32,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:25:32,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 60
[2018-02-03 23:25:32,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states
[2018-02-03 23:25:32,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants.
[2018-02-03 23:25:32,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3437, Unknown=6, NotChecked=0, Total=3660
[2018-02-03 23:25:32,500 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 61 states.
[2018-02-03 23:25:42,393 WARN L146 SmtUtils]: Spent 631ms on a formula simplification. DAG size of input: 101 DAG size of output 80
[2018-02-03 23:25:43,258 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 102 DAG size of output 66
[2018-02-03 23:25:43,454 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 113 DAG size of output 88
[2018-02-03 23:25:43,621 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 96 DAG size of output 75
[2018-02-03 23:25:43,993 WARN L146 SmtUtils]: Spent 326ms on a formula simplification. DAG size of input: 128 DAG size of output 91
[2018-02-03 23:25:44,292 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 160 DAG size of output 79
[2018-02-03 23:25:44,540 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 130 DAG size of output 66
[2018-02-03 23:25:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:25:45,689 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions.
[2018-02-03 23:25:45,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2018-02-03 23:25:45,689 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 64
[2018-02-03 23:25:45,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:25:45,690 INFO L225 Difference]: With dead ends: 126
[2018-02-03 23:25:45,690 INFO L226 Difference]: Without dead ends: 126
[2018-02-03 23:25:45,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2581 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=680, Invalid=8809, Unknown=17, NotChecked=0, Total=9506
[2018-02-03 23:25:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states.
[2018-02-03 23:25:45,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 103.
[2018-02-03 23:25:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states.
[2018-02-03 23:25:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions.
[2018-02-03 23:25:45,695 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 64
[2018-02-03 23:25:45,695 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:25:45,695 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions.
[2018-02-03 23:25:45,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states.
[2018-02-03 23:25:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions.
[2018-02-03 23:25:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-02-03 23:25:45,696 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:25:45,696 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:25:45,696 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:25:45,696 INFO L82 PathProgramCache]: Analyzing trace with hash 68467119, now seen corresponding path program 1 times
[2018-02-03 23:25:45,696 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:25:45,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:25:45,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:45,697 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:45,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:45,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:25:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:46,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:25:46,397 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:25:46,402 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:46,424 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:25:46,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:25:46,444 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-02-03 23:25:46,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7
[2018-02-03 23:25:46,525 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-02-03 23:25:46,526 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-02-03 23:25:46,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29
[2018-02-03 23:25:46,621 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 23 treesize of output 18
[2018-02-03 23:25:46,623 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:46,624 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 25
[2018-02-03 23:25:46,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:46,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:43
[2018-02-03 23:25:46,697 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 3 case distinctions, treesize of input 21 treesize of output 33
[2018-02-03 23:25:46,699 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 22 treesize of output 21
[2018-02-03 23:25:46,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27
[2018-02-03 23:25:46,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:25:46,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:25:46,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:25:46,742 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:66, output treesize:121
[2018-02-03 23:25:46,838 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 48 treesize of output 41
[2018-02-03 23:25:46,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20
[2018-02-03 23:25:46,841 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:46,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23
[2018-02-03 23:25:46,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 19 treesize of output 19
[2018-02-03 23:25:46,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,850 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,894 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 87 treesize of output 71
[2018-02-03 23:25:46,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33
[2018-02-03 23:25:46,897 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:46,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 42
[2018-02-03 23:25:46,899 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,904 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,912 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:25:46,913 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 38 treesize of output 35
[2018-02-03 23:25:46,914 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:46,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 30
[2018-02-03 23:25:46,916 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,919 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,925 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,929 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 74 treesize of output 70
[2018-02-03 23:25:46,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26
[2018-02-03 23:25:46,932 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:46,933 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 39
[2018-02-03 23:25:46,934 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,940 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,950 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:25:46,951 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 49 treesize of output 48
[2018-02-03 23:25:46,952 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 29 treesize of output 22
[2018-02-03 23:25:46,952 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,956 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,963 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:46,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:25:46,981 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:138, output treesize:71
[2018-02-03 23:25:47,253 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 67 treesize of output 66
[2018-02-03 23:25:47,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:47,279 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 83 treesize of output 82
[2018-02-03 23:25:47,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:47,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:25:47,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:215, output treesize:149
[2018-02-03 23:25:47,365 WARN L307 Elim1Store]: Array PQE input equivalent to false
[2018-02-03 23:25:47,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:47,367 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:47,367 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:47,368 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 103 treesize of output 97
[2018-02-03 23:25:47,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:47,381 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 87 treesize of output 73
[2018-02-03 23:25:47,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 59
[2018-02-03 23:25:47,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:47,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:47,398 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:25:47,399 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 49 treesize of output 55
[2018-02-03 23:25:47,400 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 44 treesize of output 33
[2018-02-03 23:25:47,400 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:47,404 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:47,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:47,422 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:191, output treesize:50
[2018-02-03 23:25:47,467 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 28 treesize of output 24
[2018-02-03 23:25:47,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-02-03 23:25:47,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:47,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-02-03 23:25:47,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:47,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:47,479 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 26 treesize of output 22
[2018-02-03 23:25:47,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-02-03 23:25:47,480 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:47,483 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-02-03 23:25:47,483 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:47,484 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:47,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:47,488 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:61, output treesize:9
[2018-02-03 23:25:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:47,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-03 23:25:47,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [23] total 41
[2018-02-03 23:25:47,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states
[2018-02-03 23:25:47,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2018-02-03 23:25:47,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1558, Unknown=3, NotChecked=0, Total=1722
[2018-02-03 23:25:47,542 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 42 states.
[2018-02-03 23:25:52,261 WARN L146 SmtUtils]: Spent 4124ms on a formula simplification. DAG size of input: 91 DAG size of output 84
[2018-02-03 23:25:53,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:25:53,529 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions.
[2018-02-03 23:25:53,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-02-03 23:25:53,529 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 64
[2018-02-03 23:25:53,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:25:53,530 INFO L225 Difference]: With dead ends: 125
[2018-02-03 23:25:53,530 INFO L226 Difference]: Without dead ends: 125
[2018-02-03 23:25:53,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=495, Invalid=4466, Unknown=9, NotChecked=0, Total=4970
[2018-02-03 23:25:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2018-02-03 23:25:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108.
[2018-02-03 23:25:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states.
[2018-02-03 23:25:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions.
[2018-02-03 23:25:53,533 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 64
[2018-02-03 23:25:53,533 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:25:53,533 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions.
[2018-02-03 23:25:53,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states.
[2018-02-03 23:25:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions.
[2018-02-03 23:25:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-02-03 23:25:53,534 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:25:53,534 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:25:53,534 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:25:53,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1371159083, now seen corresponding path program 1 times
[2018-02-03 23:25:53,534 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:25:53,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:25:53,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:53,535 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:53,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:53,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:25:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:53,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:25:53,985 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:25:53,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:54,026 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:25:54,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:25:54,067 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-02-03 23:25:54,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8
[2018-02-03 23:25:54,208 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~item~0.base Int) (|append_#t~ite7.base| Int)) (and (not (= 0 append_~item~0.base)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~0.base (store (store (select |c_old(#memory_$Pointer$.base)| append_~item~0.base) 0 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|)) 4 |append_#t~ite7.base|)))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~0.base)))))) is different from true
[2018-02-03 23:25:54,227 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 39 treesize of output 39
[2018-02-03 23:25:54,229 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18
[2018-02-03 23:25:54,231 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 19
[2018-02-03 23:25:54,231 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,233 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,240 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 38 treesize of output 35
[2018-02-03 23:25:54,242 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 24 treesize of output 16
[2018-02-03 23:25:54,242 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,245 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,250 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 48 treesize of output 40
[2018-02-03 23:25:54,252 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33
[2018-02-03 23:25:54,253 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:54,254 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 27 treesize of output 31
[2018-02-03 23:25:54,254 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,258 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20
[2018-02-03 23:25:54,264 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:54,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23
[2018-02-03 23:25:54,267 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,269 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,272 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,279 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:57, output treesize:24
[2018-02-03 23:25:54,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19
[2018-02-03 23:25:54,365 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 19 treesize of output 11
[2018-02-03 23:25:54,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:42
[2018-02-03 23:25:54,396 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 10 treesize of output 9
[2018-02-03 23:25:54,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44
[2018-02-03 23:25:54,427 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:54,427 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:54,428 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 15 treesize of output 8
[2018-02-03 23:25:54,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,435 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 48 treesize of output 38
[2018-02-03 23:25:54,437 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28
[2018-02-03 23:25:54,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:54,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:54,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:54,446 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:57, output treesize:31
[2018-02-03 23:25:54,473 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 27 treesize of output 23
[2018-02-03 23:25:54,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-02-03 23:25:54,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4
[2018-02-03 23:25:54,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:54,481 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4
[2018-02-03 23:25:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2018-02-03 23:25:54,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:25:54,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 37
[2018-02-03 23:25:54,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states
[2018-02-03 23:25:54,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2018-02-03 23:25:54,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1115, Unknown=5, NotChecked=68, Total=1332
[2018-02-03 23:25:54,517 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 37 states.
[2018-02-03 23:25:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:25:55,324 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions.
[2018-02-03 23:25:55,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-03 23:25:55,325 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 66
[2018-02-03 23:25:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:25:55,325 INFO L225 Difference]: With dead ends: 117
[2018-02-03 23:25:55,325 INFO L226 Difference]: Without dead ends: 117
[2018-02-03 23:25:55,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=380, Invalid=2916, Unknown=14, NotChecked=112, Total=3422
[2018-02-03 23:25:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2018-02-03 23:25:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108.
[2018-02-03 23:25:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states.
[2018-02-03 23:25:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions.
[2018-02-03 23:25:55,327 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 66
[2018-02-03 23:25:55,327 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:25:55,327 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions.
[2018-02-03 23:25:55,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states.
[2018-02-03 23:25:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions.
[2018-02-03 23:25:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2018-02-03 23:25:55,328 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:25:55,328 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:25:55,328 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:25:55,328 INFO L82 PathProgramCache]: Analyzing trace with hash -405505563, now seen corresponding path program 1 times
[2018-02-03 23:25:55,328 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:25:55,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:25:55,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:55,329 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:55,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:55,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:25:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:55,705 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:25:55,705 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:25:55,710 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:55,735 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:25:55,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:25:55,752 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-02-03 23:25:55,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:55,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:55,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:55,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7
[2018-02-03 23:25:55,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:25:55,893 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-02-03 23:25:55,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:55,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:55,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:55,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:66
[2018-02-03 23:25:55,961 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 63 treesize of output 47
[2018-02-03 23:25:55,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33
[2018-02-03 23:25:55,964 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:55,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 42
[2018-02-03 23:25:55,965 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:55,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:55,976 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:25:55,976 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 38 treesize of output 35
[2018-02-03 23:25:55,978 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:55,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 30
[2018-02-03 23:25:55,979 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:55,983 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:55,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:55,989 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 50 treesize of output 46
[2018-02-03 23:25:55,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26
[2018-02-03 23:25:55,992 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:55,993 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 39
[2018-02-03 23:25:55,993 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:55,996 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,003 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:25:56,004 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 49 treesize of output 48
[2018-02-03 23:25:56,005 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 29 treesize of output 22
[2018-02-03 23:25:56,005 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,009 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,012 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,021 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:76, output treesize:30
[2018-02-03 23:25:56,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34
[2018-02-03 23:25:56,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23
[2018-02-03 23:25:56,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:40
[2018-02-03 23:25:56,159 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 6 treesize of output 5
[2018-02-03 23:25:56,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,164 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-02-03 23:25:56,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:38
[2018-02-03 23:25:56,195 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:56,195 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:56,196 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-02-03 23:25:56,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,203 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:25:56,204 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 34 treesize of output 42
[2018-02-03 23:25:56,205 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 31 treesize of output 22
[2018-02-03 23:25:56,206 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,208 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:56,213 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:30
[2018-02-03 23:25:56,244 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 26 treesize of output 22
[2018-02-03 23:25:56,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-02-03 23:25:56,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,248 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-02-03 23:25:56,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:56,251 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3
[2018-02-03 23:25:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:56,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-03 23:25:56,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [21] total 36
[2018-02-03 23:25:56,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states
[2018-02-03 23:25:56,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2018-02-03 23:25:56,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1145, Unknown=30, NotChecked=0, Total=1332
[2018-02-03 23:25:56,294 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 37 states.
[2018-02-03 23:25:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:25:57,125 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions.
[2018-02-03 23:25:57,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-03 23:25:57,126 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 67
[2018-02-03 23:25:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:25:57,126 INFO L225 Difference]: With dead ends: 116
[2018-02-03 23:25:57,126 INFO L226 Difference]: Without dead ends: 116
[2018-02-03 23:25:57,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=412, Invalid=2977, Unknown=33, NotChecked=0, Total=3422
[2018-02-03 23:25:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2018-02-03 23:25:57,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111.
[2018-02-03 23:25:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states.
[2018-02-03 23:25:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions.
[2018-02-03 23:25:57,129 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 67
[2018-02-03 23:25:57,129 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:25:57,129 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions.
[2018-02-03 23:25:57,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states.
[2018-02-03 23:25:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions.
[2018-02-03 23:25:57,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2018-02-03 23:25:57,130 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:25:57,130 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:25:57,130 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:25:57,130 INFO L82 PathProgramCache]: Analyzing trace with hash -405505562, now seen corresponding path program 1 times
[2018-02-03 23:25:57,131 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:25:57,131 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:25:57,131 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:57,131 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:57,131 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:57,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:25:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2018-02-03 23:25:57,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 23:25:57,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-03 23:25:57,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-03 23:25:57,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-03 23:25:57,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-03 23:25:57,179 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 5 states.
[2018-02-03 23:25:57,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:25:57,254 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions.
[2018-02-03 23:25:57,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-03 23:25:57,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67
[2018-02-03 23:25:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:25:57,254 INFO L225 Difference]: With dead ends: 110
[2018-02-03 23:25:57,254 INFO L226 Difference]: Without dead ends: 110
[2018-02-03 23:25:57,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-02-03 23:25:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2018-02-03 23:25:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110.
[2018-02-03 23:25:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states.
[2018-02-03 23:25:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions.
[2018-02-03 23:25:57,256 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 67
[2018-02-03 23:25:57,256 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:25:57,256 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions.
[2018-02-03 23:25:57,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-03 23:25:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions.
[2018-02-03 23:25:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2018-02-03 23:25:57,256 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:25:57,256 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:25:57,256 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:25:57,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1151179654, now seen corresponding path program 1 times
[2018-02-03 23:25:57,257 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:25:57,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:25:57,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:57,257 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:57,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:57,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:25:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:25:57,659 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:25:57,659 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:25:57,665 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:57,689 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:25:57,690 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-02-03 23:25:57,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-03 23:25:57,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:25:57,713 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-02-03 23:25:57,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15
[2018-02-03 23:25:57,735 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:57,736 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:57,737 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 15 treesize of output 8
[2018-02-03 23:25:57,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17
[2018-02-03 23:25:57,872 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~item~0.base Int) (|append_#t~ite7.base| Int)) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~0.base (store (store (select |c_old(#memory_$Pointer$.base)| append_~item~0.base) 0 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|)) 4 |append_#t~ite7.base|)))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~0.base)))) (= (select |c_old(#valid)| append_~item~0.base) 0))) is different from true
[2018-02-03 23:25:57,891 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:57,892 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:57,892 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-02-03 23:25:57,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,901 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 35 treesize of output 39
[2018-02-03 23:25:57,902 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18
[2018-02-03 23:25:57,905 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 19
[2018-02-03 23:25:57,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,916 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 35
[2018-02-03 23:25:57,917 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 24 treesize of output 16
[2018-02-03 23:25:57,918 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,921 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:57,928 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:16
[2018-02-03 23:25:58,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19
[2018-02-03 23:25:58,012 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 19 treesize of output 11
[2018-02-03 23:25:58,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:27
[2018-02-03 23:25:58,062 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:58,065 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 32 treesize of output 32
[2018-02-03 23:25:58,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24
[2018-02-03 23:25:58,066 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:58,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:58,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:25:58,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:32
[2018-02-03 23:25:58,307 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 51 treesize of output 43
[2018-02-03 23:25:58,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-02-03 23:25:58,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4
[2018-02-03 23:25:58,315 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,333 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 51 treesize of output 41
[2018-02-03 23:25:58,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10
[2018-02-03 23:25:58,339 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4
[2018-02-03 23:25:58,345 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 25
[2018-02-03 23:25:58,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4
[2018-02-03 23:25:58,361 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,365 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 25 treesize of output 23
[2018-02-03 23:25:58,376 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-02-03 23:25:58,376 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,379 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:25:58,387 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:103, output treesize:29
[2018-02-03 23:25:58,403 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:25:58,403 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-02-03 23:25:58,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:25:58,407 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-02-03 23:25:58,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15
[2018-02-03 23:25:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2018-02-03 23:25:58,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:25:58,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 41
[2018-02-03 23:25:58,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states
[2018-02-03 23:25:58,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2018-02-03 23:25:58,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1505, Unknown=5, NotChecked=78, Total=1722
[2018-02-03 23:25:58,461 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 42 states.
[2018-02-03 23:25:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:25:59,479 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions.
[2018-02-03 23:25:59,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-03 23:25:59,480 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 69
[2018-02-03 23:25:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:25:59,480 INFO L225 Difference]: With dead ends: 126
[2018-02-03 23:25:59,480 INFO L226 Difference]: Without dead ends: 126
[2018-02-03 23:25:59,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 44 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=350, Invalid=3426, Unknown=10, NotChecked=120, Total=3906
[2018-02-03 23:25:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states.
[2018-02-03 23:25:59,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112.
[2018-02-03 23:25:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states.
[2018-02-03 23:25:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions.
[2018-02-03 23:25:59,483 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 69
[2018-02-03 23:25:59,483 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:25:59,483 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions.
[2018-02-03 23:25:59,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states.
[2018-02-03 23:25:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions.
[2018-02-03 23:25:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2018-02-03 23:25:59,483 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:25:59,483 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:25:59,483 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:25:59,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2066197540, now seen corresponding path program 1 times
[2018-02-03 23:25:59,484 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:25:59,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:25:59,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:59,484 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:25:59,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:25:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:25:59,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:26:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:26:00,987 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:26:00,987 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:26:00,993 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:26:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:26:01,024 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:26:01,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:26:01,139 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-02-03 23:26:01,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:01,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:01,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:26:01,148 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-02-03 23:26:01,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:01,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:01,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:01,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:10
[2018-02-03 23:26:01,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16
[2018-02-03 23:26:01,234 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:01,235 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-02-03 23:26:01,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:01,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:01,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16
[2018-02-03 23:26:01,251 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:01,251 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-02-03 23:26:01,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:01,254 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:01,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:01,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29
[2018-02-03 23:26:01,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31
[2018-02-03 23:26:01,306 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 20 treesize of output 19
[2018-02-03 23:26:01,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:01,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22
[2018-02-03 23:26:01,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-02-03 23:26:01,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:26:01,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31
[2018-02-03 23:26:01,367 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-02-03 23:26:01,368 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:01,380 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:01,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:26:01,389 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:42, output treesize:70
[2018-02-03 23:26:02,951 WARN L146 SmtUtils]: Spent 1021ms on a formula simplification. DAG size of input: 110 DAG size of output 96
[2018-02-03 23:26:02,955 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:02,956 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:02,957 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 80 treesize of output 74
[2018-02-03 23:26:02,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:03,360 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:03,361 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:03,361 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 118 treesize of output 112
[2018-02-03 23:26:03,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:03,364 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:03,364 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:03,365 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 97
[2018-02-03 23:26:03,365 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:03,641 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 74 treesize of output 74
[2018-02-03 23:26:03,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18
[2018-02-03 23:26:03,645 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 19
[2018-02-03 23:26:03,645 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:03,648 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:03,663 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:03,664 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:03,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 37 treesize of output 49
[2018-02-03 23:26:03,666 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 38 treesize of output 31
[2018-02-03 23:26:03,666 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:03,672 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:03,681 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:03,864 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 62 treesize of output 74
[2018-02-03 23:26:03,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18
[2018-02-03 23:26:03,867 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 23
[2018-02-03 23:26:03,867 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:03,870 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:03,881 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:26:03,882 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 49 treesize of output 55
[2018-02-03 23:26:03,883 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 15
[2018-02-03 23:26:03,884 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:03,888 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:03,896 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:03,999 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 1 case distinctions, treesize of input 97 treesize of output 97
[2018-02-03 23:26:04,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14
[2018-02-03 23:26:04,004 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 15
[2018-02-03 23:26:04,004 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,007 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,028 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:26:04,035 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 3 case distinctions, treesize of input 44 treesize of output 66
[2018-02-03 23:26:04,037 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 59 treesize of output 56
[2018-02-03 23:26:04,037 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,049 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,061 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,063 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,066 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 108
[2018-02-03 23:26:04,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29
[2018-02-03 23:26:04,070 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,071 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 30
[2018-02-03 23:26:04,071 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,076 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,089 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,091 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-02-03 23:26:04,093 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 19 treesize of output 19
[2018-02-03 23:26:04,095 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,100 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,109 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,158 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,165 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 0 case distinctions, treesize of input 83 treesize of output 82
[2018-02-03 23:26:04,167 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47
[2018-02-03 23:26:04,169 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,170 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 45 treesize of output 53
[2018-02-03 23:26:04,170 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,177 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,187 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,188 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,188 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,189 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 56
[2018-02-03 23:26:04,191 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49
[2018-02-03 23:26:04,192 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:04,198 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:04,206 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:04,214 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 89 treesize of output 92
[2018-02-03 23:26:04,236 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18
[2018-02-03 23:26:04,238 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 19
[2018-02-03 23:26:04,239 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,241 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,257 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,260 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,261 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,262 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 89
[2018-02-03 23:26:04,271 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 85 treesize of output 77
[2018-02-03 23:26:04,271 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,296 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 37 treesize of output 36
[2018-02-03 23:26:04,296 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,305 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:26:04,319 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:26:04,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts.
[2018-02-03 23:26:04,358 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 14 variables, input treesize:232, output treesize:172
[2018-02-03 23:26:04,809 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 74 treesize of output 73
[2018-02-03 23:26:04,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,840 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 61 treesize of output 60
[2018-02-03 23:26:04,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,868 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 71 treesize of output 70
[2018-02-03 23:26:04,868 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:04,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:26:04,894 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:272, output treesize:204
[2018-02-03 23:26:04,988 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,989 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:04,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 98
[2018-02-03 23:26:05,000 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 86
[2018-02-03 23:26:05,001 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:26:05,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:26:05,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67
[2018-02-03 23:26:05,110 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 31 treesize of output 26
[2018-02-03 23:26:05,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:05,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:05,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55
[2018-02-03 23:26:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26
[2018-02-03 23:26:05,135 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:05,142 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:05,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 91
[2018-02-03 23:26:05,146 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 39 treesize of output 34
[2018-02-03 23:26:05,146 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:05,154 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:05,202 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:05,205 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 97 treesize of output 102
[2018-02-03 23:26:05,207 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 35 treesize of output 30
[2018-02-03 23:26:05,207 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:05,221 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:05,342 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:05,343 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:05,344 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:05,344 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:05,345 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:05,346 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:05,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 117
[2018-02-03 23:26:05,367 INFO L477 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 114 treesize of output 129
[2018-02-03 23:26:05,371 INFO L267 ElimStorePlain]: Start of recursive call 13: 16 dim-0 vars, End of recursive call: 16 dim-0 vars, and 9 xjuncts.
[2018-02-03 23:26:05,516 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 9 xjuncts.
[2018-02-03 23:26:05,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 20 dim-0 vars, and 12 xjuncts.
[2018-02-03 23:26:05,694 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:276, output treesize:983
[2018-02-03 23:26:10,461 WARN L146 SmtUtils]: Spent 4529ms on a formula simplification. DAG size of input: 293 DAG size of output 46
[2018-02-03 23:26:11,299 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,300 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:26:11,300 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 110
[2018-02-03 23:26:11,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:11,334 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,334 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,335 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,335 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 133
[2018-02-03 23:26:11,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:11,367 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 2 xjuncts.
[2018-02-03 23:26:11,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:206, output treesize:195
[2018-02-03 23:26:11,479 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,479 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,480 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,481 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 122
[2018-02-03 23:26:11,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:11,482 WARN L307 Elim1Store]: Array PQE input equivalent to false
[2018-02-03 23:26:11,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:11,499 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,500 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,500 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:26:11,502 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:26:11,504 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 98
[2018-02-03 23:26:11,505 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 60 treesize of output 49
[2018-02-03 23:26:11,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:11,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:11,523 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,524 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,524 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:26:11,524 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,525 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,526 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,527 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,528 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 134
[2018-02-03 23:26:11,538 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 136
[2018-02-03 23:26:11,539 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:26:11,559 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:11,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:11,581 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:232, output treesize:84
[2018-02-03 23:26:11,672 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,672 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,673 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,674 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:11,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 77
[2018-02-03 23:26:11,679 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22
[2018-02-03 23:26:11,679 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:26:11,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10
[2018-02-03 23:26:11,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:11,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31
[2018-02-03 23:26:11,697 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:11,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:11,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22
[2018-02-03 23:26:11,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-02-03 23:26:11,712 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:11,716 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-02-03 23:26:11,717 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:11,718 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:11,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:11,724 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:95, output treesize:7
[2018-02-03 23:26:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:26:11,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:26:11,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 35] total 69
[2018-02-03 23:26:11,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states
[2018-02-03 23:26:11,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants.
[2018-02-03 23:26:11,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=4375, Unknown=19, NotChecked=0, Total=4692
[2018-02-03 23:26:11,828 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 69 states.
[2018-02-03 23:26:12,866 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 118 DAG size of output 105
[2018-02-03 23:26:13,825 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 106 DAG size of output 97
[2018-02-03 23:26:14,582 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 111 DAG size of output 101
[2018-02-03 23:26:14,767 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 115 DAG size of output 105
[2018-02-03 23:26:14,984 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 135 DAG size of output 116
[2018-02-03 23:26:15,179 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 126 DAG size of output 111
[2018-02-03 23:26:15,401 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 130 DAG size of output 115
[2018-02-03 23:26:15,554 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 96 DAG size of output 89
[2018-02-03 23:26:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:26:16,099 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions.
[2018-02-03 23:26:16,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states.
[2018-02-03 23:26:16,099 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 74
[2018-02-03 23:26:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:26:16,100 INFO L225 Difference]: With dead ends: 132
[2018-02-03 23:26:16,100 INFO L226 Difference]: Without dead ends: 132
[2018-02-03 23:26:16,101 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2899 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=740, Invalid=9942, Unknown=30, NotChecked=0, Total=10712
[2018-02-03 23:26:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2018-02-03 23:26:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120.
[2018-02-03 23:26:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states.
[2018-02-03 23:26:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions.
[2018-02-03 23:26:16,102 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 74
[2018-02-03 23:26:16,102 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:26:16,102 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions.
[2018-02-03 23:26:16,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states.
[2018-02-03 23:26:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions.
[2018-02-03 23:26:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2018-02-03 23:26:16,103 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:26:16,103 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:26:16,103 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:26:16,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1435429099, now seen corresponding path program 2 times
[2018-02-03 23:26:16,103 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:26:16,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:26:16,104 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:26:16,104 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:26:16,104 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:26:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:26:16,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:26:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 20 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2018-02-03 23:26:17,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:26:17,232 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:26:17,237 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-03 23:26:17,272 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-02-03 23:26:17,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 23:26:17,275 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:26:17,277 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-02-03 23:26:17,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-03 23:26:17,390 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:17,391 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:17,391 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-02-03 23:26:17,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19
[2018-02-03 23:26:17,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-02-03 23:26:17,444 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 10 treesize of output 9
[2018-02-03 23:26:17,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30
[2018-02-03 23:26:17,480 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-02-03 23:26:17,481 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-02-03 23:26:17,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,495 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 3 case distinctions, treesize of input 20 treesize of output 32
[2018-02-03 23:26:17,496 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 21 treesize of output 20
[2018-02-03 23:26:17,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26
[2018-02-03 23:26:17,510 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts.
[2018-02-03 23:26:17,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:26:17,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:26:17,527 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:46, output treesize:72
[2018-02-03 23:26:17,563 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:17,563 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:17,564 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 51 treesize of output 45
[2018-02-03 23:26:17,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:45
[2018-02-03 23:26:17,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:26:17,909 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-02-03 23:26:17,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:17,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:17,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:116
[2018-02-03 23:26:18,543 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:18,562 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:18,562 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:18,563 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-02-03 23:26:18,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:18,581 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 69 treesize of output 72
[2018-02-03 23:26:18,583 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32
[2018-02-03 23:26:18,585 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 32 treesize of output 33
[2018-02-03 23:26:18,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:18,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:18,601 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:18,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66
[2018-02-03 23:26:18,604 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 30 treesize of output 24
[2018-02-03 23:26:18,605 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:18,618 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:18,623 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:18,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25
[2018-02-03 23:26:18,636 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 25 treesize of output 15
[2018-02-03 23:26:18,637 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:18,638 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:18,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:18,647 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:160, output treesize:100
[2018-02-03 23:26:18,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:26:18,995 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-02-03 23:26:18,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:18,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:19,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:106
[2018-02-03 23:26:19,113 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,114 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,115 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,115 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-02-03 23:26:19,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,154 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,162 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 149
[2018-02-03 23:26:19,165 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 169
[2018-02-03 23:26:19,167 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 59 treesize of output 45
[2018-02-03 23:26:19,167 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,232 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 97
[2018-02-03 23:26:19,234 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:26:19,235 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 51 treesize of output 76
[2018-02-03 23:26:19,235 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,242 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,285 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,287 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,288 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 118
[2018-02-03 23:26:19,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40
[2018-02-03 23:26:19,293 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,304 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,339 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,340 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,343 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,344 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 133
[2018-02-03 23:26:19,350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 122
[2018-02-03 23:26:19,351 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:19,361 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:19,393 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,395 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,395 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97
[2018-02-03 23:26:19,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40
[2018-02-03 23:26:19,398 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,405 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,418 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25
[2018-02-03 23:26:19,431 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 25 treesize of output 15
[2018-02-03 23:26:19,432 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,433 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,442 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:205, output treesize:145
[2018-02-03 23:26:19,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-02-03 23:26:19,552 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-02-03 23:26:19,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:19,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:159, output treesize:148
[2018-02-03 23:26:19,615 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,616 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,617 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,617 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 91
[2018-02-03 23:26:19,624 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,636 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 86
[2018-02-03 23:26:19,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 8 xjuncts.
[2018-02-03 23:26:19,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15
[2018-02-03 23:26:19,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61
[2018-02-03 23:26:19,677 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9
[2018-02-03 23:26:19,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 7 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,694 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:10
[2018-02-03 23:26:19,725 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:19,725 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 21
[2018-02-03 23:26:19,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:19,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:26:19,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34
[2018-02-03 23:26:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-02-03 23:26:19,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:26:19,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 59
[2018-02-03 23:26:19,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states
[2018-02-03 23:26:19,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants.
[2018-02-03 23:26:19,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3301, Unknown=2, NotChecked=0, Total=3540
[2018-02-03 23:26:19,835 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand 60 states.
[2018-02-03 23:26:26,392 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 124 DAG size of output 83
[2018-02-03 23:26:28,666 WARN L146 SmtUtils]: Spent 2127ms on a formula simplification. DAG size of input: 77 DAG size of output 69
[2018-02-03 23:26:29,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:26:29,609 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions.
[2018-02-03 23:26:29,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states.
[2018-02-03 23:26:29,609 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 76
[2018-02-03 23:26:29,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:26:29,610 INFO L225 Difference]: With dead ends: 122
[2018-02-03 23:26:29,610 INFO L226 Difference]: Without dead ends: 122
[2018-02-03 23:26:29,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 46 SyntacticMatches, 12 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2931 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=715, Invalid=8402, Unknown=3, NotChecked=0, Total=9120
[2018-02-03 23:26:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states.
[2018-02-03 23:26:29,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119.
[2018-02-03 23:26:29,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states.
[2018-02-03 23:26:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions.
[2018-02-03 23:26:29,612 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 76
[2018-02-03 23:26:29,612 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:26:29,612 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions.
[2018-02-03 23:26:29,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states.
[2018-02-03 23:26:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions.
[2018-02-03 23:26:29,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2018-02-03 23:26:29,613 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:26:29,613 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:26:29,613 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:26:29,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1339713313, now seen corresponding path program 1 times
[2018-02-03 23:26:29,613 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:26:29,613 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:26:29,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:26:29,613 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 23:26:29,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:26:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:26:29,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:26:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 23:26:32,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:26:32,506 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:26:32,511 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:26:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:26:32,542 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:26:32,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-02-03 23:26:32,813 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 10 treesize of output 9
[2018-02-03 23:26:32,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:32,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:32,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:32,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:54
[2018-02-03 23:26:32,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 53
[2018-02-03 23:26:32,892 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:32,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47
[2018-02-03 23:26:32,897 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:26:32,924 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 42 treesize of output 41
[2018-02-03 23:26:32,924 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:32,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:26:32,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:26:32,962 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-02-03 23:26:32,962 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:32,964 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:32,983 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 2 xjuncts.
[2018-02-03 23:26:32,984 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:61, output treesize:115
[2018-02-03 23:26:33,682 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~item~0.base Int)) (and (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~0.base (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|))) (let ((.cse1 (store (select |c_old(#memory_$Pointer$.base)| append_~item~0.base) 0 .cse2))) (store .cse1 4 (select (select (store |c_old(#memory_$Pointer$.base)| append_~item~0.base .cse1) .cse2) (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|) 4)))))))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~0.base))) |c_#memory_$Pointer$.base|) (not (= 0 append_~item~0.base)) (= |c_#valid| (store |c_old(#valid)| append_~item~0.base 1)) (= (select |c_old(#valid)| append_~item~0.base) 0))) is different from true
[2018-02-03 23:26:33,758 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:33,759 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:33,760 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:33,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 148
[2018-02-03 23:26:33,767 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32
[2018-02-03 23:26:33,769 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:33,770 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 32 treesize of output 55
[2018-02-03 23:26:33,770 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:33,774 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:33,788 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:33,789 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:33,790 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:33,792 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:33,793 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:33,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 143
[2018-02-03 23:26:33,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 120
[2018-02-03 23:26:33,796 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:33,810 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:33,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:33,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25
[2018-02-03 23:26:33,841 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 25 treesize of output 21
[2018-02-03 23:26:33,841 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:33,844 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:33,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:33,858 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:213, output treesize:182
[2018-02-03 23:26:34,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 188
[2018-02-03 23:26:34,563 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 39 treesize of output 28
[2018-02-03 23:26:34,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:34,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:34,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 227
[2018-02-03 23:26:34,626 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 78 treesize of output 67
[2018-02-03 23:26:34,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:34,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:34,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:26:34,750 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:432, output treesize:394
[2018-02-03 23:26:34,908 WARN L307 Elim1Store]: Array PQE input equivalent to false
[2018-02-03 23:26:34,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:34,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:34,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:387, output treesize:211
[2018-02-03 23:26:35,034 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:35,035 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:35,035 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:35,036 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:35,038 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:35,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 174
[2018-02-03 23:26:35,055 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 190
[2018-02-03 23:26:35,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:26:35,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:26:35,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:26:35,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:224, output treesize:546
[2018-02-03 23:26:44,854 WARN L146 SmtUtils]: Spent 703ms on a formula simplification. DAG size of input: 109 DAG size of output 43
[2018-02-03 23:26:45,675 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:45,676 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:45,677 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:45,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 141
[2018-02-03 23:26:45,682 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:45,683 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 91
[2018-02-03 23:26:45,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:45,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 57
[2018-02-03 23:26:45,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:45,717 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 68 treesize of output 55
[2018-02-03 23:26:45,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:45,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:45,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79
[2018-02-03 23:26:45,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4
[2018-02-03 23:26:45,769 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:45,777 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:45,813 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:45,813 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:45,814 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:45,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 139
[2018-02-03 23:26:45,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67
[2018-02-03 23:26:45,819 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:45,843 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:45,844 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 84 treesize of output 73
[2018-02-03 23:26:45,844 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:45,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 59
[2018-02-03 23:26:45,863 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:45,875 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:45,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77
[2018-02-03 23:26:45,906 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-02-03 23:26:45,906 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:45,915 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:45,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:26:45,942 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:337, output treesize:145
[2018-02-03 23:26:46,233 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#list~0.base| Int) (|main_#t~mem20.base| Int) (v_arrayElimCell_275 Int) (v_prenex_130 Int)) (let ((.cse1 (store |c_old(#valid)| |main_~#list~0.base| 1))) (let ((.cse2 (store .cse1 |main_#t~mem20.base| 1))) (let ((.cse0 (store .cse2 v_arrayElimCell_275 1))) (and (= |c_#valid| (store (store (store (store (store .cse0 v_prenex_130 1) v_arrayElimCell_275 0) v_prenex_130 0) |main_#t~mem20.base| 0) |main_~#list~0.base| 0)) (not (= 0 v_prenex_130)) (= 0 (select |c_old(#valid)| |main_~#list~0.base|)) (= (select .cse0 v_prenex_130) 0) (not (= |main_#t~mem20.base| 0)) (not (= 0 v_arrayElimCell_275)) (= 0 (select .cse1 |main_#t~mem20.base|)) (= 0 (select .cse2 v_arrayElimCell_275))))))) is different from true
[2018-02-03 23:26:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2018-02-03 23:26:46,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:26:46,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 70
[2018-02-03 23:26:46,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states
[2018-02-03 23:26:46,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants.
[2018-02-03 23:26:46,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=4478, Unknown=20, NotChecked=270, Total=4970
[2018-02-03 23:26:46,288 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 71 states.
[2018-02-03 23:26:47,573 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 123 DAG size of output 78
[2018-02-03 23:26:48,532 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 128 DAG size of output 72
[2018-02-03 23:26:49,094 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 119 DAG size of output 68
[2018-02-03 23:26:50,415 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 124 DAG size of output 91
[2018-02-03 23:26:50,798 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 112 DAG size of output 66
[2018-02-03 23:26:51,899 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 106 DAG size of output 100
[2018-02-03 23:26:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:26:52,967 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions.
[2018-02-03 23:26:52,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2018-02-03 23:26:52,968 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 76
[2018-02-03 23:26:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:26:52,968 INFO L225 Difference]: With dead ends: 125
[2018-02-03 23:26:52,968 INFO L226 Difference]: Without dead ends: 95
[2018-02-03 23:26:52,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 47 SyntacticMatches, 11 SemanticMatches, 103 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=520, Invalid=9973, Unknown=21, NotChecked=406, Total=10920
[2018-02-03 23:26:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2018-02-03 23:26:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93.
[2018-02-03 23:26:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2018-02-03 23:26:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions.
[2018-02-03 23:26:52,971 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 76
[2018-02-03 23:26:52,971 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:26:52,971 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions.
[2018-02-03 23:26:52,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states.
[2018-02-03 23:26:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions.
[2018-02-03 23:26:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2018-02-03 23:26:52,971 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:26:52,972 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:26:52,972 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:26:52,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1548629088, now seen corresponding path program 2 times
[2018-02-03 23:26:52,972 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:26:52,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:26:52,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:26:52,973 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 23:26:52,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:26:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:26:52,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:26:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 25 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-03 23:26:54,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:26:54,979 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:26:54,984 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-03 23:26:55,016 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-02-03 23:26:55,016 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 23:26:55,020 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:26:55,022 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-02-03 23:26:55,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-03 23:26:55,119 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-02-03 23:26:55,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20
[2018-02-03 23:26:55,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-02-03 23:26:55,200 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-02-03 23:26:55,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31
[2018-02-03 23:26:55,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33
[2018-02-03 23:26:55,263 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 22 treesize of output 21
[2018-02-03 23:26:55,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:26:55,286 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-02-03 23:26:55,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44
[2018-02-03 23:26:55,332 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:55,333 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:55,333 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 15 treesize of output 8
[2018-02-03 23:26:55,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46
[2018-02-03 23:26:55,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:26:55,832 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-02-03 23:26:55,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:55,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:55,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:117
[2018-02-03 23:26:57,970 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:57,971 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:57,981 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 77 treesize of output 88
[2018-02-03 23:26:57,983 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32
[2018-02-03 23:26:57,985 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 32 treesize of output 33
[2018-02-03 23:26:57,985 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:57,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,005 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,006 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,008 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,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, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 80
[2018-02-03 23:26:58,011 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 40 treesize of output 36
[2018-02-03 23:26:58,012 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,018 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25
[2018-02-03 23:26:58,035 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 25 treesize of output 15
[2018-02-03 23:26:58,035 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,036 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,045 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:165, output treesize:111
[2018-02-03 23:26:58,111 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-02-03 23:26:58,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26
[2018-02-03 23:26:58,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3
[2018-02-03 23:26:58,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:64
[2018-02-03 23:26:58,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:26:58,650 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-02-03 23:26:58,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:58,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:141
[2018-02-03 23:26:58,854 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,856 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,857 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,858 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,860 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 97
[2018-02-03 23:26:58,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54
[2018-02-03 23:26:58,885 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 54 treesize of output 44
[2018-02-03 23:26:58,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,940 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 164
[2018-02-03 23:26:58,943 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 63
[2018-02-03 23:26:58,945 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,946 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,946 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 63 treesize of output 83
[2018-02-03 23:26:58,946 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,953 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,971 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,974 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,975 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:58,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 136
[2018-02-03 23:26:58,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 84
[2018-02-03 23:26:58,981 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:58,994 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,018 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:251, output treesize:254
[2018-02-03 23:26:59,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 206
[2018-02-03 23:26:59,324 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 206 treesize of output 175
[2018-02-03 23:26:59,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:256, output treesize:197
[2018-02-03 23:26:59,496 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,497 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,497 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 220 treesize of output 249
[2018-02-03 23:26:59,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:26:59,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:629, output treesize:387
[2018-02-03 23:26:59,656 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,657 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,658 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,658 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,659 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,660 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 120
[2018-02-03 23:26:59,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8
[2018-02-03 23:26:59,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 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-02-03 23:26:59,693 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,704 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 27 treesize of output 16
[2018-02-03 23:26:59,704 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,713 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24
[2018-02-03 23:26:59,713 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:59,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:26:59,742 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,743 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,744 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,746 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,746 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,747 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:26:59,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 128
[2018-02-03 23:26:59,749 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 24 treesize of output 17
[2018-02-03 23:26:59,749 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37
[2018-02-03 23:26:59,769 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 37 treesize of output 24
[2018-02-03 23:26:59,779 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 23
[2018-02-03 23:26:59,790 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,796 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:26:59,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:26:59,808 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:401, output treesize:22
[2018-02-03 23:26:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 21 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-03 23:26:59,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:26:59,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 40] total 70
[2018-02-03 23:26:59,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states
[2018-02-03 23:26:59,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants.
[2018-02-03 23:26:59,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=4703, Unknown=4, NotChecked=0, Total=4970
[2018-02-03 23:26:59,909 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 71 states.
[2018-02-03 23:27:07,007 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 134 DAG size of output 95
[2018-02-03 23:27:07,459 WARN L146 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 96 DAG size of output 62
[2018-02-03 23:27:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:27:08,593 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions.
[2018-02-03 23:27:08,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states.
[2018-02-03 23:27:08,593 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 77
[2018-02-03 23:27:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:27:08,594 INFO L225 Difference]: With dead ends: 95
[2018-02-03 23:27:08,594 INFO L226 Difference]: Without dead ends: 95
[2018-02-03 23:27:08,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2886 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=658, Invalid=9228, Unknown=14, NotChecked=0, Total=9900
[2018-02-03 23:27:08,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2018-02-03 23:27:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92.
[2018-02-03 23:27:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states.
[2018-02-03 23:27:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions.
[2018-02-03 23:27:08,596 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 77
[2018-02-03 23:27:08,596 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:27:08,596 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions.
[2018-02-03 23:27:08,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states.
[2018-02-03 23:27:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions.
[2018-02-03 23:27:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2018-02-03 23:27:08,596 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:27:08,596 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:27:08,596 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:27:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash 34953514, now seen corresponding path program 2 times
[2018-02-03 23:27:08,597 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:27:08,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:27:08,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:27:08,597 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 23:27:08,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:27:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:27:08,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:27:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-02-03 23:27:10,446 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:27:10,446 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:27:10,451 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-03 23:27:10,490 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-02-03 23:27:10,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 23:27:10,494 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:27:10,496 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-02-03 23:27:10,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-03 23:27:10,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 6 treesize of output 5
[2018-02-03 23:27:10,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20
[2018-02-03 23:27:10,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-02-03 23:27:10,680 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-02-03 23:27:10,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31
[2018-02-03 23:27:10,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33
[2018-02-03 23:27:10,739 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 22 treesize of output 21
[2018-02-03 23:27:10,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:27:10,759 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-02-03 23:27:10,759 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,766 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44
[2018-02-03 23:27:10,807 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:10,808 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:10,808 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 15 treesize of output 8
[2018-02-03 23:27:10,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:10,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46
[2018-02-03 23:27:11,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:27:11,241 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-02-03 23:27:11,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:11,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:11,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:27:11,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:115, output treesize:111
[2018-02-03 23:27:11,646 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:11,648 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:11,649 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:11,650 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:11,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33
[2018-02-03 23:27:11,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:11,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44
[2018-02-03 23:27:11,664 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 44 treesize of output 34
[2018-02-03 23:27:11,664 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:11,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:11,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66
[2018-02-03 23:27:11,684 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26
[2018-02-03 23:27:11,686 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 26 treesize of output 27
[2018-02-03 23:27:11,686 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:11,688 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:11,697 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:11,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60
[2018-02-03 23:27:11,701 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 30 treesize of output 24
[2018-02-03 23:27:11,701 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:11,706 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:11,710 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:11,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:11,719 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:156, output treesize:99
[2018-02-03 23:27:12,405 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,406 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,439 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 15 treesize of output 8
[2018-02-03 23:27:12,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,482 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,491 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 162
[2018-02-03 23:27:12,495 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 182
[2018-02-03 23:27:12,497 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,498 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 59 treesize of output 67
[2018-02-03 23:27:12,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,585 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122
[2018-02-03 23:27:12,587 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:27:12,587 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 55 treesize of output 80
[2018-02-03 23:27:12,587 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,598 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,653 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,656 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,658 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 127
[2018-02-03 23:27:12,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69
[2018-02-03 23:27:12,663 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,675 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,720 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,723 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,725 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 116
[2018-02-03 23:27:12,731 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 99
[2018-02-03 23:27:12,732 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:27:12,744 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:27:12,784 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,784 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,786 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,787 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114
[2018-02-03 23:27:12,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 71
[2018-02-03 23:27:12,791 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,801 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,823 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,834 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,835 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 171
[2018-02-03 23:27:12,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 144
[2018-02-03 23:27:12,840 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,859 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,860 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,861 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,863 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 192
[2018-02-03 23:27:12,864 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,880 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 102
[2018-02-03 23:27:12,883 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:12,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 103
[2018-02-03 23:27:12,893 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 93
[2018-02-03 23:27:12,894 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:12,915 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:12,933 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 103 treesize of output 88
[2018-02-03 23:27:12,933 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,934 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 74 treesize of output 59
[2018-02-03 23:27:12,934 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:12,948 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:12,964 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:12,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 124 treesize of output 120
[2018-02-03 23:27:12,995 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 25 treesize of output 15
[2018-02-03 23:27:12,995 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:13,002 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:13,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 96
[2018-02-03 23:27:13,005 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-02-03 23:27:13,005 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:13,011 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:13,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67
[2018-02-03 23:27:13,013 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 3
[2018-02-03 23:27:13,014 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:13,021 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:13,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:27:13,048 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 4 variables, input treesize:206, output treesize:305
[2018-02-03 23:27:14,297 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:14,303 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 2 case distinctions, treesize of input 215 treesize of output 240
[2018-02-03 23:27:14,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts.
[2018-02-03 23:27:14,512 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:14,517 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 2 case distinctions, treesize of input 120 treesize of output 137
[2018-02-03 23:27:14,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 23:27:14,910 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:14,915 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 2 case distinctions, treesize of input 120 treesize of output 137
[2018-02-03 23:27:14,915 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-02-03 23:27:15,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 13 xjuncts.
[2018-02-03 23:27:15,142 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:1851, output treesize:2061
[2018-02-03 23:27:15,740 WARN L146 SmtUtils]: Spent 414ms on a formula simplification. DAG size of input: 178 DAG size of output 142
[2018-02-03 23:27:15,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 109
[2018-02-03 23:27:15,751 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 36 treesize of output 27
[2018-02-03 23:27:15,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:15,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:16,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 202
[2018-02-03 23:27:16,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31
[2018-02-03 23:27:16,039 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:16,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:16,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 107
[2018-02-03 23:27:16,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31
[2018-02-03 23:27:16,351 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:16,362 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:16,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 204
[2018-02-03 23:27:16,620 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 179 treesize of output 154
[2018-02-03 23:27:16,620 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:16,632 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:16,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 202
[2018-02-03 23:27:16,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 158
[2018-02-03 23:27:16,888 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:16,902 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:17,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 105
[2018-02-03 23:27:17,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29
[2018-02-03 23:27:17,154 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:17,169 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:17,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 107
[2018-02-03 23:27:17,470 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 34 treesize of output 25
[2018-02-03 23:27:17,470 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:17,481 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:17,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 202
[2018-02-03 23:27:17,705 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 34 treesize of output 25
[2018-02-03 23:27:17,705 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:17,722 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:17,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 204
[2018-02-03 23:27:17,947 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 36 treesize of output 27
[2018-02-03 23:27:17,947 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:17,984 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:18,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 222
[2018-02-03 23:27:18,200 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 75 treesize of output 62
[2018-02-03 23:27:18,200 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:18,216 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:18,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 200
[2018-02-03 23:27:18,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29
[2018-02-03 23:27:18,452 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:18,467 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:18,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 11 dim-2 vars, End of recursive call: 4 dim-0 vars, and 11 xjuncts.
[2018-02-03 23:27:18,668 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 15 variables, input treesize:1977, output treesize:1720
[2018-02-03 23:27:19,024 WARN L143 SmtUtils]: Spent 197ms on a formula simplification that was a NOOP. DAG size: 142
[2018-02-03 23:27:19,029 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,030 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,031 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 126
[2018-02-03 23:27:19,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:19,135 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,137 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,137 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 217
[2018-02-03 23:27:19,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:19,231 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,232 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 223
[2018-02-03 23:27:19,233 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:19,505 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,506 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,506 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 99 treesize of output 112
[2018-02-03 23:27:19,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:19,601 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,602 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 148 treesize of output 163
[2018-02-03 23:27:19,602 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:19,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 7 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts.
[2018-02-03 23:27:19,689 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:1164, output treesize:706
[2018-02-03 23:27:19,920 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,922 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,924 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,925 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,927 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,928 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:19,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 167
[2018-02-03 23:27:19,942 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 176
[2018-02-03 23:27:19,944 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:27:20,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:27:20,120 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:20,121 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:20,123 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:20,124 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:20,125 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:20,126 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:20,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 177
[2018-02-03 23:27:20,144 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 194
[2018-02-03 23:27:20,145 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:27:20,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:27:20,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 8 dim-0 vars, and 6 xjuncts.
[2018-02-03 23:27:20,660 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:771, output treesize:911
[2018-02-03 23:27:20,913 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:20,914 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:20,915 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:20,916 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:20,918 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:20,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 123
[2018-02-03 23:27:20,924 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:20,928 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 102
[2018-02-03 23:27:20,928 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:20,979 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 66 treesize of output 55
[2018-02-03 23:27:20,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:21,009 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:21,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87
[2018-02-03 23:27:21,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:21,037 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 45 treesize of output 34
[2018-02-03 23:27:21,037 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:21,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 7 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:21,094 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:21,094 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:21,095 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:21,097 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:21,098 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:21,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 117
[2018-02-03 23:27:21,104 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:21,119 INFO L477 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 134
[2018-02-03 23:27:21,123 INFO L267 ElimStorePlain]: Start of recursive call 8: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 8 xjuncts.
[2018-02-03 23:27:21,206 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:21,207 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 60 treesize of output 54
[2018-02-03 23:27:21,207 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:21,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44
[2018-02-03 23:27:21,234 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:27:21,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35
[2018-02-03 23:27:21,263 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:21,286 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 74 treesize of output 63
[2018-02-03 23:27:21,286 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:21,305 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 53 treesize of output 46
[2018-02-03 23:27:21,305 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:21,323 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:21,323 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 46 treesize of output 39
[2018-02-03 23:27:21,323 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:27:21,341 INFO L267 ElimStorePlain]: Start of recursive call 7: 7 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:21,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:27:21,366 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:265, output treesize:87
[2018-02-03 23:27:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-02-03 23:27:21,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 23:27:21,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 75
[2018-02-03 23:27:21,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states
[2018-02-03 23:27:21,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants.
[2018-02-03 23:27:21,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=5405, Unknown=7, NotChecked=0, Total=5700
[2018-02-03 23:27:21,532 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 76 states.
[2018-02-03 23:27:24,126 WARN L146 SmtUtils]: Spent 802ms on a formula simplification. DAG size of input: 86 DAG size of output 74
[2018-02-03 23:27:24,719 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 84 DAG size of output 84
[2018-02-03 23:27:24,930 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 88 DAG size of output 88
[2018-02-03 23:27:25,126 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 96 DAG size of output 91
[2018-02-03 23:27:25,289 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 87 DAG size of output 87
[2018-02-03 23:27:25,481 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 91 DAG size of output 91
[2018-02-03 23:27:25,676 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 100 DAG size of output 96
[2018-02-03 23:27:26,098 WARN L146 SmtUtils]: Spent 372ms on a formula simplification. DAG size of input: 168 DAG size of output 158
[2018-02-03 23:27:26,975 WARN L146 SmtUtils]: Spent 810ms on a formula simplification. DAG size of input: 183 DAG size of output 183
[2018-02-03 23:27:27,718 WARN L146 SmtUtils]: Spent 658ms on a formula simplification. DAG size of input: 204 DAG size of output 148
[2018-02-03 23:27:28,181 WARN L146 SmtUtils]: Spent 419ms on a formula simplification. DAG size of input: 166 DAG size of output 121
[2018-02-03 23:27:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 23:27:28,630 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions.
[2018-02-03 23:27:28,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2018-02-03 23:27:28,630 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 84
[2018-02-03 23:27:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 23:27:28,631 INFO L225 Difference]: With dead ends: 131
[2018-02-03 23:27:28,631 INFO L226 Difference]: Without dead ends: 131
[2018-02-03 23:27:28,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 43 SyntacticMatches, 13 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4105 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=774, Invalid=12329, Unknown=7, NotChecked=0, Total=13110
[2018-02-03 23:27:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2018-02-03 23:27:28,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114.
[2018-02-03 23:27:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-02-03 23:27:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions.
[2018-02-03 23:27:28,633 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 84
[2018-02-03 23:27:28,633 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 23:27:28,633 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions.
[2018-02-03 23:27:28,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states.
[2018-02-03 23:27:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions.
[2018-02-03 23:27:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2018-02-03 23:27:28,633 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 23:27:28,633 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 23:27:28,633 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-03 23:27:28,634 INFO L82 PathProgramCache]: Analyzing trace with hash 586424480, now seen corresponding path program 2 times
[2018-02-03 23:27:28,634 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 23:27:28,634 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 23:27:28,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:27:28,634 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 23:27:28,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 23:27:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 23:27:28,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 23:27:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 15 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-03 23:27:32,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 23:27:32,052 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 23:27:32,058 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-03 23:27:32,096 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-02-03 23:27:32,096 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 23:27:32,100 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 23:27:32,102 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-02-03 23:27:32,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:32,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:32,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-03 23:27:32,398 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:32,399 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:32,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-02-03 23:27:32,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:32,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:32,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19
[2018-02-03 23:27:32,511 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 13 treesize of output 10
[2018-02-03 23:27:32,512 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 10 treesize of output 9
[2018-02-03 23:27:32,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:32,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:32,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:32,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30
[2018-02-03 23:27:32,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 32
[2018-02-03 23:27:32,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26
[2018-02-03 23:27:32,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 23:27:32,596 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 17 treesize of output 16
[2018-02-03 23:27:32,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:32,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:27:32,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:27:32,615 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-02-03 23:27:32,615 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:32,616 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:32,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 23:27:32,624 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:41, output treesize:71
[2018-02-03 23:27:32,688 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:32,688 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:32,689 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 50 treesize of output 44
[2018-02-03 23:27:32,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:32,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:32,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:44
[2018-02-03 23:27:33,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-03 23:27:33,370 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-02-03 23:27:33,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:27:33,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:120
[2018-02-03 23:27:33,561 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:33,561 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:33,562 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 15 treesize of output 8
[2018-02-03 23:27:33,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 100
[2018-02-03 23:27:33,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80
[2018-02-03 23:27:33,597 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,610 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:33,611 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 69 treesize of output 100
[2018-02-03 23:27:33,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57
[2018-02-03 23:27:33,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2018-02-03 23:27:33,623 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:27:33,630 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:33,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 50
[2018-02-03 23:27:33,640 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 50
[2018-02-03 23:27:33,640 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:33,656 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:33,668 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:33,680 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:33,686 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 86 treesize of output 85
[2018-02-03 23:27:33,688 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32
[2018-02-03 23:27:33,689 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:33,690 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 32 treesize of output 55
[2018-02-03 23:27:33,690 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,693 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,705 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:33,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 75
[2018-02-03 23:27:33,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49
[2018-02-03 23:27:33,709 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,716 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,722 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49
[2018-02-03 23:27:33,745 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-02-03 23:27:33,745 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,749 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36
[2018-02-03 23:27:33,751 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 3
[2018-02-03 23:27:33,751 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,756 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73
[2018-02-03 23:27:33,760 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 25 treesize of output 15
[2018-02-03 23:27:33,760 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,767 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:33,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:27:33,788 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 4 variables, input treesize:163, output treesize:208
[2018-02-03 23:27:34,608 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~item~0.base Int)) (and (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~0.base (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|))) (let ((.cse1 (store (select |c_old(#memory_$Pointer$.base)| append_~item~0.base) 0 .cse2))) (store .cse1 4 (select (select (store |c_old(#memory_$Pointer$.base)| append_~item~0.base .cse1) .cse2) (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|) 4)))))))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~0.base))) |c_#memory_$Pointer$.base|) (= |c_#valid| (store |c_old(#valid)| append_~item~0.base 1)) (= (select |c_old(#valid)| append_~item~0.base) 0))) is different from true
[2018-02-03 23:27:35,308 WARN L146 SmtUtils]: Spent 695ms on a formula simplification. DAG size of input: 205 DAG size of output 133
[2018-02-03 23:27:35,311 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:35,311 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:35,312 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:35,312 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 107 treesize of output 119
[2018-02-03 23:27:35,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:35,590 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:35,590 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:35,591 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:35,591 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 186 treesize of output 230
[2018-02-03 23:27:35,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:35,593 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:35,594 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:35,595 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:35,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 207
[2018-02-03 23:27:35,595 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:35,872 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:35,873 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:35,873 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:35,873 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 91 treesize of output 99
[2018-02-03 23:27:35,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,098 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,098 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 191
[2018-02-03 23:27:36,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 153
[2018-02-03 23:27:36,103 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,128 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,129 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,131 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,133 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 232
[2018-02-03 23:27:36,134 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,169 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,170 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 117
[2018-02-03 23:27:36,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2018-02-03 23:27:36,172 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-03 23:27:36,182 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 104
[2018-02-03 23:27:36,187 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,192 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 98
[2018-02-03 23:27:36,193 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:36,219 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:36,241 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:36,265 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 23:27:36,277 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,278 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 173
[2018-02-03 23:27:36,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 59
[2018-02-03 23:27:36,282 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 59 treesize of output 45
[2018-02-03 23:27:36,283 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,287 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,314 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,322 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,322 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 131
[2018-02-03 23:27:36,336 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 174 treesize of output 170
[2018-02-03 23:27:36,336 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,374 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,375 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,375 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,376 INFO L682 Elim1Store]: detected equality via solver
[2018-02-03 23:27:36,377 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,378 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,378 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 168
[2018-02-03 23:27:36,380 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,395 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,409 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89
[2018-02-03 23:27:36,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28
[2018-02-03 23:27:36,544 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 28 treesize of output 29
[2018-02-03 23:27:36,544 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,547 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,563 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,564 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 55 treesize of output 73
[2018-02-03 23:27:36,567 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58
[2018-02-03 23:27:36,568 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,583 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,594 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,688 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 138
[2018-02-03 23:27:36,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47
[2018-02-03 23:27:36,696 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 47 treesize of output 37
[2018-02-03 23:27:36,696 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,699 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,715 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,716 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,717 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,718 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 97
[2018-02-03 23:27:36,721 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,722 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,722 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:36,734 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 154
[2018-02-03 23:27:36,735 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:27:36,786 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:27:36,822 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts.
[2018-02-03 23:27:36,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 101
[2018-02-03 23:27:36,935 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 21 treesize of output 11
[2018-02-03 23:27:36,935 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,945 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 112
[2018-02-03 23:27:36,947 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 21 treesize of output 11
[2018-02-03 23:27:36,947 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,958 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 105
[2018-02-03 23:27:36,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11
[2018-02-03 23:27:36,960 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:36,971 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:37,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 77 treesize of output 73
[2018-02-03 23:27:37,080 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 21 treesize of output 17
[2018-02-03 23:27:37,081 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:37,090 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:37,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 85
[2018-02-03 23:27:37,197 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 3
[2018-02-03 23:27:37,197 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:37,205 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:37,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 149
[2018-02-03 23:27:37,208 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 25 treesize of output 15
[2018-02-03 23:27:37,208 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:37,217 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:37,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 121
[2018-02-03 23:27:37,219 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-02-03 23:27:37,220 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:37,228 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 23:27:37,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts.
[2018-02-03 23:27:37,324 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 13 variables, input treesize:517, output treesize:801
[2018-02-03 23:27:37,610 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 128 DAG size of output 106
[2018-02-03 23:27:39,306 WARN L143 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 130
[2018-02-03 23:27:39,629 WARN L143 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 130
[2018-02-03 23:27:39,638 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:39,649 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:39,661 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 0 new quantified variables, introduced 6 case distinctions, treesize of input 145 treesize of output 214
[2018-02-03 23:27:39,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts.
[2018-02-03 23:27:40,243 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:40,255 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 0 new quantified variables, introduced 6 case distinctions, treesize of input 147 treesize of output 204
[2018-02-03 23:27:40,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts.
[2018-02-03 23:27:40,894 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:40,897 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:40,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 260 treesize of output 353
[2018-02-03 23:27:40,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts.
[2018-02-03 23:27:41,630 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:41,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 147 treesize of output 204
[2018-02-03 23:27:41,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts.
[2018-02-03 23:27:42,384 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:42,387 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:42,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 260 treesize of output 353
[2018-02-03 23:27:42,401 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts.
[2018-02-03 23:27:43,102 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:43,105 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 23:27:43,116 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 0 new quantified variables, introduced 6 case distinctions, treesize of input 145 treesize of output 222
[2018-02-03 23:27:43,117 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts.
[2018-02-03 23:27:43,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 6 dim-1 vars, End of recursive call: 20 dim-0 vars, and 32 xjuncts.
[2018-02-03 23:27:43,931 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 18 variables, input treesize:3073, output treesize:5385
Received shutdown request...
[2018-02-03 23:27:44,355 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants
[2018-02-03 23:27:44,355 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-02-03 23:27:44,358 WARN L185 ceAbstractionStarter]: Timeout
[2018-02-03 23:27:44,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 11:27:44 BoogieIcfgContainer
[2018-02-03 23:27:44,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-03 23:27:44,360 INFO L168 Benchmark]: Toolchain (without parser) took 186008.01 ms. Allocated memory was 405.8 MB in the beginning and 795.9 MB in the end (delta: 390.1 MB). Free memory was 362.7 MB in the beginning and 642.2 MB in the end (delta: -279.5 MB). Peak memory consumption was 374.0 MB. Max. memory is 5.3 GB.
[2018-02-03 23:27:44,361 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 405.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-03 23:27:44,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.16 ms. Allocated memory is still 405.8 MB. Free memory was 362.7 MB in the beginning and 352.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
[2018-02-03 23:27:44,361 INFO L168 Benchmark]: Boogie Preprocessor took 26.07 ms. Allocated memory is still 405.8 MB. Free memory was 352.1 MB in the beginning and 349.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB.
[2018-02-03 23:27:44,361 INFO L168 Benchmark]: RCFGBuilder took 297.27 ms. Allocated memory is still 405.8 MB. Free memory was 349.5 MB in the beginning and 319.6 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 5.3 GB.
[2018-02-03 23:27:44,361 INFO L168 Benchmark]: TraceAbstraction took 185530.02 ms. Allocated memory was 405.8 MB in the beginning and 795.9 MB in the end (delta: 390.1 MB). Free memory was 319.6 MB in the beginning and 642.2 MB in the end (delta: -322.6 MB). Peak memory consumption was 330.9 MB. Max. memory is 5.3 GB.
[2018-02-03 23:27:44,363 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.12 ms. Allocated memory is still 405.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 152.16 ms. Allocated memory is still 405.8 MB. Free memory was 362.7 MB in the beginning and 352.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 26.07 ms. Allocated memory is still 405.8 MB. Free memory was 352.1 MB in the beginning and 349.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 297.27 ms. Allocated memory is still 405.8 MB. Free memory was 349.5 MB in the beginning and 319.6 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 185530.02 ms. Allocated memory was 405.8 MB in the beginning and 795.9 MB in the end (delta: 390.1 MB). Free memory was 319.6 MB in the beginning and 642.2 MB in the end (delta: -322.6 MB). Peak memory consumption was 330.9 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 640). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 633]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 106 locations, 47 error locations. TIMEOUT Result, 185.4s OverallTime, 43 OverallIterations, 3 TraceHistogramMax, 84.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2175 SDtfs, 4684 SDslu, 17170 SDs, 0 SdLazy, 26995 SolverSat, 1265 SolverUnsat, 125 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2498 GetRequests, 770 SyntacticMatches, 131 SemanticMatches, 1597 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 31266 ImplicationChecksByTransitivity, 117.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=24, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 42 MinimizatonAttempts, 407 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 83.1s InterpolantComputationTime, 2998 NumberOfCodeBlocks, 2998 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 2937 ConstructedInterpolants, 210 QuantifiedInterpolants, 6933478 SizeOfPredicates, 552 NumberOfNonLiveVariables, 5560 ConjunctsInSsa, 1629 ConjunctsInUnsatCore, 61 InterpolantComputations, 25 PerfectInterpolantSequences, 413/855 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_23-27-44-370.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_23-27-44-370.csv
Completed graceful shutdown