java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-1cceb4a
[2018-01-29 23:35:46,962 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-01-29 23:35:46,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-29 23:35:46,979 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-29 23:35:46,980 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-29 23:35:46,981 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-29 23:35:46,982 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-29 23:35:46,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-29 23:35:46,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-29 23:35:46,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-29 23:35:46,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-29 23:35:46,988 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-29 23:35:46,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-29 23:35:46,990 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-29 23:35:46,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-29 23:35:46,993 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-29 23:35:46,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-29 23:35:46,997 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-29 23:35:46,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-29 23:35:47,000 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-29 23:35:47,002 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-29 23:35:47,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-29 23:35:47,003 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-29 23:35:47,004 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-29 23:35:47,005 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-29 23:35:47,006 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-29 23:35:47,006 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-29 23:35:47,007 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-29 23:35:47,007 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-29 23:35:47,007 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-29 23:35:47,008 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-01-29 23:35:47,008 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf
[2018-01-29 23:35:47,016 INFO L110 SettingsManager]: Loading preferences was successful
[2018-01-29 23:35:47,017 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-29 23:35:47,017 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-29 23:35:47,018 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-01-29 23:35:47,018 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-29 23:35:47,018 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-29 23:35:47,018 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-01-29 23:35:47,019 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-29 23:35:47,019 INFO L133 SettingsManager]: * sizeof long=4
[2018-01-29 23:35:47,019 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-01-29 23:35:47,019 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-01-29 23:35:47,019 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-01-29 23:35:47,019 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-01-29 23:35:47,019 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-01-29 23:35:47,019 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-01-29 23:35:47,020 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-01-29 23:35:47,020 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-29 23:35:47,020 INFO L133 SettingsManager]: * sizeof long double=12
[2018-01-29 23:35:47,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-29 23:35:47,020 INFO L133 SettingsManager]: * Size of a code block=SingleStatement
[2018-01-29 23:35:47,020 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-01-29 23:35:47,020 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-01-29 23:35:47,021 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-01-29 23:35:47,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-29 23:35:47,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-29 23:35:47,021 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-01-29 23:35:47,021 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-01-29 23:35:47,022 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-29 23:35:47,022 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-01-29 23:35:47,022 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-29 23:35:47,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-29 23:35:47,022 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-29 23:35:47,023 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-29 23:35:47,023 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-01-29 23:35:47,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-29 23:35:47,065 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-29 23:35:47,068 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-29 23:35:47,070 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-01-29 23:35:47,070 INFO L276 PluginConnector]: CDTParser initialized
[2018-01-29 23:35:47,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i
[2018-01-29 23:35:47,238 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-29 23:35:47,243 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-29 23:35:47,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-29 23:35:47,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-29 23:35:47,249 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-29 23:35:47,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:35:47" (1/1) ...
[2018-01-29 23:35:47,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17492289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:35:47, skipping insertion in model container
[2018-01-29 23:35:47,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:35:47" (1/1) ...
[2018-01-29 23:35:47,267 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-29 23:35:47,305 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-29 23:35:47,431 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-29 23:35:47,458 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-29 23:35:47,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:35:47 WrapperNode
[2018-01-29 23:35:47,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-29 23:35:47,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-29 23:35:47,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-29 23:35:47,469 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-01-29 23:35:47,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:35:47" (1/1) ...
[2018-01-29 23:35:47,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:35:47" (1/1) ...
[2018-01-29 23:35:47,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:35:47" (1/1) ...
[2018-01-29 23:35:47,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:35:47" (1/1) ...
[2018-01-29 23:35:47,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:35:47" (1/1) ...
[2018-01-29 23:35:47,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:35:47" (1/1) ...
[2018-01-29 23:35:47,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:35:47" (1/1) ...
[2018-01-29 23:35:47,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-29 23:35:47,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-29 23:35:47,515 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-01-29 23:35:47,515 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-01-29 23:35:47,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:35:47" (1/1) ...
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-29 23:35:47,569 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-29 23:35:47,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-29 23:35:47,570 INFO L136 BoogieDeclarations]: Found implementation of procedure append
[2018-01-29 23:35:47,570 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-01-29 23:35:47,570 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-01-29 23:35:47,570 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-01-29 23:35:47,570 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-01-29 23:35:47,570 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-01-29 23:35:47,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-29 23:35:47,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-29 23:35:47,571 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-29 23:35:47,571 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-01-29 23:35:47,571 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char
[2018-01-29 23:35:47,571 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-29 23:35:47,572 INFO L128 BoogieDeclarations]: Found specification of procedure append
[2018-01-29 23:35:47,572 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-01-29 23:35:47,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-29 23:35:47,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-29 23:35:48,127 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-29 23:35:48,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:35:48 BoogieIcfgContainer
[2018-01-29 23:35:48,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-29 23:35:48,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-29 23:35:48,129 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-01-29 23:35:48,132 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-01-29 23:35:48,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:35:47" (1/3) ...
[2018-01-29 23:35:48,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512638dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:35:48, skipping insertion in model container
[2018-01-29 23:35:48,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:35:47" (2/3) ...
[2018-01-29 23:35:48,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512638dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:35:48, skipping insertion in model container
[2018-01-29 23:35:48,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:35:48" (3/3) ...
[2018-01-29 23:35:48,136 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i
[2018-01-29 23:35:48,142 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-29 23:35:48,149 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations.
[2018-01-29 23:35:48,190 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-01-29 23:35:48,190 INFO L323 AbstractCegarLoop]: Hoare is true
[2018-01-29 23:35:48,190 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-29 23:35:48,190 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-29 23:35:48,190 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-29 23:35:48,191 INFO L327 AbstractCegarLoop]: Difference is false
[2018-01-29 23:35:48,191 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-29 23:35:48,191 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-29 23:35:48,191 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-29 23:35:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states.
[2018-01-29 23:35:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-01-29 23:35:48,217 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:48,218 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:35:48,218 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:48,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1557511447, now seen corresponding path program 1 times
[2018-01-29 23:35:48,224 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:48,224 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:48,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:48,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:48,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:48,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:48,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:35:48,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:35:48,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 23:35:48,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 23:35:48,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 23:35:48,477 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 4 states.
[2018-01-29 23:35:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:35:48,764 INFO L93 Difference]: Finished difference Result 332 states and 355 transitions.
[2018-01-29 23:35:48,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-29 23:35:48,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9
[2018-01-29 23:35:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:35:48,779 INFO L225 Difference]: With dead ends: 332
[2018-01-29 23:35:48,779 INFO L226 Difference]: Without dead ends: 198
[2018-01-29 23:35:48,782 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:35:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2018-01-29 23:35:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 156.
[2018-01-29 23:35:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states.
[2018-01-29 23:35:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions.
[2018-01-29 23:35:48,822 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 9
[2018-01-29 23:35:48,822 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:35:48,822 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions.
[2018-01-29 23:35:48,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 23:35:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions.
[2018-01-29 23:35:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-01-29 23:35:48,822 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:48,823 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:35:48,823 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:48,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1557511446, now seen corresponding path program 1 times
[2018-01-29 23:35:48,823 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:48,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:48,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:48,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:48,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:48,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:48,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:35:48,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:35:48,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 23:35:48,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 23:35:48,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 23:35:48,907 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 4 states.
[2018-01-29 23:35:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:35:49,105 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions.
[2018-01-29 23:35:49,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 23:35:49,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9
[2018-01-29 23:35:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:35:49,108 INFO L225 Difference]: With dead ends: 161
[2018-01-29 23:35:49,108 INFO L226 Difference]: Without dead ends: 159
[2018-01-29 23:35:49,109 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:35:49,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states.
[2018-01-29 23:35:49,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 154.
[2018-01-29 23:35:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states.
[2018-01-29 23:35:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 160 transitions.
[2018-01-29 23:35:49,121 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 160 transitions. Word has length 9
[2018-01-29 23:35:49,121 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:35:49,121 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 160 transitions.
[2018-01-29 23:35:49,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 23:35:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions.
[2018-01-29 23:35:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-01-29 23:35:49,122 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:49,122 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:35:49,122 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:49,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1392446483, now seen corresponding path program 1 times
[2018-01-29 23:35:49,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:49,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:49,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:49,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:49,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:49,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:49,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:35:49,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:35:49,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 23:35:49,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 23:35:49,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 23:35:49,172 INFO L87 Difference]: Start difference. First operand 154 states and 160 transitions. Second operand 4 states.
[2018-01-29 23:35:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:35:49,332 INFO L93 Difference]: Finished difference Result 175 states and 183 transitions.
[2018-01-29 23:35:49,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-29 23:35:49,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2018-01-29 23:35:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:35:49,335 INFO L225 Difference]: With dead ends: 175
[2018-01-29 23:35:49,335 INFO L226 Difference]: Without dead ends: 172
[2018-01-29 23:35:49,336 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:35:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states.
[2018-01-29 23:35:49,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158.
[2018-01-29 23:35:49,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states.
[2018-01-29 23:35:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions.
[2018-01-29 23:35:49,348 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 13
[2018-01-29 23:35:49,348 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:35:49,348 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions.
[2018-01-29 23:35:49,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 23:35:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions.
[2018-01-29 23:35:49,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-01-29 23:35:49,349 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:49,349 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:35:49,349 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:49,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1392446482, now seen corresponding path program 1 times
[2018-01-29 23:35:49,350 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:49,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:49,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:49,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:49,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:49,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:49,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:35:49,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:35:49,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 23:35:49,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 23:35:49,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 23:35:49,418 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 4 states.
[2018-01-29 23:35:49,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:35:49,534 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions.
[2018-01-29 23:35:49,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 23:35:49,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2018-01-29 23:35:49,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:35:49,535 INFO L225 Difference]: With dead ends: 163
[2018-01-29 23:35:49,536 INFO L226 Difference]: Without dead ends: 161
[2018-01-29 23:35:49,536 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:35:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states.
[2018-01-29 23:35:49,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156.
[2018-01-29 23:35:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states.
[2018-01-29 23:35:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 164 transitions.
[2018-01-29 23:35:49,547 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 164 transitions. Word has length 13
[2018-01-29 23:35:49,547 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:35:49,547 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 164 transitions.
[2018-01-29 23:35:49,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 23:35:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 164 transitions.
[2018-01-29 23:35:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-01-29 23:35:49,548 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:49,548 INFO L350 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]
[2018-01-29 23:35:49,549 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2039408052, now seen corresponding path program 1 times
[2018-01-29 23:35:49,549 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:49,550 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:49,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:49,551 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:49,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:49,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:49,629 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:35:49,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:35:49,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 23:35:49,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 23:35:49,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 23:35:49,631 INFO L87 Difference]: Start difference. First operand 156 states and 164 transitions. Second operand 4 states.
[2018-01-29 23:35:49,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:35:49,731 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions.
[2018-01-29 23:35:49,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 23:35:49,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25
[2018-01-29 23:35:49,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:35:49,732 INFO L225 Difference]: With dead ends: 156
[2018-01-29 23:35:49,732 INFO L226 Difference]: Without dead ends: 151
[2018-01-29 23:35:49,733 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:35:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2018-01-29 23:35:49,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151.
[2018-01-29 23:35:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states.
[2018-01-29 23:35:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions.
[2018-01-29 23:35:49,742 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 25
[2018-01-29 23:35:49,742 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:35:49,742 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions.
[2018-01-29 23:35:49,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 23:35:49,742 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions.
[2018-01-29 23:35:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-01-29 23:35:49,743 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:49,743 INFO L350 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]
[2018-01-29 23:35:49,744 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:49,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2039408053, now seen corresponding path program 1 times
[2018-01-29 23:35:49,744 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:49,744 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:49,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:49,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:49,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:49,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:49,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:35:49,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:35:49,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 23:35:49,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 23:35:49,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 23:35:49,827 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 4 states.
[2018-01-29 23:35:49,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:35:49,943 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions.
[2018-01-29 23:35:49,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 23:35:49,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25
[2018-01-29 23:35:49,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:35:49,945 INFO L225 Difference]: With dead ends: 151
[2018-01-29 23:35:49,945 INFO L226 Difference]: Without dead ends: 146
[2018-01-29 23:35:49,945 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:35:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2018-01-29 23:35:49,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146.
[2018-01-29 23:35:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states.
[2018-01-29 23:35:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions.
[2018-01-29 23:35:49,952 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 25
[2018-01-29 23:35:49,952 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:35:49,952 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions.
[2018-01-29 23:35:49,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 23:35:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions.
[2018-01-29 23:35:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-01-29 23:35:49,953 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:49,953 INFO L350 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]
[2018-01-29 23:35:49,953 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:49,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1202859706, now seen corresponding path program 1 times
[2018-01-29 23:35:49,954 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:49,954 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:49,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:49,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:49,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:49,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:50,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:35:50,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-29 23:35:50,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-29 23:35:50,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-29 23:35:50,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-01-29 23:35:50,101 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand 8 states.
[2018-01-29 23:35:50,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:35:50,434 INFO L93 Difference]: Finished difference Result 237 states and 257 transitions.
[2018-01-29 23:35:50,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-01-29 23:35:50,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26
[2018-01-29 23:35:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:35:50,472 INFO L225 Difference]: With dead ends: 237
[2018-01-29 23:35:50,472 INFO L226 Difference]: Without dead ends: 229
[2018-01-29 23:35:50,473 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2018-01-29 23:35:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states.
[2018-01-29 23:35:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 174.
[2018-01-29 23:35:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states.
[2018-01-29 23:35:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 194 transitions.
[2018-01-29 23:35:50,480 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 194 transitions. Word has length 26
[2018-01-29 23:35:50,480 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:35:50,480 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 194 transitions.
[2018-01-29 23:35:50,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-29 23:35:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 194 transitions.
[2018-01-29 23:35:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-01-29 23:35:50,481 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:50,481 INFO L350 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]
[2018-01-29 23:35:50,481 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:50,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1202859705, now seen corresponding path program 1 times
[2018-01-29 23:35:50,481 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:50,481 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:50,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:50,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:50,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:50,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:50,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:35:50,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-29 23:35:50,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-29 23:35:50,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-29 23:35:50,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2018-01-29 23:35:50,717 INFO L87 Difference]: Start difference. First operand 174 states and 194 transitions. Second operand 9 states.
[2018-01-29 23:35:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:35:51,112 INFO L93 Difference]: Finished difference Result 254 states and 269 transitions.
[2018-01-29 23:35:51,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-29 23:35:51,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26
[2018-01-29 23:35:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:35:51,114 INFO L225 Difference]: With dead ends: 254
[2018-01-29 23:35:51,114 INFO L226 Difference]: Without dead ends: 245
[2018-01-29 23:35:51,115 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156
[2018-01-29 23:35:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states.
[2018-01-29 23:35:51,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 214.
[2018-01-29 23:35:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states.
[2018-01-29 23:35:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 247 transitions.
[2018-01-29 23:35:51,126 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 247 transitions. Word has length 26
[2018-01-29 23:35:51,126 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:35:51,127 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 247 transitions.
[2018-01-29 23:35:51,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-29 23:35:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 247 transitions.
[2018-01-29 23:35:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-01-29 23:35:51,128 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:51,128 INFO L350 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]
[2018-01-29 23:35:51,128 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash 489808184, now seen corresponding path program 1 times
[2018-01-29 23:35:51,129 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:51,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:51,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:51,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:51,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:51,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:51,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:35:51,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2018-01-29 23:35:51,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-01-29 23:35:51,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-01-29 23:35:51,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182
[2018-01-29 23:35:51,502 INFO L87 Difference]: Start difference. First operand 214 states and 247 transitions. Second operand 14 states.
[2018-01-29 23:35:52,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:35:52,037 INFO L93 Difference]: Finished difference Result 444 states and 514 transitions.
[2018-01-29 23:35:52,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-01-29 23:35:52,037 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38
[2018-01-29 23:35:52,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:35:52,040 INFO L225 Difference]: With dead ends: 444
[2018-01-29 23:35:52,040 INFO L226 Difference]: Without dead ends: 245
[2018-01-29 23:35:52,042 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600
[2018-01-29 23:35:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states.
[2018-01-29 23:35:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227.
[2018-01-29 23:35:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states.
[2018-01-29 23:35:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 261 transitions.
[2018-01-29 23:35:52,052 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 261 transitions. Word has length 38
[2018-01-29 23:35:52,053 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:35:52,053 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 261 transitions.
[2018-01-29 23:35:52,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-01-29 23:35:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 261 transitions.
[2018-01-29 23:35:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2018-01-29 23:35:52,054 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:52,054 INFO L350 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]
[2018-01-29 23:35:52,055 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:52,055 INFO L82 PathProgramCache]: Analyzing trace with hash 559467221, now seen corresponding path program 1 times
[2018-01-29 23:35:52,055 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:52,055 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:52,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:52,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:52,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:52,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:52,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:35:52,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2018-01-29 23:35:52,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-01-29 23:35:52,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-01-29 23:35:52,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156
[2018-01-29 23:35:52,648 INFO L87 Difference]: Start difference. First operand 227 states and 261 transitions. Second operand 13 states.
[2018-01-29 23:35:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:35:53,138 INFO L93 Difference]: Finished difference Result 434 states and 503 transitions.
[2018-01-29 23:35:53,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-01-29 23:35:53,138 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40
[2018-01-29 23:35:53,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:35:53,140 INFO L225 Difference]: With dead ends: 434
[2018-01-29 23:35:53,140 INFO L226 Difference]: Without dead ends: 235
[2018-01-29 23:35:53,141 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506
[2018-01-29 23:35:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states.
[2018-01-29 23:35:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 230.
[2018-01-29 23:35:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states.
[2018-01-29 23:35:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 264 transitions.
[2018-01-29 23:35:53,152 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 264 transitions. Word has length 40
[2018-01-29 23:35:53,153 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:35:53,153 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 264 transitions.
[2018-01-29 23:35:53,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-01-29 23:35:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 264 transitions.
[2018-01-29 23:35:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-01-29 23:35:53,154 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:53,154 INFO L350 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, 1, 1, 1, 1, 1]
[2018-01-29 23:35:53,154 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:53,155 INFO L82 PathProgramCache]: Analyzing trace with hash 170214831, now seen corresponding path program 1 times
[2018-01-29 23:35:53,155 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:53,155 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:53,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:53,156 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:53,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:53,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:53,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:35:53,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:35:53,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-29 23:35:53,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-29 23:35:53,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-29 23:35:53,208 INFO L87 Difference]: Start difference. First operand 230 states and 264 transitions. Second operand 3 states.
[2018-01-29 23:35:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:35:53,234 INFO L93 Difference]: Finished difference Result 269 states and 287 transitions.
[2018-01-29 23:35:53,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-29 23:35:53,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51
[2018-01-29 23:35:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:35:53,236 INFO L225 Difference]: With dead ends: 269
[2018-01-29 23:35:53,236 INFO L226 Difference]: Without dead ends: 202
[2018-01-29 23:35:53,237 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-29 23:35:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states.
[2018-01-29 23:35:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185.
[2018-01-29 23:35:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states.
[2018-01-29 23:35:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 195 transitions.
[2018-01-29 23:35:53,252 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 195 transitions. Word has length 51
[2018-01-29 23:35:53,252 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:35:53,252 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 195 transitions.
[2018-01-29 23:35:53,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-29 23:35:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 195 transitions.
[2018-01-29 23:35:53,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2018-01-29 23:35:53,254 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:53,254 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:35:53,254 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:53,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1501797044, now seen corresponding path program 1 times
[2018-01-29 23:35:53,255 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:53,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:53,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:53,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:53,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:53,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:53,478 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:35:53,478 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:35:53,486 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:53,545 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:35:53,617 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~node~4.base Int)) (and (= 0 (select |c_old(#valid)| append_~node~4.base)) (= |c_#valid| (store |c_old(#valid)| append_~node~4.base 1)))) is different from true
[2018-01-29 23:35:53,662 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:53,664 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:53,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-01-29 23:35:53,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:53,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:35:53,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15
[2018-01-29 23:35:53,798 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 17 treesize of output 20
[2018-01-29 23:35:53,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:53,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:35:53,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20
[2018-01-29 23:35:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2018-01-29 23:35:53,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:35:53,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17
[2018-01-29 23:35:53,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-01-29 23:35:53,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-01-29 23:35:53,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306
[2018-01-29 23:35:53,998 INFO L87 Difference]: Start difference. First operand 185 states and 195 transitions. Second operand 18 states.
[2018-01-29 23:35:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:35:54,708 INFO L93 Difference]: Finished difference Result 226 states and 235 transitions.
[2018-01-29 23:35:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-01-29 23:35:54,708 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57
[2018-01-29 23:35:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:35:54,710 INFO L225 Difference]: With dead ends: 226
[2018-01-29 23:35:54,710 INFO L226 Difference]: Without dead ends: 224
[2018-01-29 23:35:54,710 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=440, Unknown=1, NotChecked=44, Total=600
[2018-01-29 23:35:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states.
[2018-01-29 23:35:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 187.
[2018-01-29 23:35:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states.
[2018-01-29 23:35:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions.
[2018-01-29 23:35:54,720 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 57
[2018-01-29 23:35:54,721 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:35:54,721 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions.
[2018-01-29 23:35:54,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-01-29 23:35:54,721 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions.
[2018-01-29 23:35:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2018-01-29 23:35:54,722 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:54,722 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:35:54,722 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:54,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1501797045, now seen corresponding path program 1 times
[2018-01-29 23:35:54,723 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:54,723 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:54,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:54,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:54,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:54,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:55,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:35:55,011 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:35:55,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:55,063 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:35:55,144 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:55,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, 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 17
[2018-01-29 23:35:55,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:55,163 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:55,164 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:55,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-01-29 23:35:55,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:55,177 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-01-29 23:35:55,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:30
[2018-01-29 23:35:55,300 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:55,301 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:55,302 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:55,303 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 16 treesize of output 13
[2018-01-29 23:35:55,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:55,320 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 19 treesize of output 30
[2018-01-29 23:35:55,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:55,330 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-01-29 23:35:55,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:33
[2018-01-29 23:35:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:55,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:35:55,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18
[2018-01-29 23:35:55,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-01-29 23:35:55,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-01-29 23:35:55,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=292, Unknown=4, NotChecked=0, Total=342
[2018-01-29 23:35:55,468 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand 19 states.
[2018-01-29 23:35:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:35:57,494 INFO L93 Difference]: Finished difference Result 223 states and 233 transitions.
[2018-01-29 23:35:57,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-01-29 23:35:57,494 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57
[2018-01-29 23:35:57,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:35:57,496 INFO L225 Difference]: With dead ends: 223
[2018-01-29 23:35:57,496 INFO L226 Difference]: Without dead ends: 214
[2018-01-29 23:35:57,496 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=503, Unknown=5, NotChecked=0, Total=600
[2018-01-29 23:35:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states.
[2018-01-29 23:35:57,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 178.
[2018-01-29 23:35:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states.
[2018-01-29 23:35:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 189 transitions.
[2018-01-29 23:35:57,507 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 189 transitions. Word has length 57
[2018-01-29 23:35:57,507 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:35:57,508 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 189 transitions.
[2018-01-29 23:35:57,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-01-29 23:35:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 189 transitions.
[2018-01-29 23:35:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-01-29 23:35:57,509 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:35:57,509 INFO L350 BasicCegarLoop]: trace histogram [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-01-29 23:35:57,509 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:35:57,509 INFO L82 PathProgramCache]: Analyzing trace with hash -440777727, now seen corresponding path program 1 times
[2018-01-29 23:35:57,510 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:35:57,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:35:57,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:57,511 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:57,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:35:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:57,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:35:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:35:58,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:35:58,558 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:35:58,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:35:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:35:58,617 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:35:58,714 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 12 treesize of output 11
[2018-01-29 23:35:58,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:58,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:58,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14
[2018-01-29 23:35:58,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-29 23:35:58,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:35:58,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:58,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:58,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:58,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25
[2018-01-29 23:35:58,947 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 23 treesize of output 35
[2018-01-29 23:35:58,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23
[2018-01-29 23:35:58,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:58,974 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 21 treesize of output 30
[2018-01-29 23:35:58,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-01-29 23:35:58,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:35:58,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:35:58,998 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70
[2018-01-29 23:35:59,079 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 33 treesize of output 28
[2018-01-29 23:35:59,085 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:59,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 18 treesize of output 27
[2018-01-29 23:35:59,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:59,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:59,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 65
[2018-01-29 23:35:59,132 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:59,133 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 61 treesize of output 76
[2018-01-29 23:35:59,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:59,169 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:59,179 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 53
[2018-01-29 23:35:59,180 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts.
[2018-01-29 23:35:59,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:35:59,231 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 3 xjuncts.
[2018-01-29 23:35:59,231 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115
[2018-01-29 23:35:59,330 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:59,331 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:59,332 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 66 treesize of output 60
[2018-01-29 23:35:59,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:59,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:35:59,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60
[2018-01-29 23:35:59,497 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:59,498 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:59,498 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:59,499 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 28 treesize of output 52
[2018-01-29 23:35:59,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:59,513 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 1 xjuncts.
[2018-01-29 23:35:59,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82
[2018-01-29 23:35:59,620 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 77 treesize of output 75
[2018-01-29 23:35:59,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2018-01-29 23:35:59,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:59,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:59,650 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-01-29 23:35:59,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:82
[2018-01-29 23:35:59,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73
[2018-01-29 23:35:59,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:35:59,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:59,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:59,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:35:59,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85
[2018-01-29 23:35:59,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73
[2018-01-29 23:35:59,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:35:59,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:59,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:59,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:35:59,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94
[2018-01-29 23:35:59,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65
[2018-01-29 23:35:59,979 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:35:59,980 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 15 treesize of output 8
[2018-01-29 23:35:59,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:59,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2018-01-29 23:35:59,992 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:35:59,999 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:35:59,999 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 33 treesize of output 21
[2018-01-29 23:36:00,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:00,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:00,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:00,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28
[2018-01-29 23:36:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:36:00,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:36:00,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43
[2018-01-29 23:36:00,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states
[2018-01-29 23:36:00,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2018-01-29 23:36:00,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1746, Unknown=0, NotChecked=0, Total=1892
[2018-01-29 23:36:00,092 INFO L87 Difference]: Start difference. First operand 178 states and 189 transitions. Second operand 44 states.
[2018-01-29 23:36:02,047 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 115 DAG size of output 69
[2018-01-29 23:36:02,360 WARN L146 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 124 DAG size of output 73
[2018-01-29 23:36:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:36:04,404 INFO L93 Difference]: Finished difference Result 267 states and 285 transitions.
[2018-01-29 23:36:04,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states.
[2018-01-29 23:36:04,406 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 66
[2018-01-29 23:36:04,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:36:04,408 INFO L225 Difference]: With dead ends: 267
[2018-01-29 23:36:04,408 INFO L226 Difference]: Without dead ends: 266
[2018-01-29 23:36:04,410 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=653, Invalid=4897, Unknown=0, NotChecked=0, Total=5550
[2018-01-29 23:36:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2018-01-29 23:36:04,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 187.
[2018-01-29 23:36:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states.
[2018-01-29 23:36:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 196 transitions.
[2018-01-29 23:36:04,424 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 196 transitions. Word has length 66
[2018-01-29 23:36:04,424 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:36:04,424 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 196 transitions.
[2018-01-29 23:36:04,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states.
[2018-01-29 23:36:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 196 transitions.
[2018-01-29 23:36:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-01-29 23:36:04,426 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:36:04,426 INFO L350 BasicCegarLoop]: trace histogram [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-01-29 23:36:04,426 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:36:04,426 INFO L82 PathProgramCache]: Analyzing trace with hash -440777726, now seen corresponding path program 1 times
[2018-01-29 23:36:04,426 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:36:04,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:36:04,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:36:04,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:36:04,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:36:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:36:04,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:36:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:36:05,656 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:36:05,656 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:36:05,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:36:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:36:05,697 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:36:05,788 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 12 treesize of output 11
[2018-01-29 23:36:05,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:05,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:05,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14
[2018-01-29 23:36:05,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:36:05,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:05,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:05,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17
[2018-01-29 23:36:05,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-29 23:36:05,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:36:05,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:05,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:06,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-29 23:36:06,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:36:06,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:06,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:06,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:06,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40
[2018-01-29 23:36:06,086 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 23 treesize of output 53
[2018-01-29 23:36:06,089 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 36 treesize of output 35
[2018-01-29 23:36:06,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:06,112 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 33 treesize of output 48
[2018-01-29 23:36:06,112 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:06,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:06,157 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 47 treesize of output 57
[2018-01-29 23:36:06,160 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:06,161 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 43 treesize of output 54
[2018-01-29 23:36:06,161 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:06,182 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 44 treesize of output 43
[2018-01-29 23:36:06,183 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:06,193 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:06,195 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:06,197 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 54 treesize of output 48
[2018-01-29 23:36:06,199 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:06,200 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 38 treesize of output 29
[2018-01-29 23:36:06,200 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:06,205 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:06,226 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-01-29 23:36:06,226 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:66, output treesize:110
[2018-01-29 23:36:06,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 157
[2018-01-29 23:36:06,322 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:06,323 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 161 treesize of output 188
[2018-01-29 23:36:06,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:06,445 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:06,447 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:06,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 166
[2018-01-29 23:36:06,460 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:06,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:06,635 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 112 treesize of output 95
[2018-01-29 23:36:06,637 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:06,638 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:06,638 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:06,640 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 49
[2018-01-29 23:36:06,641 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:06,654 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:06,673 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 158 treesize of output 158
[2018-01-29 23:36:06,677 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:06,678 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 151 treesize of output 178
[2018-01-29 23:36:06,679 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:06,748 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:06,749 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:06,760 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 164
[2018-01-29 23:36:06,762 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:06,810 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:06,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:36:06,929 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:249, output treesize:210
[2018-01-29 23:36:07,042 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:07,048 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:07,049 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 156 treesize of output 150
[2018-01-29 23:36:07,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:07,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:07,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:226, output treesize:150
[2018-01-29 23:36:07,289 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 37 treesize of output 26
[2018-01-29 23:36:07,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:07,312 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:07,313 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:07,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-29 23:36:07,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:07,333 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-01-29 23:36:07,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:161, output treesize:144
[2018-01-29 23:36:07,496 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 3 case distinctions, treesize of input 120 treesize of output 150
[2018-01-29 23:36:07,504 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:07,530 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 4 case distinctions, treesize of input 124 treesize of output 160
[2018-01-29 23:36:07,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts.
[2018-01-29 23:36:07,818 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 117 treesize of output 105
[2018-01-29 23:36:07,818 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:07,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts.
[2018-01-29 23:36:07,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 115
[2018-01-29 23:36:07,941 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:07,944 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 39 treesize of output 78
[2018-01-29 23:36:07,944 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:07,958 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:07,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 152
[2018-01-29 23:36:07,984 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:08,001 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 4 case distinctions, treesize of input 135 treesize of output 171
[2018-01-29 23:36:08,002 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts.
[2018-01-29 23:36:08,100 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 138 treesize of output 126
[2018-01-29 23:36:08,101 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:08,149 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts.
[2018-01-29 23:36:08,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 115
[2018-01-29 23:36:08,161 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:08,164 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 39 treesize of output 78
[2018-01-29 23:36:08,164 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:08,180 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:08,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts.
[2018-01-29 23:36:08,238 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:174, output treesize:323
[2018-01-29 23:36:08,444 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 115 treesize of output 116
[2018-01-29 23:36:08,448 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:08,451 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 51
[2018-01-29 23:36:08,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:08,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:08,710 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 115 treesize of output 116
[2018-01-29 23:36:08,713 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:08,714 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 51
[2018-01-29 23:36:08,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:08,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:08,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118
[2018-01-29 23:36:08,891 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:08,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39
[2018-01-29 23:36:08,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:08,912 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:09,038 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 3 case distinctions, treesize of input 170 treesize of output 186
[2018-01-29 23:36:09,042 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 177 treesize of output 176
[2018-01-29 23:36:09,042 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:09,138 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:09,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 145 treesize of output 196
[2018-01-29 23:36:09,158 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts.
[2018-01-29 23:36:09,260 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts.
[2018-01-29 23:36:09,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 173
[2018-01-29 23:36:09,458 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 173 treesize of output 172
[2018-01-29 23:36:09,458 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:09,540 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:09,556 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 4 case distinctions, treesize of input 141 treesize of output 192
[2018-01-29 23:36:09,557 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts.
[2018-01-29 23:36:09,650 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts.
[2018-01-29 23:36:09,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 127
[2018-01-29 23:36:09,662 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:09,663 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:09,664 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:09,667 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 37 treesize of output 78
[2018-01-29 23:36:09,667 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:09,691 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:09,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 127
[2018-01-29 23:36:09,702 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:09,702 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:09,704 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 37 treesize of output 78
[2018-01-29 23:36:09,705 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:09,726 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:09,924 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 123 treesize of output 118
[2018-01-29 23:36:09,928 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:09,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39
[2018-01-29 23:36:09,930 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:09,950 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:10,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts.
[2018-01-29 23:36:10,076 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 15 variables, input treesize:401, output treesize:529
[2018-01-29 23:36:10,312 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 3 case distinctions, treesize of input 170 treesize of output 186
[2018-01-29 23:36:10,317 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:10,321 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 160 treesize of output 183
[2018-01-29 23:36:10,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:10,403 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 167 treesize of output 166
[2018-01-29 23:36:10,404 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:10,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:11,201 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 155 treesize of output 141
[2018-01-29 23:36:11,203 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:11,204 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 63
[2018-01-29 23:36:11,204 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:11,222 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:11,863 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 155 treesize of output 141
[2018-01-29 23:36:11,866 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:11,866 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 63
[2018-01-29 23:36:11,867 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:11,890 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:12,397 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 145 treesize of output 128
[2018-01-29 23:36:12,399 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:12,399 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 63
[2018-01-29 23:36:12,399 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:12,415 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:12,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 148
[2018-01-29 23:36:12,796 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:12,797 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 63
[2018-01-29 23:36:12,797 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:12,820 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:13,107 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 145 treesize of output 131
[2018-01-29 23:36:13,111 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:13,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, 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 63
[2018-01-29 23:36:13,112 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:13,127 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:13,349 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 145 treesize of output 128
[2018-01-29 23:36:13,351 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:13,351 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 63
[2018-01-29 23:36:13,352 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:13,368 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:13,529 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:13,529 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 155 treesize of output 148
[2018-01-29 23:36:13,532 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 36 treesize of output 21
[2018-01-29 23:36:13,532 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:13,546 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:13,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 173
[2018-01-29 23:36:13,741 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 173 treesize of output 172
[2018-01-29 23:36:13,741 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:13,851 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:13,964 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:13,964 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 124 treesize of output 110
[2018-01-29 23:36:13,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21
[2018-01-29 23:36:13,966 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:13,978 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 10 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts.
[2018-01-29 23:36:14,076 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 17 variables, input treesize:791, output treesize:661
[2018-01-29 23:36:14,296 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 111 treesize of output 102
[2018-01-29 23:36:14,302 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:14,303 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 44 treesize of output 32
[2018-01-29 23:36:14,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,323 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 1
[2018-01-29 23:36:14,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 123
[2018-01-29 23:36:14,395 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:14,396 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 84 treesize of output 60
[2018-01-29 23:36:14,396 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,415 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:14,415 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 15 treesize of output 8
[2018-01-29 23:36:14,415 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,428 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53
[2018-01-29 23:36:14,483 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:14,484 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 35 treesize of output 23
[2018-01-29 23:36:14,484 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2018-01-29 23:36:14,494 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,501 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,549 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 78 treesize of output 63
[2018-01-29 23:36:14,551 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:14,551 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 25 treesize of output 17
[2018-01-29 23:36:14,551 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,562 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:14,563 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 15 treesize of output 8
[2018-01-29 23:36:14,563 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,570 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,613 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 153 treesize of output 134
[2018-01-29 23:36:14,616 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:14,616 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 27 treesize of output 20
[2018-01-29 23:36:14,616 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,634 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:14,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47
[2018-01-29 23:36:14,635 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,648 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64
[2018-01-29 23:36:14,692 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:14,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30
[2018-01-29 23:36:14,693 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,707 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:14,708 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 15 treesize of output 8
[2018-01-29 23:36:14,708 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,718 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:14,743 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 15 variables, input treesize:418, output treesize:14
[2018-01-29 23:36:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:36:14,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:36:14,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43
[2018-01-29 23:36:14,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states
[2018-01-29 23:36:14,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2018-01-29 23:36:14,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1762, Unknown=0, NotChecked=0, Total=1892
[2018-01-29 23:36:14,842 INFO L87 Difference]: Start difference. First operand 187 states and 196 transitions. Second operand 44 states.
[2018-01-29 23:36:16,179 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 103 DAG size of output 70
[2018-01-29 23:36:16,422 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 131 DAG size of output 116
[2018-01-29 23:36:17,695 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 238 DAG size of output 101
[2018-01-29 23:36:18,142 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 210 DAG size of output 82
[2018-01-29 23:36:18,477 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 243 DAG size of output 108
[2018-01-29 23:36:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:36:20,082 INFO L93 Difference]: Finished difference Result 264 states and 282 transitions.
[2018-01-29 23:36:20,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states.
[2018-01-29 23:36:20,082 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 66
[2018-01-29 23:36:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:36:20,083 INFO L225 Difference]: With dead ends: 264
[2018-01-29 23:36:20,083 INFO L226 Difference]: Without dead ends: 263
[2018-01-29 23:36:20,085 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=627, Invalid=5073, Unknown=0, NotChecked=0, Total=5700
[2018-01-29 23:36:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states.
[2018-01-29 23:36:20,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 187.
[2018-01-29 23:36:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states.
[2018-01-29 23:36:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 195 transitions.
[2018-01-29 23:36:20,094 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 195 transitions. Word has length 66
[2018-01-29 23:36:20,094 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:36:20,094 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 195 transitions.
[2018-01-29 23:36:20,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states.
[2018-01-29 23:36:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 195 transitions.
[2018-01-29 23:36:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2018-01-29 23:36:20,095 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:36:20,095 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:36:20,095 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:36:20,095 INFO L82 PathProgramCache]: Analyzing trace with hash -212929114, now seen corresponding path program 1 times
[2018-01-29 23:36:20,095 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:36:20,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:36:20,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:36:20,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:36:20,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:36:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:36:20,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:36:20,816 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 54 DAG size of output 51
[2018-01-29 23:36:20,998 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 52 DAG size of output 49
[2018-01-29 23:36:21,186 WARN L143 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 50
[2018-01-29 23:36:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:36:21,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:36:21,558 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:36:21,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:36:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:36:21,597 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:36:21,604 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:21,605 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:21,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-29 23:36:21,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:21,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:21,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4
[2018-01-29 23:36:21,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:36:21,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:36:21,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:21,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:21,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-01-29 23:36:21,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:36:21,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:21,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:21,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:21,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24
[2018-01-29 23:36:21,693 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 26 treesize of output 21
[2018-01-29 23:36:21,699 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:21,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23
[2018-01-29 23:36:21,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:21,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:21,716 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 26 treesize of output 21
[2018-01-29 23:36:21,721 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:21,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23
[2018-01-29 23:36:21,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:21,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:21,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:21,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:42
[2018-01-29 23:36:21,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:21,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:21,895 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:21,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:21,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:21,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:69
[2018-01-29 23:36:22,172 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~node~4.offset Int) (append_~head.offset Int) (append_~node~4.base Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (let ((.cse1 (+ append_~node~4.offset 1)) (.cse2 (+ append_~node~4.offset 5)) (.cse4 (+ append_~head.offset 4))) (and (= 0 (select |c_old(#valid)| append_~node~4.base)) (= |c_#valid| (store |c_old(#valid)| append_~node~4.base 1)) (= |c_#memory_$Pointer$.offset| (let ((.cse0 (let ((.cse3 (store |c_old(#memory_$Pointer$.offset)| append_~node~4.base (store (select |c_old(#memory_$Pointer$.offset)| append_~node~4.base) append_~node~4.offset v_DerPreprocessor_4)))) (store .cse3 |c_append_#in~head.base| (store (store (select .cse3 |c_append_#in~head.base|) append_~head.offset append_~node~4.offset) .cse4 append_~node~4.offset))))) (store .cse0 append_~node~4.base (store (store (select .cse0 append_~node~4.base) .cse1 0) .cse2 0)))) (= |c_#memory_$Pointer$.base| (let ((.cse5 (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| append_~node~4.base (store (select |c_old(#memory_$Pointer$.base)| append_~node~4.base) append_~node~4.offset v_DerPreprocessor_2)))) (store .cse6 |c_append_#in~head.base| (store (store (select .cse6 |c_append_#in~head.base|) append_~head.offset append_~node~4.base) .cse4 append_~node~4.base))))) (store .cse5 append_~node~4.base (store (store (select .cse5 append_~node~4.base) .cse1 0) .cse2 0))))))) is different from true
[2018-01-29 23:36:22,182 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,190 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,190 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 17 treesize of output 21
[2018-01-29 23:36:22,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:22,293 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 93 treesize of output 73
[2018-01-29 23:36:22,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:36:22,334 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:22,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66
[2018-01-29 23:36:22,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46
[2018-01-29 23:36:22,448 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,448 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 40 treesize of output 44
[2018-01-29 23:36:22,449 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:22,489 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,500 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 3 case distinctions, treesize of input 42 treesize of output 54
[2018-01-29 23:36:22,501 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:22,542 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts.
[2018-01-29 23:36:22,639 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 58 treesize of output 53
[2018-01-29 23:36:22,645 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,646 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 61
[2018-01-29 23:36:22,675 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,676 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,677 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,681 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,682 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,682 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:22,691 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 78
[2018-01-29 23:36:22,691 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:22,748 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,749 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,750 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,750 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,751 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,752 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,759 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 35 treesize of output 78
[2018-01-29 23:36:22,759 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:22,817 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,819 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,821 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,825 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:22,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 74
[2018-01-29 23:36:22,852 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:22,989 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 4 xjuncts.
[2018-01-29 23:36:23,056 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 4 xjuncts.
[2018-01-29 23:36:23,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53
[2018-01-29 23:36:23,069 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,070 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,071 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,074 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 28 treesize of output 52
[2018-01-29 23:36:23,078 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,079 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,079 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,080 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,081 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,082 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,088 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 32 treesize of output 85
[2018-01-29 23:36:23,088 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:23,107 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:23,122 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:23,131 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 54 treesize of output 51
[2018-01-29 23:36:23,134 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,135 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,136 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,139 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 28 treesize of output 50
[2018-01-29 23:36:23,142 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,143 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,144 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,145 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,145 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,151 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 0 case distinctions, treesize of input 30 treesize of output 77
[2018-01-29 23:36:23,151 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:23,166 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:23,181 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:23,315 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts.
[2018-01-29 23:36:23,343 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 67
[2018-01-29 23:36:23,347 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 13 treesize of output 16
[2018-01-29 23:36:23,351 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23
[2018-01-29 23:36:23,352 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:23,365 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:23,424 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 58 treesize of output 65
[2018-01-29 23:36:23,428 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,431 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 21 treesize of output 35
[2018-01-29 23:36:23,435 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,436 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,437 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:23,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64
[2018-01-29 23:36:23,443 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:23,459 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:23,483 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:23,507 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:23,687 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts.
[2018-01-29 23:36:23,913 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 93 treesize of output 73
[2018-01-29 23:36:23,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:36:23,963 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,015 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 67
[2018-01-29 23:36:24,018 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 13 treesize of output 16
[2018-01-29 23:36:24,021 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23
[2018-01-29 23:36:24,022 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,028 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,053 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 58 treesize of output 65
[2018-01-29 23:36:24,056 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,058 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 21 treesize of output 29
[2018-01-29 23:36:24,061 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,061 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,062 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46
[2018-01-29 23:36:24,064 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,073 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,084 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,097 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66
[2018-01-29 23:36:24,125 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 43 treesize of output 46
[2018-01-29 23:36:24,128 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,129 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 40 treesize of output 44
[2018-01-29 23:36:24,129 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,161 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,173 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 3 case distinctions, treesize of input 42 treesize of output 54
[2018-01-29 23:36:24,173 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:24,207 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 3 xjuncts.
[2018-01-29 23:36:24,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51
[2018-01-29 23:36:24,259 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,261 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,262 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,265 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 28 treesize of output 50
[2018-01-29 23:36:24,268 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,268 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,269 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,269 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,270 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,274 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 0 case distinctions, treesize of input 30 treesize of output 77
[2018-01-29 23:36:24,274 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,290 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,303 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,311 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 56 treesize of output 53
[2018-01-29 23:36:24,315 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,316 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,317 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,320 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 28 treesize of output 52
[2018-01-29 23:36:24,324 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,325 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,326 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,327 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,328 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,328 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,335 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 32 treesize of output 85
[2018-01-29 23:36:24,335 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,388 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,400 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,432 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 58 treesize of output 53
[2018-01-29 23:36:24,438 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,438 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 61
[2018-01-29 23:36:24,469 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,470 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,470 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,471 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,472 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,472 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:24,478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 78
[2018-01-29 23:36:24,478 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,523 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,524 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,526 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,530 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 74
[2018-01-29 23:36:24,555 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:24,604 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,605 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,606 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,607 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,608 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,608 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:24,614 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 35 treesize of output 78
[2018-01-29 23:36:24,614 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:24,684 INFO L267 ElimStorePlain]: Start of recursive call 45: 4 dim-1 vars, End of recursive call: and 4 xjuncts.
[2018-01-29 23:36:24,722 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 4 xjuncts.
[2018-01-29 23:36:24,788 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts.
[2018-01-29 23:36:24,872 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts.
[2018-01-29 23:36:25,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 42 dim-0 vars, and 21 xjuncts.
[2018-01-29 23:36:25,050 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 9 variables, input treesize:205, output treesize:3010
[2018-01-29 23:36:31,890 WARN L146 SmtUtils]: Spent 4319ms on a formula simplification. DAG size of input: 660 DAG size of output 43
[2018-01-29 23:36:32,040 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:32,041 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:32,042 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:32,042 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 16 treesize of output 13
[2018-01-29 23:36:32,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:32,057 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 1 xjuncts.
[2018-01-29 23:36:32,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:84, output treesize:77
[2018-01-29 23:36:32,216 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 48 treesize of output 57
[2018-01-29 23:36:32,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2018-01-29 23:36:32,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:32,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:32,262 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 48 treesize of output 57
[2018-01-29 23:36:32,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2018-01-29 23:36:32,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:32,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:32,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:32,286 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:107, output treesize:69
[2018-01-29 23:36:32,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34
[2018-01-29 23:36:32,357 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:32,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10
[2018-01-29 23:36:32,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:32,365 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:32,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6
[2018-01-29 23:36:32,365 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:32,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:32,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34
[2018-01-29 23:36:32,380 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:32,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10
[2018-01-29 23:36:32,381 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:32,387 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:32,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6
[2018-01-29 23:36:32,388 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:32,390 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:32,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:32,394 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:83, output treesize:7
[2018-01-29 23:36:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:36:32,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:36:32,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 40
[2018-01-29 23:36:32,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states
[2018-01-29 23:36:32,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2018-01-29 23:36:32,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1333, Unknown=20, NotChecked=74, Total=1560
[2018-01-29 23:36:32,532 INFO L87 Difference]: Start difference. First operand 187 states and 195 transitions. Second operand 40 states.
[2018-01-29 23:36:34,162 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 84 DAG size of output 52
[2018-01-29 23:36:34,988 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 88 DAG size of output 54
[2018-01-29 23:36:36,014 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 85 DAG size of output 81
[2018-01-29 23:36:36,207 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 91 DAG size of output 85
[2018-01-29 23:36:36,407 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 92 DAG size of output 86
[2018-01-29 23:36:37,633 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 86 DAG size of output 82
[2018-01-29 23:36:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:36:40,428 INFO L93 Difference]: Finished difference Result 418 states and 444 transitions.
[2018-01-29 23:36:40,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-01-29 23:36:40,429 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 69
[2018-01-29 23:36:40,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:36:40,431 INFO L225 Difference]: With dead ends: 418
[2018-01-29 23:36:40,431 INFO L226 Difference]: Without dead ends: 315
[2018-01-29 23:36:40,433 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=413, Invalid=3287, Unknown=86, NotChecked=120, Total=3906
[2018-01-29 23:36:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states.
[2018-01-29 23:36:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 226.
[2018-01-29 23:36:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states.
[2018-01-29 23:36:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 243 transitions.
[2018-01-29 23:36:40,454 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 243 transitions. Word has length 69
[2018-01-29 23:36:40,454 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:36:40,454 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 243 transitions.
[2018-01-29 23:36:40,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states.
[2018-01-29 23:36:40,455 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 243 transitions.
[2018-01-29 23:36:40,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2018-01-29 23:36:40,456 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:36:40,456 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:36:40,456 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:36:40,456 INFO L82 PathProgramCache]: Analyzing trace with hash -461210685, now seen corresponding path program 1 times
[2018-01-29 23:36:40,456 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:36:40,456 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:36:40,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:36:40,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:36:40,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:36:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:36:40,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:36:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:36:41,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:36:41,756 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:36:41,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:36:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:36:41,798 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:36:41,835 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:41,835 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:41,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-29 23:36:41,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:41,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:41,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8
[2018-01-29 23:36:41,957 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-01-29 23:36:41,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:36:41,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:41,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:41,970 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-01-29 23:36:41,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:36:41,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:41,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:41,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:41,981 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31
[2018-01-29 23:36:42,154 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:42,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:42,173 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:42,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:42,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:42,190 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:69
[2018-01-29 23:36:42,458 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~node~4.offset Int) (append_~head.offset Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_6 Int) (append_~node~4.base Int)) (let ((.cse1 (+ append_~node~4.offset 1)) (.cse2 (+ append_~node~4.offset 5)) (.cse4 (+ append_~head.offset 4))) (and (= 0 (select |c_old(#valid)| append_~node~4.base)) (= |c_#valid| (store |c_old(#valid)| append_~node~4.base 1)) (= (let ((.cse0 (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| append_~node~4.base (store (select |c_old(#memory_$Pointer$.base)| append_~node~4.base) append_~node~4.offset v_DerPreprocessor_8)))) (store .cse3 |c_append_#in~head.base| (store (store (select .cse3 |c_append_#in~head.base|) append_~head.offset append_~node~4.base) .cse4 append_~node~4.base))))) (store .cse0 append_~node~4.base (store (store (select .cse0 append_~node~4.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.base|) (= (let ((.cse5 (let ((.cse6 (store |c_old(#memory_$Pointer$.offset)| append_~node~4.base (store (select |c_old(#memory_$Pointer$.offset)| append_~node~4.base) append_~node~4.offset v_DerPreprocessor_6)))) (store .cse6 |c_append_#in~head.base| (store (store (select .cse6 |c_append_#in~head.base|) append_~head.offset append_~node~4.offset) .cse4 append_~node~4.offset))))) (store .cse5 append_~node~4.base (store (store (select .cse5 append_~node~4.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.offset|)))) is different from true
[2018-01-29 23:36:42,507 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:42,510 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:42,510 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 17 treesize of output 21
[2018-01-29 23:36:42,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:42,632 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 86 treesize of output 66
[2018-01-29 23:36:42,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:36:42,677 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:42,782 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 52 treesize of output 60
[2018-01-29 23:36:42,786 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 13 treesize of output 16
[2018-01-29 23:36:42,790 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23
[2018-01-29 23:36:42,791 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:42,802 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:42,857 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 51 treesize of output 58
[2018-01-29 23:36:42,862 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:42,866 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 21 treesize of output 35
[2018-01-29 23:36:42,872 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:42,873 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:42,877 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:42,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64
[2018-01-29 23:36:42,887 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:42,910 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:42,933 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:42,961 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:42,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59
[2018-01-29 23:36:42,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46
[2018-01-29 23:36:43,001 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,002 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 40 treesize of output 44
[2018-01-29 23:36:43,002 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:43,048 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,061 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 3 case distinctions, treesize of input 42 treesize of output 54
[2018-01-29 23:36:43,062 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:43,108 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts.
[2018-01-29 23:36:43,207 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 46
[2018-01-29 23:36:43,211 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,212 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,212 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,216 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 28 treesize of output 52
[2018-01-29 23:36:43,219 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,220 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,221 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,222 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,223 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,224 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,230 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 32 treesize of output 85
[2018-01-29 23:36:43,230 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:43,249 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:43,265 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:43,275 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 51 treesize of output 46
[2018-01-29 23:36:43,282 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,283 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 61
[2018-01-29 23:36:43,320 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,321 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,322 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,323 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,324 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,325 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,333 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 47 treesize of output 84
[2018-01-29 23:36:43,333 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:43,459 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,463 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,465 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,471 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 74
[2018-01-29 23:36:43,506 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:43,594 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,595 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,596 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,597 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,598 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,599 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:43,606 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 72
[2018-01-29 23:36:43,606 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:43,682 INFO L267 ElimStorePlain]: Start of recursive call 19: 4 dim-1 vars, End of recursive call: and 4 xjuncts.
[2018-01-29 23:36:43,761 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 4 xjuncts.
[2018-01-29 23:36:43,771 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 47 treesize of output 44
[2018-01-29 23:36:43,775 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,776 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,777 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,780 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 28 treesize of output 50
[2018-01-29 23:36:43,784 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,785 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,786 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,787 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,788 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:43,794 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 0 case distinctions, treesize of input 30 treesize of output 77
[2018-01-29 23:36:43,794 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:43,810 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:43,825 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:43,962 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts.
[2018-01-29 23:36:44,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts.
[2018-01-29 23:36:44,342 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 86 treesize of output 66
[2018-01-29 23:36:44,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:36:44,397 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:44,446 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 52 treesize of output 60
[2018-01-29 23:36:44,449 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 13 treesize of output 16
[2018-01-29 23:36:44,452 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23
[2018-01-29 23:36:44,453 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:44,459 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:44,485 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 51 treesize of output 58
[2018-01-29 23:36:44,488 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,490 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 21 treesize of output 29
[2018-01-29 23:36:44,494 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,495 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,496 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46
[2018-01-29 23:36:44,499 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:44,509 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:44,522 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:44,535 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:44,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59
[2018-01-29 23:36:44,571 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 43 treesize of output 46
[2018-01-29 23:36:44,580 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,593 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 3 case distinctions, treesize of input 42 treesize of output 54
[2018-01-29 23:36:44,594 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:44,645 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,646 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 40 treesize of output 44
[2018-01-29 23:36:44,646 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:44,685 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 3 xjuncts.
[2018-01-29 23:36:44,740 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 51 treesize of output 46
[2018-01-29 23:36:44,747 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,748 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 61
[2018-01-29 23:36:44,787 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,789 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,791 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,795 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 74
[2018-01-29 23:36:44,821 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts.
[2018-01-29 23:36:44,887 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,888 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,889 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,890 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,890 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,891 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:44,896 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 72
[2018-01-29 23:36:44,897 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:44,981 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,982 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,983 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,984 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,984 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,985 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:44,992 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 35 treesize of output 78
[2018-01-29 23:36:44,992 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:45,036 INFO L267 ElimStorePlain]: Start of recursive call 39: 4 dim-1 vars, End of recursive call: and 4 xjuncts.
[2018-01-29 23:36:45,075 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 4 xjuncts.
[2018-01-29 23:36:45,082 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 47 treesize of output 44
[2018-01-29 23:36:45,086 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,087 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,088 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,091 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 28 treesize of output 50
[2018-01-29 23:36:45,094 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,095 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,096 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,096 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,097 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,101 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 0 case distinctions, treesize of input 30 treesize of output 77
[2018-01-29 23:36:45,101 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:45,119 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:45,130 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:45,139 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 46
[2018-01-29 23:36:45,143 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,144 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,144 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,146 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 28 treesize of output 52
[2018-01-29 23:36:45,150 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,151 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,152 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,153 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,154 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,154 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:45,159 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 32 treesize of output 85
[2018-01-29 23:36:45,160 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:45,174 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:45,185 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:45,250 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts.
[2018-01-29 23:36:45,321 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts.
[2018-01-29 23:36:45,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 42 dim-0 vars, and 21 xjuncts.
[2018-01-29 23:36:45,499 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 9 variables, input treesize:194, output treesize:2719
[2018-01-29 23:36:50,159 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 627 DAG size of output 38
[2018-01-29 23:36:50,298 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:50,299 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:50,300 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:50,300 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 16 treesize of output 13
[2018-01-29 23:36:50,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:50,315 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 1 xjuncts.
[2018-01-29 23:36:50,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:69
[2018-01-29 23:36:50,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50
[2018-01-29 23:36:50,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2018-01-29 23:36:50,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:50,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:50,509 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 41 treesize of output 50
[2018-01-29 23:36:50,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2018-01-29 23:36:50,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:50,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:50,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:36:50,532 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:99, output treesize:61
[2018-01-29 23:36:50,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31
[2018-01-29 23:36:50,709 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:50,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-01-29 23:36:50,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:50,717 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:50,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6
[2018-01-29 23:36:50,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:50,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:50,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31
[2018-01-29 23:36:50,736 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:36:50,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6
[2018-01-29 23:36:50,737 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:50,743 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:36:50,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-01-29 23:36:50,743 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:50,746 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:50,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:36:50,752 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:82, output treesize:7
[2018-01-29 23:36:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:36:50,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:36:50,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 44
[2018-01-29 23:36:50,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states
[2018-01-29 23:36:50,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2018-01-29 23:36:50,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1656, Unknown=13, NotChecked=82, Total=1892
[2018-01-29 23:36:50,886 INFO L87 Difference]: Start difference. First operand 226 states and 243 transitions. Second operand 44 states.
[2018-01-29 23:36:51,461 WARN L143 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 55
[2018-01-29 23:36:54,479 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 86 DAG size of output 48
[2018-01-29 23:36:55,859 WARN L146 SmtUtils]: Spent 642ms on a formula simplification. DAG size of input: 90 DAG size of output 76
[2018-01-29 23:36:57,594 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 99 DAG size of output 79
[2018-01-29 23:36:57,830 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 103 DAG size of output 86
[2018-01-29 23:36:59,007 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 104 DAG size of output 84
[2018-01-29 23:37:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:02,054 INFO L93 Difference]: Finished difference Result 409 states and 433 transitions.
[2018-01-29 23:37:02,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2018-01-29 23:37:02,054 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 71
[2018-01-29 23:37:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:02,056 INFO L225 Difference]: With dead ends: 409
[2018-01-29 23:37:02,056 INFO L226 Difference]: Without dead ends: 304
[2018-01-29 23:37:02,058 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=425, Invalid=3928, Unknown=73, NotChecked=130, Total=4556
[2018-01-29 23:37:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states.
[2018-01-29 23:37:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 228.
[2018-01-29 23:37:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states.
[2018-01-29 23:37:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 244 transitions.
[2018-01-29 23:37:02,075 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 244 transitions. Word has length 71
[2018-01-29 23:37:02,075 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:02,075 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 244 transitions.
[2018-01-29 23:37:02,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states.
[2018-01-29 23:37:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 244 transitions.
[2018-01-29 23:37:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2018-01-29 23:37:02,076 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:02,076 INFO L350 BasicCegarLoop]: trace histogram [2, 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, 1]
[2018-01-29 23:37:02,076 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:37:02,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2072688297, now seen corresponding path program 1 times
[2018-01-29 23:37:02,076 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:02,077 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:02,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:02,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:02,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:02,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2018-01-29 23:37:02,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:02,141 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/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-01-29 23:37:02,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:02,201 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2018-01-29 23:37:02,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:02,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7
[2018-01-29 23:37:02,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-29 23:37:02,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-29 23:37:02,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-01-29 23:37:02,324 INFO L87 Difference]: Start difference. First operand 228 states and 244 transitions. Second operand 7 states.
[2018-01-29 23:37:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:02,477 INFO L93 Difference]: Finished difference Result 326 states and 353 transitions.
[2018-01-29 23:37:02,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 23:37:02,478 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77
[2018-01-29 23:37:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:02,479 INFO L225 Difference]: With dead ends: 326
[2018-01-29 23:37:02,479 INFO L226 Difference]: Without dead ends: 265
[2018-01-29 23:37:02,479 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2018-01-29 23:37:02,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states.
[2018-01-29 23:37:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 242.
[2018-01-29 23:37:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states.
[2018-01-29 23:37:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 260 transitions.
[2018-01-29 23:37:02,495 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 260 transitions. Word has length 77
[2018-01-29 23:37:02,495 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:02,495 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 260 transitions.
[2018-01-29 23:37:02,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-29 23:37:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 260 transitions.
[2018-01-29 23:37:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2018-01-29 23:37:02,496 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:02,496 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1]
[2018-01-29 23:37:02,496 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:37:02,496 INFO L82 PathProgramCache]: Analyzing trace with hash -581308912, now seen corresponding path program 1 times
[2018-01-29 23:37:02,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:02,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:02,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:02,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:02,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:02,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-01-29 23:37:03,588 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:03,588 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:03,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:03,641 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:03,824 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 12 treesize of output 11
[2018-01-29 23:37:03,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:03,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:37:03,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:14
[2018-01-29 23:37:04,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-01-29 23:37:04,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:37:04,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:04,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:04,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:37:04,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31
[2018-01-29 23:37:04,089 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 23 treesize of output 35
[2018-01-29 23:37:04,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23
[2018-01-29 23:37:04,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:04,114 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 21 treesize of output 30
[2018-01-29 23:37:04,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-01-29 23:37:04,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:37:04,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:37:04,146 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:77
[2018-01-29 23:37:04,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 71
[2018-01-29 23:37:04,251 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:04,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 67 treesize of output 82
[2018-01-29 23:37:04,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:04,287 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:04,297 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 3 case distinctions, treesize of input 45 treesize of output 60
[2018-01-29 23:37:04,297 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-01-29 23:37:04,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:37:04,370 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 41 treesize of output 36
[2018-01-29 23:37:04,372 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:04,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27
[2018-01-29 23:37:04,373 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:04,381 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:04,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-01-29 23:37:04,416 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:116, output treesize:141
[2018-01-29 23:37:05,786 WARN L143 SmtUtils]: Spent 1305ms on a formula simplification that was a NOOP. DAG size: 61
[2018-01-29 23:37:05,796 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:05,797 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:05,797 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 72 treesize of output 66
[2018-01-29 23:37:05,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:05,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:37:05,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:165, output treesize:66
[2018-01-29 23:37:06,008 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:06,009 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:06,010 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:06,010 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 28 treesize of output 52
[2018-01-29 23:37:06,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:06,027 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 1 xjuncts.
[2018-01-29 23:37:06,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:85
[2018-01-29 23:37:06,169 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 77 treesize of output 75
[2018-01-29 23:37:06,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2018-01-29 23:37:06,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:06,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:06,193 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-01-29 23:37:06,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:85
[2018-01-29 23:37:06,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73
[2018-01-29 23:37:06,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:37:06,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:06,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:06,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:37:06,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85
[2018-01-29 23:37:06,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73
[2018-01-29 23:37:06,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-01-29 23:37:06,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:06,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:06,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:37:06,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94
[2018-01-29 23:37:06,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65
[2018-01-29 23:37:06,681 INFO L682 Elim1Store]: detected equality via solver
[2018-01-29 23:37:06,682 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 33 treesize of output 21
[2018-01-29 23:37:06,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:06,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2018-01-29 23:37:06,693 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:06,701 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:06,702 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 15 treesize of output 8
[2018-01-29 23:37:06,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:06,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:06,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:37:06,718 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28
[2018-01-29 23:37:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 16 refuted. 19 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-01-29 23:37:06,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:06,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 46
[2018-01-29 23:37:06,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states
[2018-01-29 23:37:06,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2018-01-29 23:37:06,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1988, Unknown=26, NotChecked=0, Total=2162
[2018-01-29 23:37:06,827 INFO L87 Difference]: Start difference. First operand 242 states and 260 transitions. Second operand 47 states.
[2018-01-29 23:37:07,950 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 118 DAG size of output 72
[2018-01-29 23:37:09,263 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 90 DAG size of output 39
[2018-01-29 23:37:09,496 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 141 DAG size of output 52
[2018-01-29 23:37:09,681 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 121 DAG size of output 61
[2018-01-29 23:37:09,859 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 130 DAG size of output 64
[2018-01-29 23:37:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:11,472 INFO L93 Difference]: Finished difference Result 391 states and 416 transitions.
[2018-01-29 23:37:11,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2018-01-29 23:37:11,473 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98
[2018-01-29 23:37:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:11,475 INFO L225 Difference]: With dead ends: 391
[2018-01-29 23:37:11,475 INFO L226 Difference]: Without dead ends: 390
[2018-01-29 23:37:11,477 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=752, Invalid=5379, Unknown=31, NotChecked=0, Total=6162
[2018-01-29 23:37:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states.
[2018-01-29 23:37:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 275.
[2018-01-29 23:37:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states.
[2018-01-29 23:37:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 294 transitions.
[2018-01-29 23:37:11,494 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 294 transitions. Word has length 98
[2018-01-29 23:37:11,494 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:11,494 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 294 transitions.
[2018-01-29 23:37:11,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states.
[2018-01-29 23:37:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 294 transitions.
[2018-01-29 23:37:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2018-01-29 23:37:11,495 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:11,495 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1]
[2018-01-29 23:37:11,496 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]===
[2018-01-29 23:37:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash -581308911, now seen corresponding path program 1 times
[2018-01-29 23:37:11,496 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:11,496 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:11,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:11,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:11,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:11,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-01-29 23:37:12,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:12,589 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/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-01-29 23:37:12,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:12,644 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:12,762 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.AssertionError: var is still there: |v_old(#valid)_AFTER_CALL_20| term size 14
at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452)
at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221)
at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247)
at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199)
at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270)
at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.<init>(TraceCheckSpWp.java:160)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(TraceAbstractionRefinementEngine.java:68)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:396)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:115)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134)
at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55)
[2018-01-29 23:37:12,765 INFO L168 Benchmark]: Toolchain (without parser) took 85525.53 ms. Allocated memory was 308.8 MB in the beginning and 688.9 MB in the end (delta: 380.1 MB). Free memory was 268.8 MB in the beginning and 333.4 MB in the end (delta: -64.5 MB). Peak memory consumption was 315.6 MB. Max. memory is 5.3 GB.
[2018-01-29 23:37:12,766 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-29 23:37:12,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.06 ms. Allocated memory is still 308.8 MB. Free memory was 267.9 MB in the beginning and 256.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB.
[2018-01-29 23:37:12,766 INFO L168 Benchmark]: Boogie Preprocessor took 45.47 ms. Allocated memory is still 308.8 MB. Free memory was 256.8 MB in the beginning and 254.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-01-29 23:37:12,766 INFO L168 Benchmark]: RCFGBuilder took 613.41 ms. Allocated memory is still 308.8 MB. Free memory was 254.8 MB in the beginning and 217.1 MB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 5.3 GB.
[2018-01-29 23:37:12,767 INFO L168 Benchmark]: TraceAbstraction took 84634.96 ms. Allocated memory was 308.8 MB in the beginning and 688.9 MB in the end (delta: 380.1 MB). Free memory was 217.1 MB in the beginning and 333.4 MB in the end (delta: -116.3 MB). Peak memory consumption was 263.9 MB. Max. memory is 5.3 GB.
[2018-01-29 23:37:12,768 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.13 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 225.06 ms. Allocated memory is still 308.8 MB. Free memory was 267.9 MB in the beginning and 256.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 45.47 ms. Allocated memory is still 308.8 MB. Free memory was 256.8 MB in the beginning and 254.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 613.41 ms. Allocated memory is still 308.8 MB. Free memory was 254.8 MB in the beginning and 217.1 MB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 84634.96 ms. Allocated memory was 308.8 MB in the beginning and 688.9 MB in the end (delta: 380.1 MB). Free memory was 217.1 MB in the beginning and 333.4 MB in the end (delta: -116.3 MB). Peak memory consumption was 263.9 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- ExceptionOrErrorResult: AssertionError: var is still there: |v_old(#valid)_AFTER_CALL_20| term size 14
de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#valid)_AFTER_CALL_20| term size 14: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-37-12-775.csv
Received shutdown request...