java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-a74eeac-m
[2018-02-02 19:38:24,803 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 19:38:24,804 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 19:38:24,816 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 19:38:24,816 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 19:38:24,817 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 19:38:24,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 19:38:24,818 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 19:38:24,820 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 19:38:24,821 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 19:38:24,821 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 19:38:24,822 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 19:38:24,823 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 19:38:24,824 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 19:38:24,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 19:38:24,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 19:38:24,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 19:38:24,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 19:38:24,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 19:38:24,832 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 19:38:24,834 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 19:38:24,834 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 19:38:24,834 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 19:38:24,835 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 19:38:24,836 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 19:38:24,837 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 19:38:24,837 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 19:38:24,838 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 19:38:24,838 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 19:38:24,838 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 19:38:24,839 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 19:38:24,839 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf
[2018-02-02 19:38:24,849 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 19:38:24,849 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 19:38:24,850 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 19:38:24,850 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 19:38:24,850 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 19:38:24,851 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 19:38:24,851 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 19:38:24,851 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 19:38:24,851 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 19:38:24,851 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 19:38:24,851 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 19:38:24,852 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 19:38:24,852 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 19:38:24,852 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 19:38:24,852 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 19:38:24,852 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 19:38:24,852 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 19:38:24,852 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 19:38:24,853 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 19:38:24,853 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 19:38:24,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 19:38:24,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 19:38:24,853 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-02-02 19:38:24,853 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-02-02 19:38:24,853 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-02-02 19:38:24,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 19:38:24,892 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 19:38:24,895 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 19:38:24,896 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 19:38:24,897 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 19:38:24,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i
[2018-02-02 19:38:25,066 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 19:38:25,067 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 19:38:25,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 19:38:25,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 19:38:25,072 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 19:38:25,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:38:25" (1/1) ...
[2018-02-02 19:38:25,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392fc1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:38:25, skipping insertion in model container
[2018-02-02 19:38:25,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:38:25" (1/1) ...
[2018-02-02 19:38:25,086 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 19:38:25,117 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 19:38:25,207 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 19:38:25,229 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 19:38:25,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:38:25 WrapperNode
[2018-02-02 19:38:25,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 19:38:25,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 19:38:25,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 19:38:25,239 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 19:38:25,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:38:25" (1/1) ...
[2018-02-02 19:38:25,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:38:25" (1/1) ...
[2018-02-02 19:38:25,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:38:25" (1/1) ...
[2018-02-02 19:38:25,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:38:25" (1/1) ...
[2018-02-02 19:38:25,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:38:25" (1/1) ...
[2018-02-02 19:38:25,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:38:25" (1/1) ...
[2018-02-02 19:38:25,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:38:25" (1/1) ...
[2018-02-02 19:38:25,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 19:38:25,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 19:38:25,271 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 19:38:25,271 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 19:38:25,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:38:25" (1/1) ...
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 19:38:25,310 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 19:38:25,310 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 19:38:25,310 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 19:38:25,310 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-02 19:38:25,310 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-02 19:38:25,310 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-02 19:38:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-02 19:38:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 19:38:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 19:38:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 19:38:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-02 19:38:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-02-02 19:38:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-02 19:38:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2018-02-02 19:38:25,311 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 19:38:25,312 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 19:38:25,312 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 19:38:25,704 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 19:38:25,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:38:25 BoogieIcfgContainer
[2018-02-02 19:38:25,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 19:38:25,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 19:38:25,705 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 19:38:25,709 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 19:38:25,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:38:25" (1/3) ...
[2018-02-02 19:38:25,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181be46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:38:25, skipping insertion in model container
[2018-02-02 19:38:25,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:38:25" (2/3) ...
[2018-02-02 19:38:25,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181be46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:38:25, skipping insertion in model container
[2018-02-02 19:38:25,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:38:25" (3/3) ...
[2018-02-02 19:38:25,711 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-sorted_true-unreach-call_true-valid-memsafety.i
[2018-02-02 19:38:25,718 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-02-02 19:38:25,727 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations.
[2018-02-02 19:38:25,761 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 19:38:25,762 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 19:38:25,762 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-02-02 19:38:25,762 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-02-02 19:38:25,762 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 19:38:25,762 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 19:38:25,762 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 19:38:25,763 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 19:38:25,763 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 19:38:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states.
[2018-02-02 19:38:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-02-02 19:38:25,785 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:25,786 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:25,786 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:25,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1253687945, now seen corresponding path program 1 times
[2018-02-02 19:38:25,792 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:25,793 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:25,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:25,838 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:25,838 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:25,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:25,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:25,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 19:38:25,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 19:38:25,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 19:38:25,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 19:38:25,943 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 4 states.
[2018-02-02 19:38:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:26,174 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions.
[2018-02-02 19:38:26,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 19:38:26,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8
[2018-02-02 19:38:26,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:26,184 INFO L225 Difference]: With dead ends: 193
[2018-02-02 19:38:26,184 INFO L226 Difference]: Without dead ends: 189
[2018-02-02 19:38:26,185 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 19:38:26,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states.
[2018-02-02 19:38:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177.
[2018-02-02 19:38:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states.
[2018-02-02 19:38:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions.
[2018-02-02 19:38:26,217 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 8
[2018-02-02 19:38:26,217 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:26,217 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions.
[2018-02-02 19:38:26,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 19:38:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions.
[2018-02-02 19:38:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-02-02 19:38:26,217 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:26,217 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:26,218 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1253687944, now seen corresponding path program 1 times
[2018-02-02 19:38:26,218 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:26,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:26,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:26,219 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:26,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:26,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:26,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:26,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 19:38:26,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 19:38:26,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 19:38:26,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 19:38:26,273 INFO L87 Difference]: Start difference. First operand 177 states and 188 transitions. Second operand 4 states.
[2018-02-02 19:38:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:26,425 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions.
[2018-02-02 19:38:26,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 19:38:26,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8
[2018-02-02 19:38:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:26,427 INFO L225 Difference]: With dead ends: 179
[2018-02-02 19:38:26,427 INFO L226 Difference]: Without dead ends: 179
[2018-02-02 19:38:26,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 19:38:26,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states.
[2018-02-02 19:38:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174.
[2018-02-02 19:38:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states.
[2018-02-02 19:38:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions.
[2018-02-02 19:38:26,438 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 8
[2018-02-02 19:38:26,439 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:26,439 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions.
[2018-02-02 19:38:26,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 19:38:26,439 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions.
[2018-02-02 19:38:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-02 19:38:26,440 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:26,440 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:26,440 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2004672772, now seen corresponding path program 1 times
[2018-02-02 19:38:26,440 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:26,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:26,441 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:26,441 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:26,442 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:26,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:26,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:26,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:26,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 19:38:26,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 19:38:26,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 19:38:26,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 19:38:26,512 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand 4 states.
[2018-02-02 19:38:26,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:26,630 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions.
[2018-02-02 19:38:26,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 19:38:26,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2018-02-02 19:38:26,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:26,631 INFO L225 Difference]: With dead ends: 182
[2018-02-02 19:38:26,631 INFO L226 Difference]: Without dead ends: 182
[2018-02-02 19:38:26,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 19:38:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states.
[2018-02-02 19:38:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172.
[2018-02-02 19:38:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states.
[2018-02-02 19:38:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions.
[2018-02-02 19:38:26,638 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 16
[2018-02-02 19:38:26,638 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:26,638 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions.
[2018-02-02 19:38:26,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 19:38:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions.
[2018-02-02 19:38:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-02 19:38:26,639 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:26,639 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:26,639 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:26,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2004672773, now seen corresponding path program 1 times
[2018-02-02 19:38:26,640 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:26,640 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:26,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:26,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:26,641 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:26,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:26,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:26,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 19:38:26,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 19:38:26,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 19:38:26,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-02 19:38:26,734 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand 7 states.
[2018-02-02 19:38:27,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:27,041 INFO L93 Difference]: Finished difference Result 263 states and 287 transitions.
[2018-02-02 19:38:27,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 19:38:27,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2018-02-02 19:38:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:27,042 INFO L225 Difference]: With dead ends: 263
[2018-02-02 19:38:27,042 INFO L226 Difference]: Without dead ends: 263
[2018-02-02 19:38:27,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90
[2018-02-02 19:38:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states.
[2018-02-02 19:38:27,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 233.
[2018-02-02 19:38:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states.
[2018-02-02 19:38:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 272 transitions.
[2018-02-02 19:38:27,051 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 272 transitions. Word has length 16
[2018-02-02 19:38:27,051 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:27,052 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 272 transitions.
[2018-02-02 19:38:27,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 19:38:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 272 transitions.
[2018-02-02 19:38:27,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-02 19:38:27,052 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:27,052 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:27,052 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:27,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1949782104, now seen corresponding path program 1 times
[2018-02-02 19:38:27,053 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:27,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:27,054 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:27,054 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:27,054 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:27,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:27,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:27,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 19:38:27,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 19:38:27,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 19:38:27,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 19:38:27,116 INFO L87 Difference]: Start difference. First operand 233 states and 272 transitions. Second operand 5 states.
[2018-02-02 19:38:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:27,325 INFO L93 Difference]: Finished difference Result 420 states and 491 transitions.
[2018-02-02 19:38:27,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 19:38:27,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2018-02-02 19:38:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:27,329 INFO L225 Difference]: With dead ends: 420
[2018-02-02 19:38:27,329 INFO L226 Difference]: Without dead ends: 420
[2018-02-02 19:38:27,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2018-02-02 19:38:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states.
[2018-02-02 19:38:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 232.
[2018-02-02 19:38:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states.
[2018-02-02 19:38:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 270 transitions.
[2018-02-02 19:38:27,337 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 270 transitions. Word has length 18
[2018-02-02 19:38:27,338 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:27,338 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 270 transitions.
[2018-02-02 19:38:27,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 19:38:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 270 transitions.
[2018-02-02 19:38:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-02 19:38:27,338 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:27,338 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:27,338 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:27,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1949782105, now seen corresponding path program 1 times
[2018-02-02 19:38:27,338 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:27,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:27,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:27,339 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:27,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:27,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:27,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:27,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 19:38:27,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 19:38:27,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 19:38:27,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 19:38:27,382 INFO L87 Difference]: Start difference. First operand 232 states and 270 transitions. Second operand 5 states.
[2018-02-02 19:38:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:27,612 INFO L93 Difference]: Finished difference Result 410 states and 479 transitions.
[2018-02-02 19:38:27,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 19:38:27,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2018-02-02 19:38:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:27,614 INFO L225 Difference]: With dead ends: 410
[2018-02-02 19:38:27,614 INFO L226 Difference]: Without dead ends: 410
[2018-02-02 19:38:27,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-02-02 19:38:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states.
[2018-02-02 19:38:27,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 231.
[2018-02-02 19:38:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states.
[2018-02-02 19:38:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 268 transitions.
[2018-02-02 19:38:27,624 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 268 transitions. Word has length 18
[2018-02-02 19:38:27,625 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:27,625 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 268 transitions.
[2018-02-02 19:38:27,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 19:38:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 268 transitions.
[2018-02-02 19:38:27,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-02-02 19:38:27,626 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:27,626 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:27,626 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:27,626 INFO L82 PathProgramCache]: Analyzing trace with hash 319549737, now seen corresponding path program 1 times
[2018-02-02 19:38:27,626 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:27,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:27,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:27,627 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:27,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:27,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:27,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:27,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-02-02 19:38:27,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 19:38:27,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 19:38:27,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2018-02-02 19:38:27,718 INFO L87 Difference]: Start difference. First operand 231 states and 268 transitions. Second operand 9 states.
[2018-02-02 19:38:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:28,166 INFO L93 Difference]: Finished difference Result 236 states and 270 transitions.
[2018-02-02 19:38:28,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 19:38:28,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22
[2018-02-02 19:38:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:28,167 INFO L225 Difference]: With dead ends: 236
[2018-02-02 19:38:28,168 INFO L226 Difference]: Without dead ends: 236
[2018-02-02 19:38:28,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182
[2018-02-02 19:38:28,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states.
[2018-02-02 19:38:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 230.
[2018-02-02 19:38:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states.
[2018-02-02 19:38:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 267 transitions.
[2018-02-02 19:38:28,172 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 267 transitions. Word has length 22
[2018-02-02 19:38:28,176 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:28,176 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 267 transitions.
[2018-02-02 19:38:28,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 19:38:28,177 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 267 transitions.
[2018-02-02 19:38:28,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-02-02 19:38:28,177 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:28,177 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:28,178 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:28,178 INFO L82 PathProgramCache]: Analyzing trace with hash 319549738, now seen corresponding path program 1 times
[2018-02-02 19:38:28,178 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:28,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:28,179 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:28,179 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:28,179 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:28,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:28,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:28,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-02-02 19:38:28,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 19:38:28,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 19:38:28,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-02-02 19:38:28,311 INFO L87 Difference]: Start difference. First operand 230 states and 267 transitions. Second operand 10 states.
[2018-02-02 19:38:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:28,801 INFO L93 Difference]: Finished difference Result 232 states and 266 transitions.
[2018-02-02 19:38:28,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-02 19:38:28,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22
[2018-02-02 19:38:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:28,802 INFO L225 Difference]: With dead ends: 232
[2018-02-02 19:38:28,802 INFO L226 Difference]: Without dead ends: 232
[2018-02-02 19:38:28,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420
[2018-02-02 19:38:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states.
[2018-02-02 19:38:28,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 215.
[2018-02-02 19:38:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states.
[2018-02-02 19:38:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 251 transitions.
[2018-02-02 19:38:28,805 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 251 transitions. Word has length 22
[2018-02-02 19:38:28,805 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:28,805 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 251 transitions.
[2018-02-02 19:38:28,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 19:38:28,805 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 251 transitions.
[2018-02-02 19:38:28,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-02-02 19:38:28,806 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:28,806 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:28,806 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:28,806 INFO L82 PathProgramCache]: Analyzing trace with hash -308912237, now seen corresponding path program 1 times
[2018-02-02 19:38:28,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:28,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:28,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:28,807 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:28,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:28,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:28,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:28,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 19:38:28,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 19:38:28,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 19:38:28,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 19:38:28,825 INFO L87 Difference]: Start difference. First operand 215 states and 251 transitions. Second operand 3 states.
[2018-02-02 19:38:28,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:28,839 INFO L93 Difference]: Finished difference Result 253 states and 292 transitions.
[2018-02-02 19:38:28,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 19:38:28,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25
[2018-02-02 19:38:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:28,840 INFO L225 Difference]: With dead ends: 253
[2018-02-02 19:38:28,840 INFO L226 Difference]: Without dead ends: 253
[2018-02-02 19:38:28,840 INFO L554 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-02-02 19:38:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states.
[2018-02-02 19:38:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 229.
[2018-02-02 19:38:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states.
[2018-02-02 19:38:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 266 transitions.
[2018-02-02 19:38:28,843 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 266 transitions. Word has length 25
[2018-02-02 19:38:28,844 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:28,844 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 266 transitions.
[2018-02-02 19:38:28,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 19:38:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 266 transitions.
[2018-02-02 19:38:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2018-02-02 19:38:28,845 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:28,845 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:28,845 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:28,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1335704755, now seen corresponding path program 1 times
[2018-02-02 19:38:28,846 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:28,846 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:28,846 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:28,849 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:28,849 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:28,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:29,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 19:38:29,278 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 19:38:29,284 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:29,314 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 19:38:29,388 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:29,389 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:29,395 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-02-02 19:38:29,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:29,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:29,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21
[2018-02-02 19:38:29,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:38:29,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:38:29,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:29,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:29,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:29,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29
[2018-02-02 19:38:29,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43
[2018-02-02 19:38:29,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:29,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:29,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:29,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:29,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42
[2018-02-02 19:38:29,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44
[2018-02-02 19:38:29,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 19:38:29,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:29,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:29,735 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-02-02 19:38:29,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:76
[2018-02-02 19:38:29,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50
[2018-02-02 19:38:29,797 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:29,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18
[2018-02-02 19:38:29,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:29,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:29,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:29,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34
[2018-02-02 19:38:29,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24
[2018-02-02 19:38:29,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10
[2018-02-02 19:38:29,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:29,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 19:38:29,921 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:29,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:29,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:29,928 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15
[2018-02-02 19:38:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:29,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 19:38:29,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 31
[2018-02-02 19:38:29,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states
[2018-02-02 19:38:29,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2018-02-02 19:38:29,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992
[2018-02-02 19:38:29,979 INFO L87 Difference]: Start difference. First operand 229 states and 266 transitions. Second operand 32 states.
[2018-02-02 19:38:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:32,287 INFO L93 Difference]: Finished difference Result 420 states and 467 transitions.
[2018-02-02 19:38:32,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2018-02-02 19:38:32,287 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40
[2018-02-02 19:38:32,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:32,289 INFO L225 Difference]: With dead ends: 420
[2018-02-02 19:38:32,289 INFO L226 Difference]: Without dead ends: 420
[2018-02-02 19:38:32,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830
[2018-02-02 19:38:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states.
[2018-02-02 19:38:32,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 258.
[2018-02-02 19:38:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states.
[2018-02-02 19:38:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 300 transitions.
[2018-02-02 19:38:32,296 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 300 transitions. Word has length 40
[2018-02-02 19:38:32,297 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:32,297 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 300 transitions.
[2018-02-02 19:38:32,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states.
[2018-02-02 19:38:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 300 transitions.
[2018-02-02 19:38:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2018-02-02 19:38:32,298 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:32,298 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:32,298 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:32,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1335704754, now seen corresponding path program 1 times
[2018-02-02 19:38:32,298 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:32,299 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:32,299 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:32,299 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:32,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:32,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:32,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 19:38:32,711 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 19:38:32,726 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:32,748 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 19:38:32,790 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:32,791 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:32,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 19:38:32,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:32,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-02-02 19:38:32,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:32,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:32,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19
[2018-02-02 19:38:32,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:38:32,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:38:32,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:32,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:32,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:38:32,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:38:32,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:32,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:32,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:32,858 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31
[2018-02-02 19:38:32,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-02-02 19:38:32,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:32,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:32,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:32,931 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 52 treesize of output 56
[2018-02-02 19:38:32,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:32,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:32,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:32,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:32,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57
[2018-02-02 19:38:33,032 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 32 treesize of output 38
[2018-02-02 19:38:33,040 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 20 treesize of output 31
[2018-02-02 19:38:33,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:33,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:33,083 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 80 treesize of output 75
[2018-02-02 19:38:33,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 19:38:33,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:33,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:33,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67
[2018-02-02 19:38:33,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 0 case distinctions, treesize of input 16 treesize of output 13
[2018-02-02 19:38:33,114 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:33,132 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:33,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 19:38:33,154 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:80, output treesize:115
[2018-02-02 19:38:33,220 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 50 treesize of output 45
[2018-02-02 19:38:33,223 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:33,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18
[2018-02-02 19:38:33,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:33,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:33,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61
[2018-02-02 19:38:33,252 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:33,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18
[2018-02-02 19:38:33,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:33,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:33,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:33,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47
[2018-02-02 19:38:33,362 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 47 treesize of output 33
[2018-02-02 19:38:33,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 19:38:33,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:33,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17
[2018-02-02 19:38:33,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:33,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:33,386 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 22 treesize of output 20
[2018-02-02 19:38:33,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 19:38:33,388 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:33,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-02-02 19:38:33,392 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:33,393 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:33,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:33,397 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9
[2018-02-02 19:38:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:33,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 19:38:33,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 31
[2018-02-02 19:38:33,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states
[2018-02-02 19:38:33,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2018-02-02 19:38:33,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992
[2018-02-02 19:38:33,448 INFO L87 Difference]: Start difference. First operand 258 states and 300 transitions. Second operand 32 states.
[2018-02-02 19:38:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:35,508 INFO L93 Difference]: Finished difference Result 403 states and 447 transitions.
[2018-02-02 19:38:35,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-02-02 19:38:35,508 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40
[2018-02-02 19:38:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:35,509 INFO L225 Difference]: With dead ends: 403
[2018-02-02 19:38:35,509 INFO L226 Difference]: Without dead ends: 403
[2018-02-02 19:38:35,510 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=727, Invalid=3179, Unknown=0, NotChecked=0, Total=3906
[2018-02-02 19:38:35,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states.
[2018-02-02 19:38:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 258.
[2018-02-02 19:38:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states.
[2018-02-02 19:38:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 299 transitions.
[2018-02-02 19:38:35,513 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 299 transitions. Word has length 40
[2018-02-02 19:38:35,513 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:35,513 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 299 transitions.
[2018-02-02 19:38:35,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states.
[2018-02-02 19:38:35,513 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 299 transitions.
[2018-02-02 19:38:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-02-02 19:38:35,514 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:35,514 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:35,514 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:35,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1162671937, now seen corresponding path program 1 times
[2018-02-02 19:38:35,514 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:35,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:35,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:35,515 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:35,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:35,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 19:38:35,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:35,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 19:38:35,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 19:38:35,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 19:38:35,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 19:38:35,533 INFO L87 Difference]: Start difference. First operand 258 states and 299 transitions. Second operand 3 states.
[2018-02-02 19:38:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:35,537 INFO L93 Difference]: Finished difference Result 260 states and 301 transitions.
[2018-02-02 19:38:35,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 19:38:35,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43
[2018-02-02 19:38:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:35,538 INFO L225 Difference]: With dead ends: 260
[2018-02-02 19:38:35,539 INFO L226 Difference]: Without dead ends: 260
[2018-02-02 19:38:35,539 INFO L554 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-02-02 19:38:35,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states.
[2018-02-02 19:38:35,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260.
[2018-02-02 19:38:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states.
[2018-02-02 19:38:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 301 transitions.
[2018-02-02 19:38:35,542 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 301 transitions. Word has length 43
[2018-02-02 19:38:35,542 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:35,542 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 301 transitions.
[2018-02-02 19:38:35,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 19:38:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 301 transitions.
[2018-02-02 19:38:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2018-02-02 19:38:35,544 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:35,544 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:35,544 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:35,544 INFO L82 PathProgramCache]: Analyzing trace with hash 619398842, now seen corresponding path program 1 times
[2018-02-02 19:38:35,544 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:35,544 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:35,545 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:35,545 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:35,545 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:35,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 19:38:35,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:35,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 19:38:35,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 19:38:35,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 19:38:35,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 19:38:35,592 INFO L87 Difference]: Start difference. First operand 260 states and 301 transitions. Second operand 6 states.
[2018-02-02 19:38:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:35,805 INFO L93 Difference]: Finished difference Result 290 states and 337 transitions.
[2018-02-02 19:38:35,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 19:38:35,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46
[2018-02-02 19:38:35,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:35,806 INFO L225 Difference]: With dead ends: 290
[2018-02-02 19:38:35,806 INFO L226 Difference]: Without dead ends: 290
[2018-02-02 19:38:35,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2018-02-02 19:38:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states.
[2018-02-02 19:38:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 259.
[2018-02-02 19:38:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states.
[2018-02-02 19:38:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 300 transitions.
[2018-02-02 19:38:35,810 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 300 transitions. Word has length 46
[2018-02-02 19:38:35,810 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:35,810 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 300 transitions.
[2018-02-02 19:38:35,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 19:38:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 300 transitions.
[2018-02-02 19:38:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2018-02-02 19:38:35,811 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:35,811 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:35,811 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:35,812 INFO L82 PathProgramCache]: Analyzing trace with hash 619398843, now seen corresponding path program 1 times
[2018-02-02 19:38:35,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:35,812 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:35,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:35,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:35,813 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:35,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:36,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 19:38:36,135 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 19:38:36,139 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:36,158 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 19:38:36,182 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:36,182 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:36,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 19:38:36,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14
[2018-02-02 19:38:36,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:38:36,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:38:36,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:38:36,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:38:36,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22
[2018-02-02 19:38:36,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-02-02 19:38:36,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 14 treesize of output 13
[2018-02-02 19:38:36,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,262 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 43 treesize of output 47
[2018-02-02 19:38:36,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 14 treesize of output 13
[2018-02-02 19:38:36,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:36,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48
[2018-02-02 19:38:36,298 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 42 treesize of output 30
[2018-02-02 19:38:36,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14
[2018-02-02 19:38:36,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2018-02-02 19:38:36,309 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:36,316 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:21
[2018-02-02 19:38:36,359 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 28 treesize of output 27
[2018-02-02 19:38:36,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 19:38:36,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:36,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:36,382 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-02-02 19:38:36,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:48
[2018-02-02 19:38:36,421 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 34 treesize of output 33
[2018-02-02 19:38:36,423 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:36,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14
[2018-02-02 19:38:36,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:36,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19
[2018-02-02 19:38:36,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19
[2018-02-02 19:38:36,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2018-02-02 19:38:36,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,539 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 33 treesize of output 29
[2018-02-02 19:38:36,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11
[2018-02-02 19:38:36,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 19:38:36,552 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:36,556 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:48, output treesize:11
[2018-02-02 19:38:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:36,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 19:38:36,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32
[2018-02-02 19:38:36,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states
[2018-02-02 19:38:36,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2018-02-02 19:38:36,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056
[2018-02-02 19:38:36,616 INFO L87 Difference]: Start difference. First operand 259 states and 300 transitions. Second operand 33 states.
[2018-02-02 19:38:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:38,490 INFO L93 Difference]: Finished difference Result 421 states and 466 transitions.
[2018-02-02 19:38:38,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-02-02 19:38:38,491 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 46
[2018-02-02 19:38:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:38,492 INFO L225 Difference]: With dead ends: 421
[2018-02-02 19:38:38,492 INFO L226 Difference]: Without dead ends: 421
[2018-02-02 19:38:38,493 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=659, Invalid=2881, Unknown=0, NotChecked=0, Total=3540
[2018-02-02 19:38:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states.
[2018-02-02 19:38:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 263.
[2018-02-02 19:38:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states.
[2018-02-02 19:38:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 303 transitions.
[2018-02-02 19:38:38,497 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 303 transitions. Word has length 46
[2018-02-02 19:38:38,498 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:38,498 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 303 transitions.
[2018-02-02 19:38:38,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states.
[2018-02-02 19:38:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 303 transitions.
[2018-02-02 19:38:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-02-02 19:38:38,498 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:38,499 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:38,499 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:38,499 INFO L82 PathProgramCache]: Analyzing trace with hash -999570431, now seen corresponding path program 1 times
[2018-02-02 19:38:38,499 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:38,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:38,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:38,500 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:38,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:38,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 19:38:38,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:38,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 19:38:38,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 19:38:38,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 19:38:38,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 19:38:38,541 INFO L87 Difference]: Start difference. First operand 263 states and 303 transitions. Second operand 4 states.
[2018-02-02 19:38:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:38,614 INFO L93 Difference]: Finished difference Result 259 states and 295 transitions.
[2018-02-02 19:38:38,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 19:38:38,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47
[2018-02-02 19:38:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:38,615 INFO L225 Difference]: With dead ends: 259
[2018-02-02 19:38:38,615 INFO L226 Difference]: Without dead ends: 259
[2018-02-02 19:38:38,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 19:38:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states.
[2018-02-02 19:38:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259.
[2018-02-02 19:38:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states.
[2018-02-02 19:38:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 295 transitions.
[2018-02-02 19:38:38,622 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 295 transitions. Word has length 47
[2018-02-02 19:38:38,622 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:38,622 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 295 transitions.
[2018-02-02 19:38:38,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 19:38:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 295 transitions.
[2018-02-02 19:38:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-02-02 19:38:38,623 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:38,623 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:38,623 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:38,623 INFO L82 PathProgramCache]: Analyzing trace with hash -999570430, now seen corresponding path program 1 times
[2018-02-02 19:38:38,623 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:38,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:38,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:38,624 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:38,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:38,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 19:38:38,674 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:38,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 19:38:38,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 19:38:38,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 19:38:38,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 19:38:38,675 INFO L87 Difference]: Start difference. First operand 259 states and 295 transitions. Second operand 4 states.
[2018-02-02 19:38:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:38,763 INFO L93 Difference]: Finished difference Result 255 states and 287 transitions.
[2018-02-02 19:38:38,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 19:38:38,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47
[2018-02-02 19:38:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:38,764 INFO L225 Difference]: With dead ends: 255
[2018-02-02 19:38:38,764 INFO L226 Difference]: Without dead ends: 255
[2018-02-02 19:38:38,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 19:38:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states.
[2018-02-02 19:38:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255.
[2018-02-02 19:38:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states.
[2018-02-02 19:38:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 287 transitions.
[2018-02-02 19:38:38,768 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 287 transitions. Word has length 47
[2018-02-02 19:38:38,768 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:38,768 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 287 transitions.
[2018-02-02 19:38:38,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 19:38:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 287 transitions.
[2018-02-02 19:38:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-02-02 19:38:38,769 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:38,769 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:38,769 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:38,769 INFO L82 PathProgramCache]: Analyzing trace with hash -920924980, now seen corresponding path program 1 times
[2018-02-02 19:38:38,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:38,770 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:38,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:38,770 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:38,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:38,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 19:38:38,811 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:38,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 19:38:38,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 19:38:38,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 19:38:38,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 19:38:38,811 INFO L87 Difference]: Start difference. First operand 255 states and 287 transitions. Second operand 3 states.
[2018-02-02 19:38:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:38,816 INFO L93 Difference]: Finished difference Result 257 states and 289 transitions.
[2018-02-02 19:38:38,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 19:38:38,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48
[2018-02-02 19:38:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:38,817 INFO L225 Difference]: With dead ends: 257
[2018-02-02 19:38:38,818 INFO L226 Difference]: Without dead ends: 257
[2018-02-02 19:38:38,818 INFO L554 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-02-02 19:38:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states.
[2018-02-02 19:38:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257.
[2018-02-02 19:38:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states.
[2018-02-02 19:38:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 289 transitions.
[2018-02-02 19:38:38,821 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 289 transitions. Word has length 48
[2018-02-02 19:38:38,822 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:38,822 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 289 transitions.
[2018-02-02 19:38:38,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 19:38:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 289 transitions.
[2018-02-02 19:38:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-02-02 19:38:38,822 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:38,822 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:38,823 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:38,823 INFO L82 PathProgramCache]: Analyzing trace with hash -978183282, now seen corresponding path program 1 times
[2018-02-02 19:38:38,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:38,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:38,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:38,824 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:38,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:38,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 19:38:38,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:38,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-02 19:38:38,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 19:38:38,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 19:38:38,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2018-02-02 19:38:38,880 INFO L87 Difference]: Start difference. First operand 257 states and 289 transitions. Second operand 7 states.
[2018-02-02 19:38:39,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:39,053 INFO L93 Difference]: Finished difference Result 274 states and 306 transitions.
[2018-02-02 19:38:39,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 19:38:39,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48
[2018-02-02 19:38:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:39,055 INFO L225 Difference]: With dead ends: 274
[2018-02-02 19:38:39,055 INFO L226 Difference]: Without dead ends: 274
[2018-02-02 19:38:39,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110
[2018-02-02 19:38:39,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states.
[2018-02-02 19:38:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 265.
[2018-02-02 19:38:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states.
[2018-02-02 19:38:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 298 transitions.
[2018-02-02 19:38:39,060 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 298 transitions. Word has length 48
[2018-02-02 19:38:39,060 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:39,060 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 298 transitions.
[2018-02-02 19:38:39,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 19:38:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 298 transitions.
[2018-02-02 19:38:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2018-02-02 19:38:39,060 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:39,061 INFO L351 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]
[2018-02-02 19:38:39,061 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:39,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1674441536, now seen corresponding path program 1 times
[2018-02-02 19:38:39,061 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:39,061 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:39,062 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:39,062 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:39,062 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:39,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:39,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 19:38:39,592 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 19:38:39,597 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:39,616 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 19:38:39,659 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:39,660 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:39,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 19:38:39,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:39,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:39,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14
[2018-02-02 19:38:39,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:38:39,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:38:39,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:39,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:39,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:38:39,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:38:39,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:39,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:39,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:39,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22
[2018-02-02 19:38:39,739 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 51 treesize of output 55
[2018-02-02 19:38:39,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:39,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:39,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:39,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-02-02 19:38:39,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:39,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:39,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:39,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:39,765 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48
[2018-02-02 19:38:39,846 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 53 treesize of output 48
[2018-02-02 19:38:39,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31
[2018-02-02 19:38:39,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:39,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:39,892 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 70 treesize of output 83
[2018-02-02 19:38:39,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 51
[2018-02-02 19:38:39,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:39,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:39,916 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 70 treesize of output 65
[2018-02-02 19:38:39,918 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 19:38:39,919 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 20 treesize of output 21
[2018-02-02 19:38:39,919 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:39,926 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:39,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 19:38:39,949 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:151
[2018-02-02 19:38:39,992 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 117 treesize of output 107
[2018-02-02 19:38:39,994 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:39,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30
[2018-02-02 19:38:39,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:40,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:40,011 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 77 treesize of output 72
[2018-02-02 19:38:40,012 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:40,013 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 42 treesize of output 30
[2018-02-02 19:38:40,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:40,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:40,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:40,021 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:124, output treesize:46
[2018-02-02 19:38:40,132 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 69 treesize of output 56
[2018-02-02 19:38:40,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27
[2018-02-02 19:38:40,135 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:40,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15
[2018-02-02 19:38:40,141 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:40,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:40,149 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 37 treesize of output 29
[2018-02-02 19:38:40,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-02-02 19:38:40,151 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:40,154 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 16 treesize of output 7
[2018-02-02 19:38:40,154 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:40,156 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:40,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:40,158 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:7
[2018-02-02 19:38:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:40,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 19:38:40,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17] total 38
[2018-02-02 19:38:40,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states
[2018-02-02 19:38:40,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2018-02-02 19:38:40,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1284, Unknown=2, NotChecked=0, Total=1406
[2018-02-02 19:38:40,191 INFO L87 Difference]: Start difference. First operand 265 states and 298 transitions. Second operand 38 states.
[2018-02-02 19:38:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:42,288 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions.
[2018-02-02 19:38:42,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-02-02 19:38:42,288 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 50
[2018-02-02 19:38:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:42,289 INFO L225 Difference]: With dead ends: 353
[2018-02-02 19:38:42,289 INFO L226 Difference]: Without dead ends: 353
[2018-02-02 19:38:42,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=667, Invalid=3886, Unknown=3, NotChecked=0, Total=4556
[2018-02-02 19:38:42,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states.
[2018-02-02 19:38:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 269.
[2018-02-02 19:38:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states.
[2018-02-02 19:38:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 302 transitions.
[2018-02-02 19:38:42,295 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 302 transitions. Word has length 50
[2018-02-02 19:38:42,295 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:42,295 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 302 transitions.
[2018-02-02 19:38:42,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states.
[2018-02-02 19:38:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 302 transitions.
[2018-02-02 19:38:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-02-02 19:38:42,296 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:42,296 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:42,296 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:42,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1775792203, now seen corresponding path program 1 times
[2018-02-02 19:38:42,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:42,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:42,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:42,297 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:42,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:42,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 19:38:42,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:42,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 19:38:42,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 19:38:42,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 19:38:42,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 19:38:42,344 INFO L87 Difference]: Start difference. First operand 269 states and 302 transitions. Second operand 6 states.
[2018-02-02 19:38:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:42,485 INFO L93 Difference]: Finished difference Result 297 states and 331 transitions.
[2018-02-02 19:38:42,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 19:38:42,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51
[2018-02-02 19:38:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:42,486 INFO L225 Difference]: With dead ends: 297
[2018-02-02 19:38:42,486 INFO L226 Difference]: Without dead ends: 297
[2018-02-02 19:38:42,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2018-02-02 19:38:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states.
[2018-02-02 19:38:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 278.
[2018-02-02 19:38:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states.
[2018-02-02 19:38:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 316 transitions.
[2018-02-02 19:38:42,488 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 316 transitions. Word has length 51
[2018-02-02 19:38:42,488 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:42,488 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 316 transitions.
[2018-02-02 19:38:42,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 19:38:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 316 transitions.
[2018-02-02 19:38:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-02-02 19:38:42,489 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:42,489 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:42,489 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:42,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1775792202, now seen corresponding path program 1 times
[2018-02-02 19:38:42,489 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:42,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:42,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:42,490 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:42,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:42,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 19:38:42,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:38:42,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 19:38:42,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 19:38:42,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 19:38:42,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 19:38:42,532 INFO L87 Difference]: Start difference. First operand 278 states and 316 transitions. Second operand 6 states.
[2018-02-02 19:38:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:42,693 INFO L93 Difference]: Finished difference Result 291 states and 324 transitions.
[2018-02-02 19:38:42,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 19:38:42,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51
[2018-02-02 19:38:42,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:42,694 INFO L225 Difference]: With dead ends: 291
[2018-02-02 19:38:42,694 INFO L226 Difference]: Without dead ends: 291
[2018-02-02 19:38:42,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2018-02-02 19:38:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states.
[2018-02-02 19:38:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 276.
[2018-02-02 19:38:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states.
[2018-02-02 19:38:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 311 transitions.
[2018-02-02 19:38:42,698 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 311 transitions. Word has length 51
[2018-02-02 19:38:42,698 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:42,698 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 311 transitions.
[2018-02-02 19:38:42,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 19:38:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 311 transitions.
[2018-02-02 19:38:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2018-02-02 19:38:42,699 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:42,699 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:42,699 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash -139072943, now seen corresponding path program 1 times
[2018-02-02 19:38:42,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:42,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:42,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:42,700 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:42,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:42,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:42,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 19:38:42,872 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 19:38:42,877 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:42,895 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 19:38:42,908 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:42,909 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:42,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 19:38:42,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:42,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:42,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15
[2018-02-02 19:38:42,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:38:42,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:38:42,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:42,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:42,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:42,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23
[2018-02-02 19:38:42,955 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 38 treesize of output 42
[2018-02-02 19:38:42,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:42,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:42,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:42,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:42,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36
[2018-02-02 19:38:43,012 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43
[2018-02-02 19:38:43,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 19:38:43,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:43,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:43,051 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-02-02 19:38:43,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:64
[2018-02-02 19:38:43,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49
[2018-02-02 19:38:43,079 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:43,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18
[2018-02-02 19:38:43,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:43,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:43,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:43,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28
[2018-02-02 19:38:43,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23
[2018-02-02 19:38:43,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 19:38:43,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:43,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9
[2018-02-02 19:38:43,125 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:43,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:43,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:43,129 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4
[2018-02-02 19:38:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:43,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 19:38:43,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27
[2018-02-02 19:38:43,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-02-02 19:38:43,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-02-02 19:38:43,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702
[2018-02-02 19:38:43,174 INFO L87 Difference]: Start difference. First operand 276 states and 311 transitions. Second operand 27 states.
[2018-02-02 19:38:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:44,670 INFO L93 Difference]: Finished difference Result 373 states and 405 transitions.
[2018-02-02 19:38:44,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states.
[2018-02-02 19:38:44,670 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53
[2018-02-02 19:38:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:44,671 INFO L225 Difference]: With dead ends: 373
[2018-02-02 19:38:44,671 INFO L226 Difference]: Without dead ends: 373
[2018-02-02 19:38:44,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=651, Invalid=4041, Unknown=0, NotChecked=0, Total=4692
[2018-02-02 19:38:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states.
[2018-02-02 19:38:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 291.
[2018-02-02 19:38:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states.
[2018-02-02 19:38:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 324 transitions.
[2018-02-02 19:38:44,676 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 324 transitions. Word has length 53
[2018-02-02 19:38:44,676 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:44,676 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 324 transitions.
[2018-02-02 19:38:44,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-02-02 19:38:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 324 transitions.
[2018-02-02 19:38:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-02-02 19:38:44,677 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:44,677 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:38:44,677 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:44,677 INFO L82 PathProgramCache]: Analyzing trace with hash 334990972, now seen corresponding path program 1 times
[2018-02-02 19:38:44,677 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:44,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:44,678 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:44,678 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:44,678 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:44,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:45,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 19:38:45,045 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 19:38:45,050 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:45,082 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 19:38:45,129 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:45,130 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:45,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 19:38:45,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14
[2018-02-02 19:38:45,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:38:45,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:38:45,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:38:45,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:38:45,179 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,184 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22
[2018-02-02 19:38:45,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-02-02 19:38:45,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:45,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,234 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 43 treesize of output 47
[2018-02-02 19:38:45,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:45,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:45,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48
[2018-02-02 19:38:45,287 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 42 treesize of output 30
[2018-02-02 19:38:45,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14
[2018-02-02 19:38:45,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2018-02-02 19:38:45,292 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:45,297 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:21
[2018-02-02 19:38:45,333 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 28 treesize of output 27
[2018-02-02 19:38:45,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 19:38:45,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:45,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:45,354 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-02-02 19:38:45,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:48
[2018-02-02 19:38:45,384 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 34 treesize of output 33
[2018-02-02 19:38:45,386 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:45,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14
[2018-02-02 19:38:45,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:45,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19
[2018-02-02 19:38:45,454 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 22 treesize of output 20
[2018-02-02 19:38:45,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 19:38:45,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-02-02 19:38:45,459 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:45,462 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3
[2018-02-02 19:38:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:45,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 19:38:45,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 36
[2018-02-02 19:38:45,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states
[2018-02-02 19:38:45,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2018-02-02 19:38:45,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1192, Unknown=0, NotChecked=0, Total=1332
[2018-02-02 19:38:45,532 INFO L87 Difference]: Start difference. First operand 291 states and 324 transitions. Second operand 37 states.
[2018-02-02 19:38:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:48,511 INFO L93 Difference]: Finished difference Result 524 states and 577 transitions.
[2018-02-02 19:38:48,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states.
[2018-02-02 19:38:48,511 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55
[2018-02-02 19:38:48,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:48,512 INFO L225 Difference]: With dead ends: 524
[2018-02-02 19:38:48,512 INFO L226 Difference]: Without dead ends: 524
[2018-02-02 19:38:48,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1445, Invalid=6387, Unknown=0, NotChecked=0, Total=7832
[2018-02-02 19:38:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states.
[2018-02-02 19:38:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 351.
[2018-02-02 19:38:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states.
[2018-02-02 19:38:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 395 transitions.
[2018-02-02 19:38:48,517 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 395 transitions. Word has length 55
[2018-02-02 19:38:48,517 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:48,517 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 395 transitions.
[2018-02-02 19:38:48,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states.
[2018-02-02 19:38:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 395 transitions.
[2018-02-02 19:38:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-02-02 19:38:48,517 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:48,517 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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]
[2018-02-02 19:38:48,517 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:48,518 INFO L82 PathProgramCache]: Analyzing trace with hash -924896173, now seen corresponding path program 2 times
[2018-02-02 19:38:48,518 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:48,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:48,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:48,518 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:38:48,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:48,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:48,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 19:38:48,996 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 19:38:49,001 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 19:38:49,026 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-02-02 19:38:49,026 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 19:38:49,028 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 19:38:49,036 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:49,037 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:49,037 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-02-02 19:38:49,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24
[2018-02-02 19:38:49,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:38:49,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:38:49,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32
[2018-02-02 19:38:49,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43
[2018-02-02 19:38:49,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:49,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:49,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45
[2018-02-02 19:38:49,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44
[2018-02-02 19:38:49,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 19:38:49,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:49,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:49,291 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-02-02 19:38:49,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:82
[2018-02-02 19:38:49,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 43 treesize of output 42
[2018-02-02 19:38:49,352 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:49,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14
[2018-02-02 19:38:49,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36
[2018-02-02 19:38:49,364 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:49,365 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:49,365 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:49,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21
[2018-02-02 19:38:49,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34
[2018-02-02 19:38:49,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33
[2018-02-02 19:38:49,427 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 14 treesize of output 7
[2018-02-02 19:38:49,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40
[2018-02-02 19:38:49,516 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 49 treesize of output 57
[2018-02-02 19:38:49,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:49,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:49,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49
[2018-02-02 19:38:49,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83
[2018-02-02 19:38:49,684 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 20 treesize of output 27
[2018-02-02 19:38:49,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:49,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:49,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts.
[2018-02-02 19:38:49,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:132
[2018-02-02 19:38:49,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 77
[2018-02-02 19:38:49,813 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:49,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22
[2018-02-02 19:38:49,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:49,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:64
[2018-02-02 19:38:49,969 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48
[2018-02-02 19:38:49,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-02-02 19:38:49,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 19:38:49,975 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,978 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 19:38:49,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13
[2018-02-02 19:38:49,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:49,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:5
[2018-02-02 19:38:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:50,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 19:38:50,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 45
[2018-02-02 19:38:50,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states
[2018-02-02 19:38:50,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2018-02-02 19:38:50,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1842, Unknown=0, NotChecked=0, Total=2070
[2018-02-02 19:38:50,033 INFO L87 Difference]: Start difference. First operand 351 states and 395 transitions. Second operand 46 states.
[2018-02-02 19:38:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:38:53,771 INFO L93 Difference]: Finished difference Result 625 states and 700 transitions.
[2018-02-02 19:38:53,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states.
[2018-02-02 19:38:53,772 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 55
[2018-02-02 19:38:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:38:53,773 INFO L225 Difference]: With dead ends: 625
[2018-02-02 19:38:53,773 INFO L226 Difference]: Without dead ends: 625
[2018-02-02 19:38:53,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3110 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1508, Invalid=8997, Unknown=1, NotChecked=0, Total=10506
[2018-02-02 19:38:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states.
[2018-02-02 19:38:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 351.
[2018-02-02 19:38:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states.
[2018-02-02 19:38:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 394 transitions.
[2018-02-02 19:38:53,779 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 394 transitions. Word has length 55
[2018-02-02 19:38:53,779 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:38:53,780 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 394 transitions.
[2018-02-02 19:38:53,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states.
[2018-02-02 19:38:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 394 transitions.
[2018-02-02 19:38:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-02-02 19:38:53,780 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:38:53,780 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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]
[2018-02-02 19:38:53,780 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:38:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash -924896172, now seen corresponding path program 2 times
[2018-02-02 19:38:53,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:38:53,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:38:53,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:53,781 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 19:38:53,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:38:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:38:53,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:38:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:54,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 19:38:54,253 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 19:38:54,259 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 19:38:54,280 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-02-02 19:38:54,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 19:38:54,283 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 19:38:54,339 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:54,339 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:54,339 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-02-02 19:38:54,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27
[2018-02-02 19:38:54,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:38:54,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:38:54,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:38:54,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:38:54,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39
[2018-02-02 19:38:54,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64
[2018-02-02 19:38:54,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:54,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-02-02 19:38:54,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:54,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:54,485 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65
[2018-02-02 19:38:54,616 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 32 treesize of output 38
[2018-02-02 19:38:54,619 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 19:38:54,619 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 20 treesize of output 28
[2018-02-02 19:38:54,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,641 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 73 treesize of output 68
[2018-02-02 19:38:54,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 19:38:54,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:54,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:54,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-02 19:38:54,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:137
[2018-02-02 19:38:54,747 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 38 treesize of output 44
[2018-02-02 19:38:54,750 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:54,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37
[2018-02-02 19:38:54,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,773 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 53
[2018-02-02 19:38:54,775 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:54,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14
[2018-02-02 19:38:54,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,790 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:102, output treesize:64
[2018-02-02 19:38:54,827 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:54,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21
[2018-02-02 19:38:54,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,847 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:54,847 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:54,848 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:54,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21
[2018-02-02 19:38:54,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:71
[2018-02-02 19:38:54,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55
[2018-02-02 19:38:54,912 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 14 treesize of output 7
[2018-02-02 19:38:54,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,934 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 30 treesize of output 36
[2018-02-02 19:38:54,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11
[2018-02-02 19:38:54,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:54,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:65
[2018-02-02 19:38:55,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 98
[2018-02-02 19:38:55,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:55,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-02-02 19:38:55,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:38:55,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:55,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:107, output treesize:87
[2018-02-02 19:38:55,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 107
[2018-02-02 19:38:55,224 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 20 treesize of output 27
[2018-02-02 19:38:55,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:55,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:55,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 98
[2018-02-02 19:38:55,283 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 24 treesize of output 21
[2018-02-02 19:38:55,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,298 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 106
[2018-02-02 19:38:55,308 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 24 treesize of output 39
[2018-02-02 19:38:55,308 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:55,324 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:38:55,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts.
[2018-02-02 19:38:55,361 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:145, output treesize:213
[2018-02-02 19:38:55,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57
[2018-02-02 19:38:55,445 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:55,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 38 treesize of output 22
[2018-02-02 19:38:55,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 99
[2018-02-02 19:38:55,475 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:38:55,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22
[2018-02-02 19:38:55,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:55,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:190, output treesize:104
[2018-02-02 19:38:55,650 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 66
[2018-02-02 19:38:55,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23
[2018-02-02 19:38:55,652 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:55,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 19:38:55,661 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,668 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 19:38:55,669 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 27 treesize of output 19
[2018-02-02 19:38:55,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:55,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20
[2018-02-02 19:38:55,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 19:38:55,686 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,689 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 19:38:55,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2018-02-02 19:38:55,689 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,691 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:38:55,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:38:55,698 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:121, output treesize:21
[2018-02-02 19:38:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:38:55,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 19:38:55,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 45
[2018-02-02 19:38:55,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states
[2018-02-02 19:38:55,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2018-02-02 19:38:55,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1888, Unknown=0, NotChecked=0, Total=2070
[2018-02-02 19:38:55,764 INFO L87 Difference]: Start difference. First operand 351 states and 394 transitions. Second operand 46 states.
[2018-02-02 19:39:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:39:00,109 INFO L93 Difference]: Finished difference Result 624 states and 699 transitions.
[2018-02-02 19:39:00,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states.
[2018-02-02 19:39:00,109 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 55
[2018-02-02 19:39:00,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:39:00,110 INFO L225 Difference]: With dead ends: 624
[2018-02-02 19:39:00,111 INFO L226 Difference]: Without dead ends: 624
[2018-02-02 19:39:00,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1103, Invalid=6907, Unknown=0, NotChecked=0, Total=8010
[2018-02-02 19:39:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states.
[2018-02-02 19:39:00,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 351.
[2018-02-02 19:39:00,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states.
[2018-02-02 19:39:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 393 transitions.
[2018-02-02 19:39:00,115 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 393 transitions. Word has length 55
[2018-02-02 19:39:00,115 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:39:00,115 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 393 transitions.
[2018-02-02 19:39:00,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states.
[2018-02-02 19:39:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 393 transitions.
[2018-02-02 19:39:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-02-02 19:39:00,116 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:39:00,116 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:39:00,116 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:39:00,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1561720458, now seen corresponding path program 1 times
[2018-02-02 19:39:00,116 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:39:00,116 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:39:00,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:39:00,117 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 19:39:00,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:39:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:39:00,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:39:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 19:39:00,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 19:39:00,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-02 19:39:00,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 19:39:00,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 19:39:00,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2018-02-02 19:39:00,181 INFO L87 Difference]: Start difference. First operand 351 states and 393 transitions. Second operand 7 states.
[2018-02-02 19:39:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:39:00,340 INFO L93 Difference]: Finished difference Result 359 states and 396 transitions.
[2018-02-02 19:39:00,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 19:39:00,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56
[2018-02-02 19:39:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:39:00,341 INFO L225 Difference]: With dead ends: 359
[2018-02-02 19:39:00,341 INFO L226 Difference]: Without dead ends: 359
[2018-02-02 19:39:00,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110
[2018-02-02 19:39:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states.
[2018-02-02 19:39:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 351.
[2018-02-02 19:39:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states.
[2018-02-02 19:39:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 390 transitions.
[2018-02-02 19:39:00,344 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 390 transitions. Word has length 56
[2018-02-02 19:39:00,344 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:39:00,344 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 390 transitions.
[2018-02-02 19:39:00,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 19:39:00,345 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 390 transitions.
[2018-02-02 19:39:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-02-02 19:39:00,345 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:39:00,345 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:39:00,345 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:39:00,346 INFO L82 PathProgramCache]: Analyzing trace with hash 860655880, now seen corresponding path program 1 times
[2018-02-02 19:39:00,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:39:00,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:39:00,346 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:39:00,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:39:00,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:39:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:39:00,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:39:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:39:00,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 19:39:00,498 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 19:39:00,503 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:39:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:39:00,524 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 19:39:00,560 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:00,560 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:00,561 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:00,561 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 26 treesize of output 38
[2018-02-02 19:39:00,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:00,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:00,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:32
[2018-02-02 19:39:00,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38
[2018-02-02 19:39:00,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1
[2018-02-02 19:39:00,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:00,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:00,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:00,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:32
[2018-02-02 19:39:00,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-02-02 19:39:00,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:39:00,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:00,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:00,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:00,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39
[2018-02-02 19:39:00,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37
[2018-02-02 19:39:00,641 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:00,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 19:39:00,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:00,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:00,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:00,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48
[2018-02-02 19:39:00,673 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 71 treesize of output 48
[2018-02-02 19:39:00,675 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:00,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16
[2018-02-02 19:39:00,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:00,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10
[2018-02-02 19:39:00,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:00,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:00,696 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-02-02 19:39:00,696 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:76, output treesize:24
[2018-02-02 19:39:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:39:00,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 19:39:00,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23
[2018-02-02 19:39:00,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-02-02 19:39:00,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-02-02 19:39:00,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552
[2018-02-02 19:39:00,732 INFO L87 Difference]: Start difference. First operand 351 states and 390 transitions. Second operand 24 states.
[2018-02-02 19:39:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:39:01,741 INFO L93 Difference]: Finished difference Result 426 states and 464 transitions.
[2018-02-02 19:39:01,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-02-02 19:39:01,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56
[2018-02-02 19:39:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:39:01,742 INFO L225 Difference]: With dead ends: 426
[2018-02-02 19:39:01,742 INFO L226 Difference]: Without dead ends: 426
[2018-02-02 19:39:01,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=534, Invalid=1818, Unknown=0, NotChecked=0, Total=2352
[2018-02-02 19:39:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states.
[2018-02-02 19:39:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 369.
[2018-02-02 19:39:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states.
[2018-02-02 19:39:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 414 transitions.
[2018-02-02 19:39:01,746 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 414 transitions. Word has length 56
[2018-02-02 19:39:01,747 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:39:01,747 INFO L432 AbstractCegarLoop]: Abstraction has 369 states and 414 transitions.
[2018-02-02 19:39:01,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-02-02 19:39:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 414 transitions.
[2018-02-02 19:39:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-02-02 19:39:01,747 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:39:01,747 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:39:01,748 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:39:01,748 INFO L82 PathProgramCache]: Analyzing trace with hash 860655881, now seen corresponding path program 1 times
[2018-02-02 19:39:01,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:39:01,748 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:39:01,748 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:39:01,749 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:39:01,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:39:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:39:01,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:39:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:39:02,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 19:39:02,233 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 19:39:02,238 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:39:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:39:02,263 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 19:39:02,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31
[2018-02-02 19:39:02,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19
[2018-02-02 19:39:02,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26
[2018-02-02 19:39:02,425 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 34 treesize of output 44
[2018-02-02 19:39:02,429 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:02,430 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:02,433 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 1 case distinctions, treesize of input 30 treesize of output 30
[2018-02-02 19:39:02,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,452 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:02,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21
[2018-02-02 19:39:02,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:02,467 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:26
[2018-02-02 19:39:02,589 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:02,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29
[2018-02-02 19:39:02,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,603 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:02,604 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:02,604 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:02,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13
[2018-02-02 19:39:02,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:02,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53
[2018-02-02 19:39:02,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44
[2018-02-02 19:39:02,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1
[2018-02-02 19:39:02,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,721 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 4 case distinctions, treesize of input 49 treesize of output 65
[2018-02-02 19:39:02,723 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 54 treesize of output 38
[2018-02-02 19:39:02,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,752 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 47 treesize of output 39
[2018-02-02 19:39:02,753 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts.
[2018-02-02 19:39:02,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:39:02,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-02-02 19:39:02,785 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:91, output treesize:104
[2018-02-02 19:39:02,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 69
[2018-02-02 19:39:02,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:39:02,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 65
[2018-02-02 19:39:02,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:39:02,897 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 72
[2018-02-02 19:39:02,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:39:02,940 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,951 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:02,990 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 4 case distinctions, treesize of input 71 treesize of output 83
[2018-02-02 19:39:03,002 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 72 treesize of output 71
[2018-02-02 19:39:03,002 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:03,104 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:03,130 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-02-02 19:39:03,130 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:148, output treesize:132
[2018-02-02 19:39:03,281 WARN L143 SmtUtils]: Spent 115ms on a formula simplification that was a NOOP. DAG size: 46
[2018-02-02 19:39:03,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 85
[2018-02-02 19:39:03,290 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:03,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 19:39:03,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:03,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:03,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 93
[2018-02-02 19:39:03,348 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:03,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 19:39:03,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:03,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:03,437 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 4 case distinctions, treesize of input 93 treesize of output 103
[2018-02-02 19:39:03,446 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:03,446 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 92 treesize of output 99
[2018-02-02 19:39:03,446 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:03,512 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:03,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 84
[2018-02-02 19:39:03,558 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:03,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23
[2018-02-02 19:39:03,559 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:03,580 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:03,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts.
[2018-02-02 19:39:03,612 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:184, output treesize:180
[2018-02-02 19:39:04,127 WARN L143 SmtUtils]: Spent 426ms on a formula simplification that was a NOOP. DAG size: 80
[2018-02-02 19:39:04,156 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 126 treesize of output 99
[2018-02-02 19:39:04,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20
[2018-02-02 19:39:04,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:04,186 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:04,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38
[2018-02-02 19:39:04,188 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:04,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:04,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 102
[2018-02-02 19:39:04,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20
[2018-02-02 19:39:04,240 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:04,252 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:04,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36
[2018-02-02 19:39:04,253 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:04,263 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:04,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52
[2018-02-02 19:39:04,286 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:04,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6
[2018-02-02 19:39:04,287 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:04,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13
[2018-02-02 19:39:04,295 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:04,300 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:04,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 69
[2018-02-02 19:39:04,327 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:04,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51
[2018-02-02 19:39:04,327 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:04,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 39
[2018-02-02 19:39:04,378 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts.
[2018-02-02 19:39:04,432 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 61 treesize of output 52
[2018-02-02 19:39:04,433 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:04,485 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 52 treesize of output 47
[2018-02-02 19:39:04,486 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:04,539 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:04,539 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 47 treesize of output 41
[2018-02-02 19:39:04,539 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:04,589 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 57 treesize of output 48
[2018-02-02 19:39:04,590 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:04,635 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:04,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37
[2018-02-02 19:39:04,637 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:04,694 INFO L267 ElimStorePlain]: Start of recursive call 11: 8 dim-1 vars, End of recursive call: and 3 xjuncts.
[2018-02-02 19:39:04,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts.
[2018-02-02 19:39:04,723 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 10 variables, input treesize:256, output treesize:83
[2018-02-02 19:39:04,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:39:04,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 19:39:04,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35
[2018-02-02 19:39:04,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states
[2018-02-02 19:39:04,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2018-02-02 19:39:04,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260
[2018-02-02 19:39:04,817 INFO L87 Difference]: Start difference. First operand 369 states and 414 transitions. Second operand 36 states.
[2018-02-02 19:39:06,735 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 146 DAG size of output 67
[2018-02-02 19:39:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 19:39:07,806 INFO L93 Difference]: Finished difference Result 451 states and 499 transitions.
[2018-02-02 19:39:07,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-02-02 19:39:07,806 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 56
[2018-02-02 19:39:07,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 19:39:07,807 INFO L225 Difference]: With dead ends: 451
[2018-02-02 19:39:07,807 INFO L226 Difference]: Without dead ends: 451
[2018-02-02 19:39:07,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=700, Invalid=3205, Unknown=1, NotChecked=0, Total=3906
[2018-02-02 19:39:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states.
[2018-02-02 19:39:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 383.
[2018-02-02 19:39:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states.
[2018-02-02 19:39:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 430 transitions.
[2018-02-02 19:39:07,811 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 430 transitions. Word has length 56
[2018-02-02 19:39:07,811 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 19:39:07,812 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 430 transitions.
[2018-02-02 19:39:07,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states.
[2018-02-02 19:39:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 430 transitions.
[2018-02-02 19:39:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2018-02-02 19:39:07,812 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 19:39:07,812 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 19:39:07,813 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]===
[2018-02-02 19:39:07,813 INFO L82 PathProgramCache]: Analyzing trace with hash -839623871, now seen corresponding path program 2 times
[2018-02-02 19:39:07,813 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 19:39:07,813 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 19:39:07,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:39:07,814 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 19:39:07,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 19:39:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 19:39:07,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 19:39:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:39:08,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 19:39:08,280 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 19:39:08,284 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 19:39:08,307 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-02-02 19:39:08,307 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 19:39:08,309 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 19:39:08,314 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:08,314 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:08,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 19:39:08,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17
[2018-02-02 19:39:08,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:39:08,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:39:08,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:39:08,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-02-02 19:39:08,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30
[2018-02-02 19:39:08,379 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 51 treesize of output 47
[2018-02-02 19:39:08,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:39:08,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,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 29 treesize of output 30
[2018-02-02 19:39:08,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:39:08,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:08,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:56
[2018-02-02 19:39:08,435 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 42 treesize of output 30
[2018-02-02 19:39:08,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14
[2018-02-02 19:39:08,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2018-02-02 19:39:08,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:08,446 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29
[2018-02-02 19:39:08,496 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 28 treesize of output 27
[2018-02-02 19:39:08,497 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 19:39:08,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20
[2018-02-02 19:39:08,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:08,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:08,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41
[2018-02-02 19:39:10,534 WARN L143 SmtUtils]: Spent 2007ms on a formula simplification that was a NOOP. DAG size: 28
[2018-02-02 19:39:10,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40
[2018-02-02 19:39:10,548 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:10,554 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 2 case distinctions, treesize of input 29 treesize of output 31
[2018-02-02 19:39:10,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 19:39:10,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 19:39:10,584 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-02-02 19:39:10,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:74
[2018-02-02 19:39:28,632 WARN L146 SmtUtils]: Spent 14024ms on a formula simplification. DAG size of input: 30 DAG size of output 22
[2018-02-02 19:39:28,634 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:28,635 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:28,635 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:28,635 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-02-02 19:39:28,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30
[2018-02-02 19:39:28,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 19:39:28,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:39:28,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25
[2018-02-02 19:39:28,679 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 14 treesize of output 7
[2018-02-02 19:39:28,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31
[2018-02-02 19:39:28,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-02-02 19:39:28,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:39:28,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47
[2018-02-02 19:39:28,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13
[2018-02-02 19:39:28,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:28,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57
[2018-02-02 19:39:28,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36
[2018-02-02 19:39:28,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2018-02-02 19:39:28,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18
[2018-02-02 19:39:28,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,813 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:64, output treesize:15
[2018-02-02 19:39:28,848 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 19 treesize of output 20
[2018-02-02 19:39:28,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-02-02 19:39:28,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22
[2018-02-02 19:39:28,877 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 34 treesize of output 33
[2018-02-02 19:39:28,879 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 19:39:28,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14
[2018-02-02 19:39:28,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:28,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 19:39:28,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22
[2018-02-02 19:39:29,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19
[2018-02-02 19:39:29,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2018-02-02 19:39:29,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:29,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:29,045 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 33 treesize of output 29
[2018-02-02 19:39:29,056 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 19:39:29,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14
[2018-02-02 19:39:29,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:29,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 19:39:29,061 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:29,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:29,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 19:39:29,070 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:54, output treesize:14
[2018-02-02 19:39:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 19:39:29,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 19:39:29,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 45
[2018-02-02 19:39:29,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states
[2018-02-02 19:39:29,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2018-02-02 19:39:29,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1788, Unknown=2, NotChecked=0, Total=2070
[2018-02-02 19:39:29,143 INFO L87 Difference]: Start difference. First operand 383 states and 430 transitions. Second operand 46 states.
[2018-02-02 19:39:33,654 WARN L146 SmtUtils]: Spent 4048ms on a formula simplification. DAG size of input: 47 DAG size of output 37
[2018-02-02 19:39:37,701 WARN L146 SmtUtils]: Spent 4031ms on a formula simplification. DAG size of input: 46 DAG size of output 35
Received shutdown request...
[2018-02-02 19:39:55,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 19:39:55,804 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-02-02 19:39:55,809 WARN L185 ceAbstractionStarter]: Timeout
[2018-02-02 19:39:55,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:39:55 BoogieIcfgContainer
[2018-02-02 19:39:55,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-02 19:39:55,809 INFO L168 Benchmark]: Toolchain (without parser) took 90743.03 ms. Allocated memory was 401.1 MB in the beginning and 1.0 GB in the end (delta: 602.4 MB). Free memory was 357.8 MB in the beginning and 481.1 MB in the end (delta: -123.4 MB). Peak memory consumption was 479.0 MB. Max. memory is 5.3 GB.
[2018-02-02 19:39:55,811 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 401.1 MB. Free memory is still 363.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 19:39:55,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.99 ms. Allocated memory is still 401.1 MB. Free memory was 357.8 MB in the beginning and 344.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB.
[2018-02-02 19:39:55,811 INFO L168 Benchmark]: Boogie Preprocessor took 31.29 ms. Allocated memory is still 401.1 MB. Free memory was 344.6 MB in the beginning and 341.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB.
[2018-02-02 19:39:55,811 INFO L168 Benchmark]: RCFGBuilder took 434.02 ms. Allocated memory is still 401.1 MB. Free memory was 341.9 MB in the beginning and 295.6 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 5.3 GB.
[2018-02-02 19:39:55,812 INFO L168 Benchmark]: TraceAbstraction took 90103.87 ms. Allocated memory was 401.1 MB in the beginning and 1.0 GB in the end (delta: 602.4 MB). Free memory was 295.6 MB in the beginning and 481.1 MB in the end (delta: -185.5 MB). Peak memory consumption was 416.9 MB. Max. memory is 5.3 GB.
[2018-02-02 19:39:55,812 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.14 ms. Allocated memory is still 401.1 MB. Free memory is still 363.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 170.99 ms. Allocated memory is still 401.1 MB. Free memory was 357.8 MB in the beginning and 344.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 31.29 ms. Allocated memory is still 401.1 MB. Free memory was 344.6 MB in the beginning and 341.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 434.02 ms. Allocated memory is still 401.1 MB. Free memory was 341.9 MB in the beginning and 295.6 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 90103.87 ms. Allocated memory was 401.1 MB in the beginning and 1.0 GB in the end (delta: 602.4 MB). Free memory was 295.6 MB in the beginning and 481.1 MB in the end (delta: -185.5 MB). Peak memory consumption was 416.9 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1067). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1068). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1068). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1067). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (383states) and interpolant automaton (currently 16 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 3 procedures, 183 locations, 73 error locations. TIMEOUT Result, 90.0s OverallTime, 29 OverallIterations, 3 TraceHistogramMax, 54.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3433 SDtfs, 20771 SDslu, 20649 SDs, 0 SdLazy, 26012 SolverSat, 2978 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 20.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1334 GetRequests, 441 SyntacticMatches, 23 SemanticMatches, 869 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15167 ImplicationChecksByTransitivity, 60.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=383occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 2029 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 33.9s InterpolantComputationTime, 1724 NumberOfCodeBlocks, 1724 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1684 ConstructedInterpolants, 215 QuantifiedInterpolants, 1393845 SizeOfPredicates, 193 NumberOfNonLiveVariables, 2393 ConjunctsInSsa, 465 ConjunctsInUnsatCore, 40 InterpolantComputations, 18 PerfectInterpolantSequences, 35/229 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-39-55-818.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-39-55-818.csv
Completed graceful shutdown