java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:12:59,120 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:12:59,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:12:59,136 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:12:59,136 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:12:59,137 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:12:59,138 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:12:59,140 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:12:59,141 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:12:59,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:12:59,142 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:12:59,143 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:12:59,143 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:12:59,144 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:12:59,145 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:12:59,147 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:12:59,149 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:12:59,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:12:59,152 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:12:59,153 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:12:59,156 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:12:59,156 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:12:59,156 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:12:59,157 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:12:59,158 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:12:59,159 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:12:59,159 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:12:59,160 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:12:59,160 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:12:59,160 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:12:59,161 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:12:59,161 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:12:59,171 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:12:59,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:12:59,172 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:12:59,172 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:12:59,172 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:12:59,172 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:12:59,173 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:12:59,173 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:12:59,173 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:12:59,174 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:12:59,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:12:59,174 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:12:59,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:12:59,174 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:12:59,174 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:12:59,175 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:12:59,175 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:12:59,175 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:12:59,175 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:12:59,175 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:12:59,176 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:12:59,176 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:12:59,176 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:12:59,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:12:59,176 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:12:59,177 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:12:59,177 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:12:59,177 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:12:59,177 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:12:59,177 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:12:59,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:12:59,178 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:12:59,179 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:12:59,179 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:12:59,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:12:59,221 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:12:59,224 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:12:59,225 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:12:59,225 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:12:59,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i [2018-01-28 22:12:59,388 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:12:59,393 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:12:59,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:12:59,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:12:59,398 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:12:59,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:12:59" (1/1) ... [2018-01-28 22:12:59,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17492289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:12:59, skipping insertion in model container [2018-01-28 22:12:59,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:12:59" (1/1) ... [2018-01-28 22:12:59,418 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:12:59,458 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:12:59,567 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:12:59,588 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:12:59,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:12:59 WrapperNode [2018-01-28 22:12:59,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:12:59,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:12:59,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:12:59,600 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:12:59,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:12:59" (1/1) ... [2018-01-28 22:12:59,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:12:59" (1/1) ... [2018-01-28 22:12:59,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:12:59" (1/1) ... [2018-01-28 22:12:59,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:12:59" (1/1) ... [2018-01-28 22:12:59,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:12:59" (1/1) ... [2018-01-28 22:12:59,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:12:59" (1/1) ... [2018-01-28 22:12:59,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:12:59" (1/1) ... [2018-01-28 22:12:59,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:12:59,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:12:59,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:12:59,637 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:12:59,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:12:59" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:12:59,684 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:12:59,684 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:12:59,684 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:12:59,685 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 22:12:59,685 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 22:12:59,685 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:12:59,685 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:12:59,685 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:12:59,685 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:12:59,685 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:12:59,685 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:12:59,685 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:12:59,685 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-28 22:12:59,686 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:12:59,686 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:12:59,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:12:59,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:13:00,184 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:13:00,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:13:00 BoogieIcfgContainer [2018-01-28 22:13:00,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:13:00,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:13:00,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:13:00,188 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:13:00,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:12:59" (1/3) ... [2018-01-28 22:13:00,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c2ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:13:00, skipping insertion in model container [2018-01-28 22:13:00,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:12:59" (2/3) ... [2018-01-28 22:13:00,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c2ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:13:00, skipping insertion in model container [2018-01-28 22:13:00,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:13:00" (3/3) ... [2018-01-28 22:13:00,192 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0513_1_true-valid-memsafety.i [2018-01-28 22:13:00,199 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:13:00,205 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-01-28 22:13:00,245 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:13:00,245 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:13:00,245 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:13:00,245 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:13:00,246 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:13:00,246 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:13:00,246 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:13:00,246 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:13:00,246 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:13:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states. [2018-01-28 22:13:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 22:13:00,270 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:00,271 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:00,272 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:00,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1254346080, now seen corresponding path program 1 times [2018-01-28 22:13:00,277 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:00,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:00,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:00,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:00,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:00,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:00,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:00,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:13:00,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-28 22:13:00,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-28 22:13:00,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-28 22:13:00,490 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 2 states. [2018-01-28 22:13:00,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:00,527 INFO L93 Difference]: Finished difference Result 379 states and 417 transitions. [2018-01-28 22:13:00,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-28 22:13:00,529 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-28 22:13:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:00,542 INFO L225 Difference]: With dead ends: 379 [2018-01-28 22:13:00,542 INFO L226 Difference]: Without dead ends: 191 [2018-01-28 22:13:00,547 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-28 22:13:00,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-28 22:13:00,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-01-28 22:13:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-28 22:13:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 205 transitions. [2018-01-28 22:13:00,588 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 205 transitions. Word has length 15 [2018-01-28 22:13:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:00,589 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 205 transitions. [2018-01-28 22:13:00,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-28 22:13:00,589 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 205 transitions. [2018-01-28 22:13:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 22:13:00,589 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:00,589 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:00,590 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:00,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1864387025, now seen corresponding path program 1 times [2018-01-28 22:13:00,590 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:00,590 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:00,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:00,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:00,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:00,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:00,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:00,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:13:00,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:13:00,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:13:00,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:13:00,646 INFO L87 Difference]: Start difference. First operand 191 states and 205 transitions. Second operand 3 states. [2018-01-28 22:13:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:00,827 INFO L93 Difference]: Finished difference Result 253 states and 270 transitions. [2018-01-28 22:13:00,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:13:00,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-28 22:13:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:00,832 INFO L225 Difference]: With dead ends: 253 [2018-01-28 22:13:00,832 INFO L226 Difference]: Without dead ends: 250 [2018-01-28 22:13:00,833 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:13:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-28 22:13:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 200. [2018-01-28 22:13:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-01-28 22:13:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 216 transitions. [2018-01-28 22:13:00,846 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 216 transitions. Word has length 20 [2018-01-28 22:13:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:00,847 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 216 transitions. [2018-01-28 22:13:00,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:13:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 216 transitions. [2018-01-28 22:13:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 22:13:00,847 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:00,847 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:00,847 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:00,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1864388928, now seen corresponding path program 1 times [2018-01-28 22:13:00,848 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:00,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:00,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:00,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:00,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:00,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:00,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:00,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:13:00,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:13:00,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:13:00,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:13:00,892 INFO L87 Difference]: Start difference. First operand 200 states and 216 transitions. Second operand 3 states. [2018-01-28 22:13:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:00,941 INFO L93 Difference]: Finished difference Result 408 states and 441 transitions. [2018-01-28 22:13:00,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:13:00,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-28 22:13:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:00,943 INFO L225 Difference]: With dead ends: 408 [2018-01-28 22:13:00,943 INFO L226 Difference]: Without dead ends: 225 [2018-01-28 22:13:00,944 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:13:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-28 22:13:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 215. [2018-01-28 22:13:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-28 22:13:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 241 transitions. [2018-01-28 22:13:00,958 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 241 transitions. Word has length 20 [2018-01-28 22:13:00,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:00,959 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 241 transitions. [2018-01-28 22:13:00,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:13:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 241 transitions. [2018-01-28 22:13:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 22:13:00,960 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:00,960 INFO L330 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] [2018-01-28 22:13:00,960 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:00,960 INFO L82 PathProgramCache]: Analyzing trace with hash -634093071, now seen corresponding path program 1 times [2018-01-28 22:13:00,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:00,961 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:00,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:00,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:00,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:00,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:00,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:00,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:13:00,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:13:00,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:13:00,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:13:00,992 INFO L87 Difference]: Start difference. First operand 215 states and 241 transitions. Second operand 3 states. [2018-01-28 22:13:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:01,034 INFO L93 Difference]: Finished difference Result 415 states and 467 transitions. [2018-01-28 22:13:01,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:13:01,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-28 22:13:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:01,035 INFO L225 Difference]: With dead ends: 415 [2018-01-28 22:13:01,035 INFO L226 Difference]: Without dead ends: 216 [2018-01-28 22:13:01,037 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:13:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-01-28 22:13:01,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-01-28 22:13:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-28 22:13:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 241 transitions. [2018-01-28 22:13:01,049 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 241 transitions. Word has length 24 [2018-01-28 22:13:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:01,049 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 241 transitions. [2018-01-28 22:13:01,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:13:01,049 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 241 transitions. [2018-01-28 22:13:01,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-28 22:13:01,050 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:01,050 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:01,050 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:01,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1550199278, now seen corresponding path program 1 times [2018-01-28 22:13:01,051 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:01,051 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:01,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:01,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:01,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:01,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:01,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:01,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:13:01,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:13:01,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:13:01,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:13:01,118 INFO L87 Difference]: Start difference. First operand 216 states and 241 transitions. Second operand 4 states. [2018-01-28 22:13:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:01,417 INFO L93 Difference]: Finished difference Result 303 states and 332 transitions. [2018-01-28 22:13:01,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:13:01,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-28 22:13:01,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:01,420 INFO L225 Difference]: With dead ends: 303 [2018-01-28 22:13:01,420 INFO L226 Difference]: Without dead ends: 297 [2018-01-28 22:13:01,421 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:13:01,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-01-28 22:13:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 217. [2018-01-28 22:13:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-01-28 22:13:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 242 transitions. [2018-01-28 22:13:01,431 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 242 transitions. Word has length 26 [2018-01-28 22:13:01,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:01,432 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 242 transitions. [2018-01-28 22:13:01,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:13:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 242 transitions. [2018-01-28 22:13:01,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-28 22:13:01,433 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:01,433 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:01,433 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:01,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1550199279, now seen corresponding path program 1 times [2018-01-28 22:13:01,434 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:01,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:01,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:01,435 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:01,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:01,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:01,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:01,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:13:01,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:13:01,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:13:01,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:13:01,520 INFO L87 Difference]: Start difference. First operand 217 states and 242 transitions. Second operand 4 states. [2018-01-28 22:13:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:01,713 INFO L93 Difference]: Finished difference Result 217 states and 242 transitions. [2018-01-28 22:13:01,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:13:01,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-28 22:13:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:01,715 INFO L225 Difference]: With dead ends: 217 [2018-01-28 22:13:01,715 INFO L226 Difference]: Without dead ends: 213 [2018-01-28 22:13:01,715 INFO L533 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-01-28 22:13:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-01-28 22:13:01,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-01-28 22:13:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-28 22:13:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 234 transitions. [2018-01-28 22:13:01,723 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 234 transitions. Word has length 26 [2018-01-28 22:13:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:01,723 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 234 transitions. [2018-01-28 22:13:01,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:13:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 234 transitions. [2018-01-28 22:13:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 22:13:01,724 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:01,724 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:01,724 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:01,724 INFO L82 PathProgramCache]: Analyzing trace with hash -33233327, now seen corresponding path program 1 times [2018-01-28 22:13:01,725 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:01,725 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:01,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:01,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:01,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:01,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:01,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:01,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:13:01,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:13:01,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:13:01,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:13:01,781 INFO L87 Difference]: Start difference. First operand 213 states and 234 transitions. Second operand 5 states. [2018-01-28 22:13:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:01,848 INFO L93 Difference]: Finished difference Result 569 states and 627 transitions. [2018-01-28 22:13:01,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:13:01,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-28 22:13:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:01,851 INFO L225 Difference]: With dead ends: 569 [2018-01-28 22:13:01,851 INFO L226 Difference]: Without dead ends: 384 [2018-01-28 22:13:01,852 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:13:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-01-28 22:13:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 216. [2018-01-28 22:13:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-28 22:13:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 234 transitions. [2018-01-28 22:13:01,863 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 234 transitions. Word has length 33 [2018-01-28 22:13:01,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:01,864 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 234 transitions. [2018-01-28 22:13:01,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:13:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 234 transitions. [2018-01-28 22:13:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 22:13:01,865 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:01,865 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:01,866 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:01,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1486062323, now seen corresponding path program 1 times [2018-01-28 22:13:01,866 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:01,866 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:01,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:01,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:01,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:01,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:01,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:01,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:13:01,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:13:01,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:13:01,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:13:01,916 INFO L87 Difference]: Start difference. First operand 216 states and 234 transitions. Second operand 4 states. [2018-01-28 22:13:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:02,030 INFO L93 Difference]: Finished difference Result 261 states and 280 transitions. [2018-01-28 22:13:02,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:13:02,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-28 22:13:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:02,032 INFO L225 Difference]: With dead ends: 261 [2018-01-28 22:13:02,032 INFO L226 Difference]: Without dead ends: 257 [2018-01-28 22:13:02,032 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:13:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-01-28 22:13:02,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 212. [2018-01-28 22:13:02,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-28 22:13:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 230 transitions. [2018-01-28 22:13:02,040 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 230 transitions. Word has length 36 [2018-01-28 22:13:02,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:02,040 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 230 transitions. [2018-01-28 22:13:02,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:13:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 230 transitions. [2018-01-28 22:13:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 22:13:02,042 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:02,042 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:02,042 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:02,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1486062324, now seen corresponding path program 1 times [2018-01-28 22:13:02,042 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:02,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:02,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:02,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:02,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:02,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:02,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:02,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:13:02,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:13:02,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:13:02,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:13:02,193 INFO L87 Difference]: Start difference. First operand 212 states and 230 transitions. Second operand 4 states. [2018-01-28 22:13:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:02,387 INFO L93 Difference]: Finished difference Result 212 states and 230 transitions. [2018-01-28 22:13:02,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:13:02,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-28 22:13:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:02,388 INFO L225 Difference]: With dead ends: 212 [2018-01-28 22:13:02,388 INFO L226 Difference]: Without dead ends: 209 [2018-01-28 22:13:02,389 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:13:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-28 22:13:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-01-28 22:13:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-28 22:13:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 227 transitions. [2018-01-28 22:13:02,396 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 227 transitions. Word has length 36 [2018-01-28 22:13:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:02,396 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 227 transitions. [2018-01-28 22:13:02,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:13:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 227 transitions. [2018-01-28 22:13:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 22:13:02,398 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:02,398 INFO L330 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] [2018-01-28 22:13:02,398 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:02,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1710867009, now seen corresponding path program 1 times [2018-01-28 22:13:02,399 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:02,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:02,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:02,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:02,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:02,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:02,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:02,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:13:02,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:13:02,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:13:02,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:13:02,500 INFO L87 Difference]: Start difference. First operand 209 states and 227 transitions. Second operand 5 states. [2018-01-28 22:13:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:02,636 INFO L93 Difference]: Finished difference Result 509 states and 557 transitions. [2018-01-28 22:13:02,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:13:02,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-28 22:13:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:02,638 INFO L225 Difference]: With dead ends: 509 [2018-01-28 22:13:02,638 INFO L226 Difference]: Without dead ends: 335 [2018-01-28 22:13:02,639 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:13:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-01-28 22:13:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 208. [2018-01-28 22:13:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-28 22:13:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 224 transitions. [2018-01-28 22:13:02,654 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 224 transitions. Word has length 49 [2018-01-28 22:13:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:02,655 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 224 transitions. [2018-01-28 22:13:02,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:13:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 224 transitions. [2018-01-28 22:13:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 22:13:02,656 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:02,656 INFO L330 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] [2018-01-28 22:13:02,656 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:02,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1710868912, now seen corresponding path program 1 times [2018-01-28 22:13:02,656 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:02,657 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:02,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:02,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:02,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:02,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:02,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:02,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:13:02,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:13:02,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:13:02,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:13:02,721 INFO L87 Difference]: Start difference. First operand 208 states and 224 transitions. Second operand 4 states. [2018-01-28 22:13:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:02,828 INFO L93 Difference]: Finished difference Result 498 states and 538 transitions. [2018-01-28 22:13:02,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:13:02,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-01-28 22:13:02,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:02,830 INFO L225 Difference]: With dead ends: 498 [2018-01-28 22:13:02,830 INFO L226 Difference]: Without dead ends: 365 [2018-01-28 22:13:02,831 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:13:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-01-28 22:13:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 222. [2018-01-28 22:13:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-28 22:13:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 242 transitions. [2018-01-28 22:13:02,842 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 242 transitions. Word has length 49 [2018-01-28 22:13:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:02,842 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 242 transitions. [2018-01-28 22:13:02,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:13:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 242 transitions. [2018-01-28 22:13:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-28 22:13:02,843 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:02,843 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:02,843 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:02,844 INFO L82 PathProgramCache]: Analyzing trace with hash 739548205, now seen corresponding path program 1 times [2018-01-28 22:13:02,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:02,844 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:02,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:02,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:02,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:02,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:03,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:03,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:13:03,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:13:03,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:13:03,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:13:03,003 INFO L87 Difference]: Start difference. First operand 222 states and 242 transitions. Second operand 5 states. [2018-01-28 22:13:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:03,361 INFO L93 Difference]: Finished difference Result 350 states and 381 transitions. [2018-01-28 22:13:03,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:13:03,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-01-28 22:13:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:03,363 INFO L225 Difference]: With dead ends: 350 [2018-01-28 22:13:03,363 INFO L226 Difference]: Without dead ends: 340 [2018-01-28 22:13:03,364 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:13:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-01-28 22:13:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 279. [2018-01-28 22:13:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-01-28 22:13:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 336 transitions. [2018-01-28 22:13:03,377 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 336 transitions. Word has length 51 [2018-01-28 22:13:03,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:03,377 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 336 transitions. [2018-01-28 22:13:03,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:13:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 336 transitions. [2018-01-28 22:13:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-28 22:13:03,378 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:03,378 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:03,378 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:03,379 INFO L82 PathProgramCache]: Analyzing trace with hash 739548204, now seen corresponding path program 1 times [2018-01-28 22:13:03,379 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:03,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:03,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:03,380 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:03,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:03,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:03,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:03,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:13:03,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:13:03,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:13:03,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:13:03,432 INFO L87 Difference]: Start difference. First operand 279 states and 336 transitions. Second operand 5 states. [2018-01-28 22:13:03,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:03,602 INFO L93 Difference]: Finished difference Result 283 states and 339 transitions. [2018-01-28 22:13:03,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:13:03,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-01-28 22:13:03,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:03,604 INFO L225 Difference]: With dead ends: 283 [2018-01-28 22:13:03,604 INFO L226 Difference]: Without dead ends: 274 [2018-01-28 22:13:03,604 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:13:03,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-28 22:13:03,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-01-28 22:13:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-28 22:13:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 319 transitions. [2018-01-28 22:13:03,615 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 319 transitions. Word has length 51 [2018-01-28 22:13:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:03,616 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 319 transitions. [2018-01-28 22:13:03,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:13:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 319 transitions. [2018-01-28 22:13:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-28 22:13:03,617 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:03,617 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:03,617 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:03,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1281671535, now seen corresponding path program 1 times [2018-01-28 22:13:03,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:03,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:03,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:03,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:03,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:03,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:03,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:03,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:13:03,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:13:03,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:13:03,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:13:03,807 INFO L87 Difference]: Start difference. First operand 271 states and 319 transitions. Second operand 6 states. [2018-01-28 22:13:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:04,061 INFO L93 Difference]: Finished difference Result 318 states and 368 transitions. [2018-01-28 22:13:04,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:13:04,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-01-28 22:13:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:04,063 INFO L225 Difference]: With dead ends: 318 [2018-01-28 22:13:04,064 INFO L226 Difference]: Without dead ends: 317 [2018-01-28 22:13:04,064 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:13:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-01-28 22:13:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 292. [2018-01-28 22:13:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-01-28 22:13:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 343 transitions. [2018-01-28 22:13:04,076 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 343 transitions. Word has length 58 [2018-01-28 22:13:04,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:04,077 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 343 transitions. [2018-01-28 22:13:04,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:13:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 343 transitions. [2018-01-28 22:13:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-28 22:13:04,078 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:04,078 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:04,078 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:04,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1281671534, now seen corresponding path program 1 times [2018-01-28 22:13:04,078 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:04,079 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:04,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:04,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:04,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:04,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:04,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:04,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:13:04,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:13:04,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:13:04,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:13:04,260 INFO L87 Difference]: Start difference. First operand 292 states and 343 transitions. Second operand 6 states. [2018-01-28 22:13:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:04,481 INFO L93 Difference]: Finished difference Result 504 states and 597 transitions. [2018-01-28 22:13:04,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:13:04,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-01-28 22:13:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:04,483 INFO L225 Difference]: With dead ends: 504 [2018-01-28 22:13:04,483 INFO L226 Difference]: Without dead ends: 330 [2018-01-28 22:13:04,484 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:13:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-01-28 22:13:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 286. [2018-01-28 22:13:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-01-28 22:13:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 335 transitions. [2018-01-28 22:13:04,498 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 335 transitions. Word has length 58 [2018-01-28 22:13:04,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:04,499 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 335 transitions. [2018-01-28 22:13:04,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:13:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 335 transitions. [2018-01-28 22:13:04,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-28 22:13:04,500 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:04,500 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:04,500 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:04,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1205811958, now seen corresponding path program 1 times [2018-01-28 22:13:04,500 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:04,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:04,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:04,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:04,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:04,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:04,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:04,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 22:13:04,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:13:04,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:13:04,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:13:04,867 INFO L87 Difference]: Start difference. First operand 286 states and 335 transitions. Second operand 11 states. [2018-01-28 22:13:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:05,449 INFO L93 Difference]: Finished difference Result 446 states and 508 transitions. [2018-01-28 22:13:05,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:13:05,449 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-01-28 22:13:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:05,451 INFO L225 Difference]: With dead ends: 446 [2018-01-28 22:13:05,451 INFO L226 Difference]: Without dead ends: 443 [2018-01-28 22:13:05,452 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2018-01-28 22:13:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-01-28 22:13:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 328. [2018-01-28 22:13:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-01-28 22:13:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 383 transitions. [2018-01-28 22:13:05,469 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 383 transitions. Word has length 61 [2018-01-28 22:13:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:05,469 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 383 transitions. [2018-01-28 22:13:05,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:13:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 383 transitions. [2018-01-28 22:13:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-28 22:13:05,470 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:05,470 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:05,470 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:05,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1205812664, now seen corresponding path program 1 times [2018-01-28 22:13:05,471 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:05,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:05,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:05,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:05,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:05,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:05,791 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:05,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 22:13:05,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:13:05,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:13:05,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:13:05,792 INFO L87 Difference]: Start difference. First operand 328 states and 383 transitions. Second operand 11 states. [2018-01-28 22:13:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:06,481 INFO L93 Difference]: Finished difference Result 432 states and 491 transitions. [2018-01-28 22:13:06,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 22:13:06,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-01-28 22:13:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:06,483 INFO L225 Difference]: With dead ends: 432 [2018-01-28 22:13:06,483 INFO L226 Difference]: Without dead ends: 431 [2018-01-28 22:13:06,483 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2018-01-28 22:13:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-01-28 22:13:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 330. [2018-01-28 22:13:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-01-28 22:13:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 386 transitions. [2018-01-28 22:13:06,498 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 386 transitions. Word has length 61 [2018-01-28 22:13:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:06,499 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 386 transitions. [2018-01-28 22:13:06,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:13:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 386 transitions. [2018-01-28 22:13:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-28 22:13:06,500 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:06,500 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:06,500 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:06,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1205812665, now seen corresponding path program 1 times [2018-01-28 22:13:06,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:06,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:06,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:06,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:06,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:06,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:06,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:06,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 22:13:06,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:13:06,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:13:06,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:13:06,904 INFO L87 Difference]: Start difference. First operand 330 states and 386 transitions. Second operand 11 states. [2018-01-28 22:13:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:07,485 INFO L93 Difference]: Finished difference Result 442 states and 504 transitions. [2018-01-28 22:13:07,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:13:07,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-01-28 22:13:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:07,487 INFO L225 Difference]: With dead ends: 442 [2018-01-28 22:13:07,487 INFO L226 Difference]: Without dead ends: 441 [2018-01-28 22:13:07,487 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2018-01-28 22:13:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-01-28 22:13:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 330. [2018-01-28 22:13:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-01-28 22:13:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 385 transitions. [2018-01-28 22:13:07,496 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 385 transitions. Word has length 61 [2018-01-28 22:13:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:07,496 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 385 transitions. [2018-01-28 22:13:07,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:13:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 385 transitions. [2018-01-28 22:13:07,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-28 22:13:07,497 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:07,497 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:07,497 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:07,497 INFO L82 PathProgramCache]: Analyzing trace with hash -741172027, now seen corresponding path program 1 times [2018-01-28 22:13:07,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:07,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:07,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:07,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:07,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:07,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-28 22:13:07,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:07,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:13:07,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:13:07,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:13:07,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:13:07,553 INFO L87 Difference]: Start difference. First operand 330 states and 385 transitions. Second operand 4 states. [2018-01-28 22:13:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:07,854 INFO L93 Difference]: Finished difference Result 397 states and 466 transitions. [2018-01-28 22:13:07,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:13:07,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-01-28 22:13:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:07,856 INFO L225 Difference]: With dead ends: 397 [2018-01-28 22:13:07,856 INFO L226 Difference]: Without dead ends: 392 [2018-01-28 22:13:07,857 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:13:07,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-01-28 22:13:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 334. [2018-01-28 22:13:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-01-28 22:13:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 396 transitions. [2018-01-28 22:13:07,870 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 396 transitions. Word has length 64 [2018-01-28 22:13:07,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:07,871 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 396 transitions. [2018-01-28 22:13:07,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:13:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 396 transitions. [2018-01-28 22:13:07,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-28 22:13:07,872 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:07,872 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:07,872 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:07,872 INFO L82 PathProgramCache]: Analyzing trace with hash -741172026, now seen corresponding path program 1 times [2018-01-28 22:13:07,872 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:07,872 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:07,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:07,873 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:07,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:07,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:08,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:08,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-28 22:13:08,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:13:08,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:13:08,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:13:08,299 INFO L87 Difference]: Start difference. First operand 334 states and 396 transitions. Second operand 13 states. [2018-01-28 22:13:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:08,941 INFO L93 Difference]: Finished difference Result 465 states and 536 transitions. [2018-01-28 22:13:08,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 22:13:08,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2018-01-28 22:13:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:08,943 INFO L225 Difference]: With dead ends: 465 [2018-01-28 22:13:08,943 INFO L226 Difference]: Without dead ends: 463 [2018-01-28 22:13:08,943 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2018-01-28 22:13:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-01-28 22:13:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 340. [2018-01-28 22:13:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-01-28 22:13:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 403 transitions. [2018-01-28 22:13:08,958 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 403 transitions. Word has length 64 [2018-01-28 22:13:08,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:08,958 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 403 transitions. [2018-01-28 22:13:08,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:13:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 403 transitions. [2018-01-28 22:13:08,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-28 22:13:08,959 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:08,960 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:08,960 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:08,960 INFO L82 PathProgramCache]: Analyzing trace with hash -557866302, now seen corresponding path program 1 times [2018-01-28 22:13:08,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:08,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:08,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:08,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:08,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:08,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-28 22:13:09,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:09,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:13:09,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:13:09,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:13:09,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:13:09,002 INFO L87 Difference]: Start difference. First operand 340 states and 403 transitions. Second operand 3 states. [2018-01-28 22:13:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:09,017 INFO L93 Difference]: Finished difference Result 368 states and 434 transitions. [2018-01-28 22:13:09,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:13:09,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-01-28 22:13:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:09,019 INFO L225 Difference]: With dead ends: 368 [2018-01-28 22:13:09,019 INFO L226 Difference]: Without dead ends: 341 [2018-01-28 22:13:09,019 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:13:09,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-01-28 22:13:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-01-28 22:13:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-01-28 22:13:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 404 transitions. [2018-01-28 22:13:09,028 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 404 transitions. Word has length 71 [2018-01-28 22:13:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:09,029 INFO L432 AbstractCegarLoop]: Abstraction has 341 states and 404 transitions. [2018-01-28 22:13:09,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:13:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 404 transitions. [2018-01-28 22:13:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-28 22:13:09,029 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:09,030 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:09,030 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:09,030 INFO L82 PathProgramCache]: Analyzing trace with hash -705435067, now seen corresponding path program 1 times [2018-01-28 22:13:09,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:09,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:09,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:09,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:09,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:09,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:09,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:09,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 22:13:09,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:13:09,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:13:09,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:13:09,433 INFO L87 Difference]: Start difference. First operand 341 states and 404 transitions. Second operand 12 states. [2018-01-28 22:13:10,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:10,101 INFO L93 Difference]: Finished difference Result 484 states and 556 transitions. [2018-01-28 22:13:10,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 22:13:10,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2018-01-28 22:13:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:10,104 INFO L225 Difference]: With dead ends: 484 [2018-01-28 22:13:10,104 INFO L226 Difference]: Without dead ends: 483 [2018-01-28 22:13:10,104 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:13:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-01-28 22:13:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 347. [2018-01-28 22:13:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-01-28 22:13:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 411 transitions. [2018-01-28 22:13:10,120 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 411 transitions. Word has length 73 [2018-01-28 22:13:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:10,120 INFO L432 AbstractCegarLoop]: Abstraction has 347 states and 411 transitions. [2018-01-28 22:13:10,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:13:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 411 transitions. [2018-01-28 22:13:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-28 22:13:10,121 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:10,121 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:10,122 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:10,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1931759381, now seen corresponding path program 1 times [2018-01-28 22:13:10,122 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:10,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:10,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:10,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:10,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:10,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:10,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:13:10,818 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:13:10,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:10,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:13:11,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 17 treesize of output 14 [2018-01-28 22:13:11,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-28 22:13:11,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:11,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:11,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:11,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-28 22:13:11,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:11,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:11,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:13:11,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:11,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:11,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:27 [2018-01-28 22:13:11,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-28 22:13:11,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-28 22:13:11,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:11,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:11,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:11,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2018-01-28 22:13:11,610 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 31 treesize of output 32 [2018-01-28 22:13:11,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-28 22:13:11,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:11,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:11,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:13:11,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:13:11,646 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:11,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:11,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:13:11,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:13:11,699 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:11,706 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:11,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:11,719 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:70, output treesize:46 [2018-01-28 22:13:11,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-28 22:13:11,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2018-01-28 22:13:11,855 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:13:11,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:13:11,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 22:13:11,887 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 15 treesize of output 12 [2018-01-28 22:13:11,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-28 22:13:11,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:13:11,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-01-28 22:13:11,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:67, output treesize:106 [2018-01-28 22:13:12,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 22:13:12,185 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 7 [2018-01-28 22:13:12,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:12,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:12,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:12,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-01-28 22:13:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:12,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:13:12,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 37 [2018-01-28 22:13:12,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-28 22:13:12,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-28 22:13:12,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1186, Unknown=0, NotChecked=0, Total=1332 [2018-01-28 22:13:12,311 INFO L87 Difference]: Start difference. First operand 347 states and 411 transitions. Second operand 37 states. [2018-01-28 22:13:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:15,062 INFO L93 Difference]: Finished difference Result 469 states and 542 transitions. [2018-01-28 22:13:15,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-28 22:13:15,063 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2018-01-28 22:13:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:15,064 INFO L225 Difference]: With dead ends: 469 [2018-01-28 22:13:15,065 INFO L226 Difference]: Without dead ends: 441 [2018-01-28 22:13:15,066 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=717, Invalid=3975, Unknown=0, NotChecked=0, Total=4692 [2018-01-28 22:13:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-01-28 22:13:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 361. [2018-01-28 22:13:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-01-28 22:13:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 425 transitions. [2018-01-28 22:13:15,086 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 425 transitions. Word has length 74 [2018-01-28 22:13:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:15,086 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 425 transitions. [2018-01-28 22:13:15,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-28 22:13:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 425 transitions. [2018-01-28 22:13:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-28 22:13:15,087 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:15,088 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:15,088 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:15,088 INFO L82 PathProgramCache]: Analyzing trace with hash -537774926, now seen corresponding path program 1 times [2018-01-28 22:13:15,088 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:15,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:15,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:15,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:15,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:15,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:15,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:13:15,806 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:13:15,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:15,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:13:16,063 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 17 treesize of output 14 [2018-01-28 22:13:16,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-28 22:13:16,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:16,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:16,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:16,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-28 22:13:16,102 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:16,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:16,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:13:16,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:16,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:16,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:27 [2018-01-28 22:13:16,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-28 22:13:16,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-28 22:13:16,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:16,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:16,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:16,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2018-01-28 22:13:16,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 31 treesize of output 32 [2018-01-28 22:13:16,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-28 22:13:16,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:16,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:16,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:13:16,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:13:16,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:16,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:16,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:13:16,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:13:16,389 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:16,392 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:16,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:16,428 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:70, output treesize:46 [2018-01-28 22:13:16,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-28 22:13:16,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2018-01-28 22:13:16,537 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:13:16,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:13:16,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 22:13:16,576 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 15 treesize of output 12 [2018-01-28 22:13:16,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-28 22:13:16,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:13:16,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-01-28 22:13:16,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:67, output treesize:106 [2018-01-28 22:13:16,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 22:13:16,821 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 7 [2018-01-28 22:13:16,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:16,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:16,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:16,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-01-28 22:13:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:16,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:13:16,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 39 [2018-01-28 22:13:16,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-28 22:13:16,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-28 22:13:16,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2018-01-28 22:13:16,914 INFO L87 Difference]: Start difference. First operand 361 states and 425 transitions. Second operand 39 states. [2018-01-28 22:13:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:19,205 INFO L93 Difference]: Finished difference Result 636 states and 756 transitions. [2018-01-28 22:13:19,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-28 22:13:19,206 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-01-28 22:13:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:19,208 INFO L225 Difference]: With dead ends: 636 [2018-01-28 22:13:19,208 INFO L226 Difference]: Without dead ends: 608 [2018-01-28 22:13:19,209 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=648, Invalid=3908, Unknown=0, NotChecked=0, Total=4556 [2018-01-28 22:13:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-01-28 22:13:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 364. [2018-01-28 22:13:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-01-28 22:13:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 428 transitions. [2018-01-28 22:13:19,222 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 428 transitions. Word has length 76 [2018-01-28 22:13:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:19,222 INFO L432 AbstractCegarLoop]: Abstraction has 364 states and 428 transitions. [2018-01-28 22:13:19,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-28 22:13:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 428 transitions. [2018-01-28 22:13:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-28 22:13:19,223 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:19,223 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:19,223 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:19,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1977778006, now seen corresponding path program 1 times [2018-01-28 22:13:19,223 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:19,223 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:19,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:19,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:19,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:19,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:19,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:13:19,664 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:13:19,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:19,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:13:19,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:13:19,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:13:19,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:19,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:19,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:19,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:47 [2018-01-28 22:13:20,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2018-01-28 22:13:20,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:20,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-01-28 22:13:20,031 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:20,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:20,074 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 63 treesize of output 55 [2018-01-28 22:13:20,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2018-01-28 22:13:20,082 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:13:20,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:13:20,139 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 3 xjuncts. [2018-01-28 22:13:20,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:127, output treesize:105 [2018-01-28 22:13:20,510 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~data~5.base Int) (main_~item2~5.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~item2~5.base 1))) (and (= |c_#valid| (store (store .cse0 main_~data~5.base 0) main_~item2~5.base 0)) (not (= main_~data~5.base 0)) (= 0 (select |c_old(#valid)| main_~item2~5.base)) (not (= 0 main_~item2~5.base)) (= 0 (select .cse0 main_~data~5.base))))) is different from true [2018-01-28 22:13:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-28 22:13:20,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:13:20,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 29 [2018-01-28 22:13:20,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-28 22:13:20,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-28 22:13:20,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=726, Unknown=15, NotChecked=54, Total=870 [2018-01-28 22:13:20,573 INFO L87 Difference]: Start difference. First operand 364 states and 428 transitions. Second operand 30 states. [2018-01-28 22:13:21,077 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 27 DAG size of output 19 [2018-01-28 22:13:22,221 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 70 DAG size of output 61 [2018-01-28 22:13:23,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:23,110 INFO L93 Difference]: Finished difference Result 407 states and 474 transitions. [2018-01-28 22:13:23,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 22:13:23,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 77 [2018-01-28 22:13:23,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:23,112 INFO L225 Difference]: With dead ends: 407 [2018-01-28 22:13:23,112 INFO L226 Difference]: Without dead ends: 402 [2018-01-28 22:13:23,113 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=247, Invalid=1997, Unknown=16, NotChecked=92, Total=2352 [2018-01-28 22:13:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-01-28 22:13:23,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 384. [2018-01-28 22:13:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-01-28 22:13:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 454 transitions. [2018-01-28 22:13:23,135 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 454 transitions. Word has length 77 [2018-01-28 22:13:23,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:23,135 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 454 transitions. [2018-01-28 22:13:23,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-28 22:13:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 454 transitions. [2018-01-28 22:13:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-28 22:13:23,136 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:23,136 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:23,136 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:23,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1977777300, now seen corresponding path program 1 times [2018-01-28 22:13:23,137 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:23,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:23,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:23,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:23,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:23,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:23,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:23,763 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:13:23,763 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:13:23,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:23,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:13:23,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:13:23,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:13:23,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:23,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:23,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:13:23,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:13:23,851 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:23,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:23,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:23,873 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-28 22:13:23,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-28 22:13:23,910 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:23,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:13:23,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:23,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:23,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-28 22:13:23,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:23,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:13:23,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:23,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:23,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:23,963 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:26 [2018-01-28 22:13:23,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-28 22:13:23,974 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:23,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:13:23,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:23,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-28 22:13:24,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:24,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:13:24,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,049 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:26 [2018-01-28 22:13:24,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-28 22:13:24,060 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:24,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:13:24,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-28 22:13:24,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:24,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:13:24,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:26 [2018-01-28 22:13:24,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:24,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:24,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:13:24,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2018-01-28 22:13:24,166 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-01-28 22:13:24,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:13:24,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-28 22:13:24,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:13:24,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,207 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-01-28 22:13:24,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-01-28 22:13:24,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:24,289 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:13:24,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-01-28 22:13:24,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,323 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-01-28 22:13:24,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:24,327 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 27 [2018-01-28 22:13:24,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:24,365 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:71, output treesize:103 [2018-01-28 22:13:24,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:24,582 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:13:24,585 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 0 case distinctions, treesize of input 92 treesize of output 94 [2018-01-28 22:13:24,592 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 17 treesize of output 14 [2018-01-28 22:13:24,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 22:13:24,607 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:13:24,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-01-28 22:13:24,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:24,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 22:13:24,646 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 59 treesize of output 45 [2018-01-28 22:13:24,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:24,649 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:13:24,649 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 33 treesize of output 18 [2018-01-28 22:13:24,650 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:13:24,662 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-28 22:13:24,667 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:13:24,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2018-01-28 22:13:24,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:24,676 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:13:24,677 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 41 treesize of output 22 [2018-01-28 22:13:24,677 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,687 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 11 treesize of output 4 [2018-01-28 22:13:24,687 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,690 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:24,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-28 22:13:24,710 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:141, output treesize:28 [2018-01-28 22:13:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:24,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:13:24,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-01-28 22:13:24,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-28 22:13:24,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-28 22:13:24,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-01-28 22:13:24,817 INFO L87 Difference]: Start difference. First operand 384 states and 454 transitions. Second operand 31 states. [2018-01-28 22:13:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:32,827 INFO L93 Difference]: Finished difference Result 444 states and 518 transitions. [2018-01-28 22:13:32,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 22:13:32,827 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 77 [2018-01-28 22:13:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:32,828 INFO L225 Difference]: With dead ends: 444 [2018-01-28 22:13:32,828 INFO L226 Difference]: Without dead ends: 371 [2018-01-28 22:13:32,829 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=438, Invalid=2318, Unknown=0, NotChecked=0, Total=2756 [2018-01-28 22:13:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-01-28 22:13:32,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 341. [2018-01-28 22:13:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-01-28 22:13:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 404 transitions. [2018-01-28 22:13:32,842 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 404 transitions. Word has length 77 [2018-01-28 22:13:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:32,843 INFO L432 AbstractCegarLoop]: Abstraction has 341 states and 404 transitions. [2018-01-28 22:13:32,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-28 22:13:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 404 transitions. [2018-01-28 22:13:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-28 22:13:32,844 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:32,844 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:32,844 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:32,844 INFO L82 PathProgramCache]: Analyzing trace with hash -111328409, now seen corresponding path program 1 times [2018-01-28 22:13:32,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:32,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:32,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:32,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:32,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:32,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:32,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:13:32,932 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:13:32,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:32,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:13:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:33,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:13:33,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-28 22:13:33,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:13:33,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:13:33,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:13:33,048 INFO L87 Difference]: Start difference. First operand 341 states and 404 transitions. Second operand 9 states. [2018-01-28 22:13:33,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:33,149 INFO L93 Difference]: Finished difference Result 1009 states and 1235 transitions. [2018-01-28 22:13:33,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:13:33,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-01-28 22:13:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:33,152 INFO L225 Difference]: With dead ends: 1009 [2018-01-28 22:13:33,152 INFO L226 Difference]: Without dead ends: 714 [2018-01-28 22:13:33,153 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:13:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-01-28 22:13:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 301. [2018-01-28 22:13:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-01-28 22:13:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 358 transitions. [2018-01-28 22:13:33,163 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 358 transitions. Word has length 84 [2018-01-28 22:13:33,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:33,163 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 358 transitions. [2018-01-28 22:13:33,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:13:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 358 transitions. [2018-01-28 22:13:33,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-28 22:13:33,163 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:33,163 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:33,164 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:33,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1030209568, now seen corresponding path program 1 times [2018-01-28 22:13:33,164 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:33,164 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:33,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:33,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:33,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:33,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-28 22:13:33,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:13:33,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:13:33,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:13:33,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:13:33,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:13:33,215 INFO L87 Difference]: Start difference. First operand 301 states and 358 transitions. Second operand 4 states. [2018-01-28 22:13:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:13:33,280 INFO L93 Difference]: Finished difference Result 768 states and 935 transitions. [2018-01-28 22:13:33,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:13:33,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-01-28 22:13:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:13:33,283 INFO L225 Difference]: With dead ends: 768 [2018-01-28 22:13:33,284 INFO L226 Difference]: Without dead ends: 513 [2018-01-28 22:13:33,284 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:13:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-01-28 22:13:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 314. [2018-01-28 22:13:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-01-28 22:13:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 371 transitions. [2018-01-28 22:13:33,300 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 371 transitions. Word has length 86 [2018-01-28 22:13:33,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:13:33,300 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 371 transitions. [2018-01-28 22:13:33,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:13:33,300 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 371 transitions. [2018-01-28 22:13:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-28 22:13:33,301 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:13:33,301 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:13:33,302 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:13:33,302 INFO L82 PathProgramCache]: Analyzing trace with hash -181743037, now seen corresponding path program 1 times [2018-01-28 22:13:33,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:13:33,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:13:33,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:33,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:33,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:13:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:33,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:13:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:33,745 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:13:33,746 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:13:33,751 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:13:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:13:33,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:13:33,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:13:33,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:33,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:33,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 22:13:33,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:33,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:33,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:13:33,891 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 16 treesize of output 9 [2018-01-28 22:13:33,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:33,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:33,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-01-28 22:13:34,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:13:34,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:13:34,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:34,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:34,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:34,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-28 22:13:34,043 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 47 treesize of output 43 [2018-01-28 22:13:34,046 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-01-28 22:13:34,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:34,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:34,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:13:34,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:36 [2018-01-28 22:13:34,097 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 43 treesize of output 29 [2018-01-28 22:13:34,112 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-01-28 22:13:34,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:34,131 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 8 treesize of output 4 [2018-01-28 22:13:34,131 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:13:34,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:34,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:13:34,138 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:5 [2018-01-28 22:13:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:13:34,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:13:34,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-01-28 22:13:34,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-28 22:13:34,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-28 22:13:34,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-01-28 22:13:34,197 INFO L87 Difference]: Start difference. First operand 314 states and 371 transitions. Second operand 23 states. [2018-01-28 22:13:44,617 WARN L146 SmtUtils]: Spent 4047ms on a formula simplification. DAG size of input: 55 DAG size of output 47 [2018-01-28 22:13:50,662 WARN L146 SmtUtils]: Spent 4031ms on a formula simplification. DAG size of input: 44 DAG size of output 38 [2018-01-28 22:14:01,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:14:01,318 INFO L93 Difference]: Finished difference Result 374 states and 411 transitions. [2018-01-28 22:14:01,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-28 22:14:01,318 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 88 [2018-01-28 22:14:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:14:01,320 INFO L225 Difference]: With dead ends: 374 [2018-01-28 22:14:01,320 INFO L226 Difference]: Without dead ends: 340 [2018-01-28 22:14:01,321 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=534, Invalid=1810, Unknown=8, NotChecked=0, Total=2352 [2018-01-28 22:14:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-01-28 22:14:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 309. [2018-01-28 22:14:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-01-28 22:14:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 364 transitions. [2018-01-28 22:14:01,330 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 364 transitions. Word has length 88 [2018-01-28 22:14:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:14:01,330 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 364 transitions. [2018-01-28 22:14:01,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-28 22:14:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 364 transitions. [2018-01-28 22:14:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-28 22:14:01,331 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:14:01,331 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:14:01,331 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:14:01,331 INFO L82 PathProgramCache]: Analyzing trace with hash -181743036, now seen corresponding path program 1 times [2018-01-28 22:14:01,331 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:14:01,331 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:14:01,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:01,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:01,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:01,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:14:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:01,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:14:01,743 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:14:01,749 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:01,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:14:01,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:14:01,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:01,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:01,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-28 22:14:01,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:01,914 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:01,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:01,915 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 16 treesize of output 9 [2018-01-28 22:14:01,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:01,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:01,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-01-28 22:14:01,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:14:01,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:01,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:01,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:01,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:14:01,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:01,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:01,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:01,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:01,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-01-28 22:14:02,020 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 27 treesize of output 28 [2018-01-28 22:14:02,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:14:02,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:02,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:02,040 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 56 treesize of output 52 [2018-01-28 22:14:02,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:14:02,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:02,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:02,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:02,057 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:74, output treesize:44 [2018-01-28 22:14:02,097 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 41 treesize of output 27 [2018-01-28 22:14:02,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-01-28 22:14:02,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:02,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-01-28 22:14:02,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:02,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:02,111 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 15 treesize of output 11 [2018-01-28 22:14:02,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 22:14:02,113 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:02,115 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:02,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:02,132 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:55, output treesize:9 [2018-01-28 22:14:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:02,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:14:02,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-01-28 22:14:02,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:14:02,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:14:02,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-01-28 22:14:02,185 INFO L87 Difference]: Start difference. First operand 309 states and 364 transitions. Second operand 21 states. [2018-01-28 22:14:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:14:03,446 INFO L93 Difference]: Finished difference Result 340 states and 374 transitions. [2018-01-28 22:14:03,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-28 22:14:03,446 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2018-01-28 22:14:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:14:03,447 INFO L225 Difference]: With dead ends: 340 [2018-01-28 22:14:03,447 INFO L226 Difference]: Without dead ends: 339 [2018-01-28 22:14:03,448 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=419, Invalid=1387, Unknown=0, NotChecked=0, Total=1806 [2018-01-28 22:14:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-01-28 22:14:03,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 309. [2018-01-28 22:14:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-01-28 22:14:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 363 transitions. [2018-01-28 22:14:03,456 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 363 transitions. Word has length 88 [2018-01-28 22:14:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:14:03,457 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 363 transitions. [2018-01-28 22:14:03,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:14:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 363 transitions. [2018-01-28 22:14:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-28 22:14:03,457 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:14:03,457 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:14:03,457 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:14:03,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1091811079, now seen corresponding path program 1 times [2018-01-28 22:14:03,458 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:14:03,458 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:14:03,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:03,458 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:03,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:03,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:14:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-28 22:14:03,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:14:03,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:14:03,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:14:03,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:14:03,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:14:03,573 INFO L87 Difference]: Start difference. First operand 309 states and 363 transitions. Second operand 6 states. [2018-01-28 22:14:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:14:03,749 INFO L93 Difference]: Finished difference Result 309 states and 363 transitions. [2018-01-28 22:14:03,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:14:03,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-01-28 22:14:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:14:03,750 INFO L225 Difference]: With dead ends: 309 [2018-01-28 22:14:03,750 INFO L226 Difference]: Without dead ends: 308 [2018-01-28 22:14:03,751 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:14:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-01-28 22:14:03,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-01-28 22:14:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-01-28 22:14:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 361 transitions. [2018-01-28 22:14:03,760 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 361 transitions. Word has length 95 [2018-01-28 22:14:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:14:03,760 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 361 transitions. [2018-01-28 22:14:03,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:14:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 361 transitions. [2018-01-28 22:14:03,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-28 22:14:03,761 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:14:03,761 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:14:03,761 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:14:03,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1091811080, now seen corresponding path program 1 times [2018-01-28 22:14:03,761 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:14:03,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:14:03,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:03,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:03,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:03,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:14:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:04,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:14:04,132 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:14:04,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:04,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:14:04,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:14:04,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-28 22:14:04,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:04,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:04,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:14:04,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-28 22:14:04,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:14:04,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:04,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-28 22:14:04,341 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-01-28 22:14:04,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:04,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2018-01-28 22:14:04,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-28 22:14:04,413 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-01-28 22:14:04,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-01-28 22:14:04,433 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-01-28 22:14:04,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,436 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:04,439 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-01-28 22:14:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:04,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:14:04,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 24 [2018-01-28 22:14:04,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 22:14:04,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 22:14:04,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-01-28 22:14:04,535 INFO L87 Difference]: Start difference. First operand 308 states and 361 transitions. Second operand 25 states. [2018-01-28 22:14:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:14:05,913 INFO L93 Difference]: Finished difference Result 413 states and 451 transitions. [2018-01-28 22:14:05,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-28 22:14:05,913 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 95 [2018-01-28 22:14:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:14:05,914 INFO L225 Difference]: With dead ends: 413 [2018-01-28 22:14:05,914 INFO L226 Difference]: Without dead ends: 411 [2018-01-28 22:14:05,915 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=644, Invalid=2218, Unknown=0, NotChecked=0, Total=2862 [2018-01-28 22:14:05,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-01-28 22:14:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 308. [2018-01-28 22:14:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-01-28 22:14:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 359 transitions. [2018-01-28 22:14:05,925 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 359 transitions. Word has length 95 [2018-01-28 22:14:05,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:14:05,925 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 359 transitions. [2018-01-28 22:14:05,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 22:14:05,925 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 359 transitions. [2018-01-28 22:14:05,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-28 22:14:05,926 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:14:05,926 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:14:05,926 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:14:05,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1319470225, now seen corresponding path program 1 times [2018-01-28 22:14:05,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:14:05,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:14:05,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:05,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:05,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:05,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:14:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:06,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:14:06,934 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:14:06,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:06,983 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:14:06,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:14:06,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:06,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:06,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-28 22:14:07,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:14:07,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:14:07,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-01-28 22:14:07,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:07,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:07,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:07,092 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 28 treesize of output 42 [2018-01-28 22:14:07,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:39 [2018-01-28 22:14:07,159 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 33 treesize of output 34 [2018-01-28 22:14:07,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:07,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-01-28 22:14:07,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-01-28 22:14:07,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:07,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 22 treesize of output 14 [2018-01-28 22:14:07,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2018-01-28 22:14:07,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-01-28 22:14:07,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:07,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:14:07,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:07,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:46 [2018-01-28 22:14:07,332 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:07,334 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:07,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:07,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:07,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 65 [2018-01-28 22:14:07,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:07,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:73 [2018-01-28 22:14:07,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 59 [2018-01-28 22:14:07,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:07,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:07,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:76 [2018-01-28 22:14:07,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-01-28 22:14:07,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:07,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-01-28 22:14:07,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:07,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:83 [2018-01-28 22:14:07,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2018-01-28 22:14:07,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-28 22:14:07,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:07,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:07,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:146 [2018-01-28 22:14:08,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 94 [2018-01-28 22:14:08,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 39 [2018-01-28 22:14:08,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:08,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-01-28 22:14:08,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:08,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-28 22:14:08,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:08,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:08,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-28 22:14:08,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-28 22:14:08,099 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:08,100 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:08,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:08,112 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:158, output treesize:45 [2018-01-28 22:14:08,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:08,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 47 [2018-01-28 22:14:08,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:08,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:08,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2018-01-28 22:14:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:08,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:14:08,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2018-01-28 22:14:08,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-28 22:14:08,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-28 22:14:08,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1598, Unknown=0, NotChecked=0, Total=1806 [2018-01-28 22:14:08,397 INFO L87 Difference]: Start difference. First operand 308 states and 359 transitions. Second operand 43 states. [2018-01-28 22:14:09,479 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 94 DAG size of output 80 [2018-01-28 22:14:10,802 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 105 DAG size of output 92 [2018-01-28 22:14:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:14:12,386 INFO L93 Difference]: Finished difference Result 445 states and 508 transitions. [2018-01-28 22:14:12,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-28 22:14:12,386 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 102 [2018-01-28 22:14:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:14:12,387 INFO L225 Difference]: With dead ends: 445 [2018-01-28 22:14:12,387 INFO L226 Difference]: Without dead ends: 444 [2018-01-28 22:14:12,389 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=991, Invalid=5329, Unknown=0, NotChecked=0, Total=6320 [2018-01-28 22:14:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-01-28 22:14:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 305. [2018-01-28 22:14:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-01-28 22:14:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 353 transitions. [2018-01-28 22:14:12,401 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 353 transitions. Word has length 102 [2018-01-28 22:14:12,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:14:12,401 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 353 transitions. [2018-01-28 22:14:12,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-28 22:14:12,401 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 353 transitions. [2018-01-28 22:14:12,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-28 22:14:12,402 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:14:12,402 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:14:12,402 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:14:12,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1319470224, now seen corresponding path program 1 times [2018-01-28 22:14:12,402 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:14:12,403 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:14:12,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:12,403 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:12,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:12,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:14:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:13,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:14:13,597 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 22:14:13,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:13,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:14:13,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 22:14:13,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 22:14:13,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:14:13,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:14:13,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-01-28 22:14:13,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:14:13,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:14:13,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:14:13,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:14:13,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-01-28 22:14:13,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:13,845 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:13,846 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:13,846 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 28 treesize of output 42 [2018-01-28 22:14:13,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-01-28 22:14:13,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:69 [2018-01-28 22:14:13,942 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 21 treesize of output 22 [2018-01-28 22:14:13,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:13,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-28 22:14:13,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:13,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:13,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:83 [2018-01-28 22:14:14,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-01-28 22:14:14,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:14,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:14:14,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,069 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 59 treesize of output 58 [2018-01-28 22:14:14,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:14,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:14:14,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:83 [2018-01-28 22:14:14,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-01-28 22:14:14,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:14,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:14:14,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,135 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 59 treesize of output 58 [2018-01-28 22:14:14,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:14,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:14:14,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:83 [2018-01-28 22:14:14,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:14,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:14,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:14,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 59 [2018-01-28 22:14:14,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:14,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:14,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:14,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:14,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-01-28 22:14:14,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:85 [2018-01-28 22:14:14,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-01-28 22:14:14,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:14,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 59 [2018-01-28 22:14:14,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:14,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:88 [2018-01-28 22:14:14,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-01-28 22:14:14,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:14,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-01-28 22:14:14,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-01-28 22:14:14,485 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:14,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 22:14:14,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,492 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:102 [2018-01-28 22:14:14,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 118 [2018-01-28 22:14:14,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-28 22:14:14,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 79 [2018-01-28 22:14:14,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-28 22:14:14,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:14,666 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:158, output treesize:220 [2018-01-28 22:14:14,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 155 [2018-01-28 22:14:14,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 43 [2018-01-28 22:14:14,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:15,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 65 [2018-01-28 22:14:15,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:15,029 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 1 [2018-01-28 22:14:15,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:15,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:15,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:15,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:238, output treesize:86 [2018-01-28 22:14:15,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-01-28 22:14:15,128 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 32 treesize of output 16 [2018-01-28 22:14:15,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:15,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-01-28 22:14:15,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:15,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-28 22:14:15,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:15,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:15,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:15,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:47 [2018-01-28 22:14:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:15,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:14:15,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 38 [2018-01-28 22:14:15,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-28 22:14:15,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-28 22:14:15,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1314, Unknown=0, NotChecked=0, Total=1482 [2018-01-28 22:14:15,405 INFO L87 Difference]: Start difference. First operand 305 states and 353 transitions. Second operand 39 states. [2018-01-28 22:14:16,400 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 106 DAG size of output 80 [2018-01-28 22:14:16,604 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 110 DAG size of output 84 [2018-01-28 22:14:16,847 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 136 DAG size of output 101 [2018-01-28 22:14:17,272 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 102 DAG size of output 81 [2018-01-28 22:14:17,488 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 83 DAG size of output 78 [2018-01-28 22:14:17,673 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 108 DAG size of output 87 [2018-01-28 22:14:18,127 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 119 DAG size of output 95 [2018-01-28 22:14:18,393 WARN L146 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 134 DAG size of output 108 [2018-01-28 22:14:18,548 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 100 DAG size of output 76 [2018-01-28 22:14:18,707 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 102 DAG size of output 78 [2018-01-28 22:14:18,857 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 100 DAG size of output 76 [2018-01-28 22:14:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:14:20,174 INFO L93 Difference]: Finished difference Result 476 states and 541 transitions. [2018-01-28 22:14:20,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-28 22:14:20,174 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2018-01-28 22:14:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:14:20,176 INFO L225 Difference]: With dead ends: 476 [2018-01-28 22:14:20,176 INFO L226 Difference]: Without dead ends: 474 [2018-01-28 22:14:20,177 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 79 SyntacticMatches, 16 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1787 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1096, Invalid=5066, Unknown=0, NotChecked=0, Total=6162 [2018-01-28 22:14:20,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-01-28 22:14:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 323. [2018-01-28 22:14:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-01-28 22:14:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 382 transitions. [2018-01-28 22:14:20,188 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 382 transitions. Word has length 102 [2018-01-28 22:14:20,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:14:20,188 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 382 transitions. [2018-01-28 22:14:20,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-28 22:14:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 382 transitions. [2018-01-28 22:14:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-28 22:14:20,188 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:14:20,189 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:14:20,189 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:14:20,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2046095538, now seen corresponding path program 1 times [2018-01-28 22:14:20,189 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:14:20,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:14:20,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:20,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:20,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:20,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:14:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:20,571 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:14:20,571 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 22:14:20,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:20,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:14:20,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-28 22:14:20,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-28 22:14:20,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:20,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:20,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-28 22:14:20,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-28 22:14:20,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:20,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:20,754 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 17 treesize of output 15 [2018-01-28 22:14:20,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-28 22:14:20,756 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:20,760 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:20,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-28 22:14:20,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-28 22:14:20,771 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:20,774 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:20,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:14:20,809 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2018-01-28 22:14:20,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:20,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-28 22:14:20,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:20,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:14:20,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-01-28 22:14:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:20,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:14:20,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2018-01-28 22:14:20,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-28 22:14:20,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-28 22:14:20,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-01-28 22:14:20,975 INFO L87 Difference]: Start difference. First operand 323 states and 382 transitions. Second operand 24 states. [2018-01-28 22:14:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:14:22,127 INFO L93 Difference]: Finished difference Result 453 states and 506 transitions. [2018-01-28 22:14:22,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 22:14:22,128 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 103 [2018-01-28 22:14:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:14:22,129 INFO L225 Difference]: With dead ends: 453 [2018-01-28 22:14:22,129 INFO L226 Difference]: Without dead ends: 447 [2018-01-28 22:14:22,130 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=414, Invalid=1566, Unknown=0, NotChecked=0, Total=1980 [2018-01-28 22:14:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-01-28 22:14:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 337. [2018-01-28 22:14:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-01-28 22:14:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 401 transitions. [2018-01-28 22:14:22,143 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 401 transitions. Word has length 103 [2018-01-28 22:14:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:14:22,144 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 401 transitions. [2018-01-28 22:14:22,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-28 22:14:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 401 transitions. [2018-01-28 22:14:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-28 22:14:22,144 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:14:22,144 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:14:22,144 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:14:22,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2046095539, now seen corresponding path program 1 times [2018-01-28 22:14:22,145 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:14:22,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:14:22,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:22,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:22,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:22,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:14:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-28 22:14:22,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:14:22,286 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:14:22,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:22,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:14:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-28 22:14:22,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:14:22,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-01-28 22:14:22,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:14:22,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:14:22,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:14:22,407 INFO L87 Difference]: Start difference. First operand 337 states and 401 transitions. Second operand 9 states. [2018-01-28 22:14:22,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:14:22,721 INFO L93 Difference]: Finished difference Result 394 states and 445 transitions. [2018-01-28 22:14:22,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:14:22,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2018-01-28 22:14:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:14:22,722 INFO L225 Difference]: With dead ends: 394 [2018-01-28 22:14:22,722 INFO L226 Difference]: Without dead ends: 389 [2018-01-28 22:14:22,723 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-01-28 22:14:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-28 22:14:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 348. [2018-01-28 22:14:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-01-28 22:14:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 413 transitions. [2018-01-28 22:14:22,736 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 413 transitions. Word has length 103 [2018-01-28 22:14:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:14:22,736 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 413 transitions. [2018-01-28 22:14:22,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:14:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 413 transitions. [2018-01-28 22:14:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-28 22:14:22,736 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:14:22,737 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:14:22,737 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:14:22,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2046096118, now seen corresponding path program 1 times [2018-01-28 22:14:22,737 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:14:22,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:14:22,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:22,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:22,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:22,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:14:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:23,565 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:14:23,565 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:14:23,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:23,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:14:23,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:23,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:23,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-28 22:14:23,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:23,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:23,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-01-28 22:14:23,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:14:23,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:23,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:23,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:23,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:23,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-01-28 22:14:23,820 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2018-01-28 22:14:23,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:23,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 48 [2018-01-28 22:14:23,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:23,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-01-28 22:14:23,844 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:23,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:23,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:23,862 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:60 [2018-01-28 22:14:24,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 78 [2018-01-28 22:14:24,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 63 [2018-01-28 22:14:24,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:24,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:24,398 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 63 treesize of output 56 [2018-01-28 22:14:24,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:24,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:24,436 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 72 [2018-01-28 22:14:24,437 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 22:14:24,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-28 22:14:24,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-01-28 22:14:24,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-01-28 22:14:24,539 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:24,547 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:24,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-28 22:14:24,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-01-28 22:14:24,550 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:24,558 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:24,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-01-28 22:14:24,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-01-28 22:14:24,562 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:24,572 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:24,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2018-01-28 22:14:24,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-01-28 22:14:24,625 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:24,635 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:24,681 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 85 treesize of output 57 [2018-01-28 22:14:24,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 24 [2018-01-28 22:14:24,688 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:14:24,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2018-01-28 22:14:24,703 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:24,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2018-01-28 22:14:24,705 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:24,722 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:14:24,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-01-28 22:14:24,775 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:193, output treesize:141 [2018-01-28 22:14:24,996 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:24,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-28 22:14:24,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:25,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:25,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-01-28 22:14:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:25,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:14:25,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 40 [2018-01-28 22:14:25,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-28 22:14:25,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-28 22:14:25,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1484, Unknown=0, NotChecked=0, Total=1640 [2018-01-28 22:14:25,141 INFO L87 Difference]: Start difference. First operand 348 states and 413 transitions. Second operand 41 states. [2018-01-28 22:14:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:14:28,168 INFO L93 Difference]: Finished difference Result 507 states and 563 transitions. [2018-01-28 22:14:28,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-28 22:14:28,168 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 103 [2018-01-28 22:14:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:14:28,170 INFO L225 Difference]: With dead ends: 507 [2018-01-28 22:14:28,170 INFO L226 Difference]: Without dead ends: 506 [2018-01-28 22:14:28,172 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2441 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1052, Invalid=6604, Unknown=0, NotChecked=0, Total=7656 [2018-01-28 22:14:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-01-28 22:14:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 348. [2018-01-28 22:14:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-01-28 22:14:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 412 transitions. [2018-01-28 22:14:28,187 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 412 transitions. Word has length 103 [2018-01-28 22:14:28,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:14:28,187 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 412 transitions. [2018-01-28 22:14:28,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-28 22:14:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 412 transitions. [2018-01-28 22:14:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-28 22:14:28,188 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:14:28,188 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:14:28,188 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:14:28,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2046096119, now seen corresponding path program 1 times [2018-01-28 22:14:28,189 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:14:28,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:14:28,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:28,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:28,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:28,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:14:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:28,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:14:28,721 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:14:28,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:28,764 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:14:28,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 22:14:28,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:28,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:28,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-28 22:14:28,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:14:28,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:28,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:28,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-01-28 22:14:28,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:14:28,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:28,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:28,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:28,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:28,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-01-28 22:14:29,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2018-01-28 22:14:29,023 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 53 treesize of output 52 [2018-01-28 22:14:29,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:29,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:29,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-01-28 22:14:29,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-28 22:14:29,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:29,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:29,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:29,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:72, output treesize:60 [2018-01-28 22:14:29,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 95 [2018-01-28 22:14:29,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:29,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 85 [2018-01-28 22:14:29,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:29,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 63 [2018-01-28 22:14:29,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:29,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:29,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:29,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 91 [2018-01-28 22:14:29,480 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-28 22:14:29,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-01-28 22:14:29,595 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 102 treesize of output 85 [2018-01-28 22:14:29,597 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 51 treesize of output 41 [2018-01-28 22:14:29,597 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:29,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2018-01-28 22:14:29,616 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:14:29,631 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-28 22:14:29,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 5 xjuncts. [2018-01-28 22:14:29,709 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:205, output treesize:314 [2018-01-28 22:14:29,976 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 121 DAG size of output 87 [2018-01-28 22:14:30,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2018-01-28 22:14:30,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:30,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-01-28 22:14:30,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:30,159 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 31 treesize of output 24 [2018-01-28 22:14:30,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:30,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:30,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:30,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:30,184 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 53 [2018-01-28 22:14:30,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-01-28 22:14:30,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-28 22:14:30,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 62 [2018-01-28 22:14:30,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:30,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-01-28 22:14:30,286 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:30,310 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 35 treesize of output 26 [2018-01-28 22:14:30,310 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:30,331 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:30,332 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:30,332 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:30,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:30,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-01-28 22:14:30,335 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-28 22:14:30,351 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:30,407 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 62 treesize of output 50 [2018-01-28 22:14:30,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:30,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-01-28 22:14:30,411 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:30,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-28 22:14:30,419 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:30,424 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:30,472 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 59 treesize of output 49 [2018-01-28 22:14:30,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-01-28 22:14:30,474 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:30,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2018-01-28 22:14:30,488 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-01-28 22:14:30,497 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:14:30,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-01-28 22:14:30,551 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 15 variables, input treesize:248, output treesize:123 [2018-01-28 22:14:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:30,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:14:30,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 35 [2018-01-28 22:14:30,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-28 22:14:30,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-28 22:14:30,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2018-01-28 22:14:30,812 INFO L87 Difference]: Start difference. First operand 348 states and 412 transitions. Second operand 36 states. [2018-01-28 22:14:32,611 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 184 DAG size of output 61 [2018-01-28 22:14:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:14:34,121 INFO L93 Difference]: Finished difference Result 446 states and 502 transitions. [2018-01-28 22:14:34,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-28 22:14:34,121 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2018-01-28 22:14:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:14:34,123 INFO L225 Difference]: With dead ends: 446 [2018-01-28 22:14:34,123 INFO L226 Difference]: Without dead ends: 444 [2018-01-28 22:14:34,124 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 80 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1047, Invalid=5273, Unknown=0, NotChecked=0, Total=6320 [2018-01-28 22:14:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-01-28 22:14:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 368. [2018-01-28 22:14:34,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-01-28 22:14:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 440 transitions. [2018-01-28 22:14:34,138 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 440 transitions. Word has length 103 [2018-01-28 22:14:34,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:14:34,138 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 440 transitions. [2018-01-28 22:14:34,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-28 22:14:34,138 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 440 transitions. [2018-01-28 22:14:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-28 22:14:34,139 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:14:34,139 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:14:34,139 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:14:34,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1942514367, now seen corresponding path program 1 times [2018-01-28 22:14:34,139 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:14:34,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:14:34,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:34,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:34,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:34,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:14:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:34,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:14:34,880 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:14:34,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:34,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:14:34,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:14:34,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:34,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:34,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:34,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:14:34,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:34,965 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:34,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:34,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:34,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-01-28 22:14:35,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-28 22:14:35,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:35,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 22:14:35,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-28 22:14:35,040 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:35,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 22:14:35,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,052 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 [2018-01-28 22:14:35,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:35,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:35,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:14:35,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-01-28 22:14:35,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-28 22:14:35,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:35,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,146 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-01-28 22:14:35,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:35,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,159 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-01-28 22:14:35,193 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-01-28 22:14:35,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:35,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:14:35,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,216 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-01-28 22:14:35,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:35,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:14:35,219 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2018-01-28 22:14:35,236 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-01-28 22:14:35,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:35,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:14:35,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,269 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-01-28 22:14:35,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:35,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:14:35,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,286 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2018-01-28 22:14:35,414 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-01-28 22:14:35,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-28 22:14:35,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,482 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 28 treesize of output 36 [2018-01-28 22:14:35,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 22:14:35,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:14:35,551 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-01-28 22:14:35,555 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-28 22:14:35,555 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,591 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 27 treesize of output 26 [2018-01-28 22:14:35,591 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,608 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:14:35,625 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:72, output treesize:122 [2018-01-28 22:14:35,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 79 [2018-01-28 22:14:35,734 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 23 treesize of output 15 [2018-01-28 22:14:35,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,790 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:35,792 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 75 treesize of output 77 [2018-01-28 22:14:35,795 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 28 treesize of output 26 [2018-01-28 22:14:35,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:35,845 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:35,846 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 64 treesize of output 72 [2018-01-28 22:14:35,848 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 35 [2018-01-28 22:14:35,848 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,862 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,895 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:35,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 77 [2018-01-28 22:14:35,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 42 [2018-01-28 22:14:35,907 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,918 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:35,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:14:35,942 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:159, output treesize:123 [2018-01-28 22:14:36,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 160 [2018-01-28 22:14:36,046 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 122 treesize of output 133 [2018-01-28 22:14:36,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:36,149 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:36,156 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 99 treesize of output 120 [2018-01-28 22:14:36,157 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 22:14:36,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:14:36,332 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 66 treesize of output 61 [2018-01-28 22:14:36,334 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:36,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 48 [2018-01-28 22:14:36,334 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:36,345 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:36,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:36,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:36,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 74 [2018-01-28 22:14:36,407 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 57 [2018-01-28 22:14:36,408 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:14:36,424 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:36,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:36,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:36,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:36,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2018-01-28 22:14:36,490 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 108 [2018-01-28 22:14:36,491 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-28 22:14:36,535 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-28 22:14:36,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:36,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 111 [2018-01-28 22:14:36,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 82 [2018-01-28 22:14:36,566 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:36,579 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:36,660 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 80 treesize of output 97 [2018-01-28 22:14:36,660 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:36,699 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:36,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-01-28 22:14:36,772 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:172, output treesize:502 [2018-01-28 22:14:37,257 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 106 DAG size of output 70 [2018-01-28 22:14:37,963 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 86 DAG size of output 85 [2018-01-28 22:14:37,972 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:37,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 204 [2018-01-28 22:14:37,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-01-28 22:14:37,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:38,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:38,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:38,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:38,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:38,142 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 163 treesize of output 151 [2018-01-28 22:14:38,169 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 143 treesize of output 148 [2018-01-28 22:14:38,177 INFO L267 ElimStorePlain]: Start of recursive call 5: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 9 xjuncts. [2018-01-28 22:14:39,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2018-01-28 22:14:41,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:41,796 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:41,798 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 150 treesize of output 164 [2018-01-28 22:14:41,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 84 [2018-01-28 22:14:41,801 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:41,817 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:41,825 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:41,828 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 98 treesize of output 100 [2018-01-28 22:14:41,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-01-28 22:14:41,832 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:41,853 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:41,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:41,856 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:41,858 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 123 treesize of output 129 [2018-01-28 22:14:41,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-01-28 22:14:41,862 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:41,885 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:41,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:41,889 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:41,891 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 111 treesize of output 117 [2018-01-28 22:14:41,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-01-28 22:14:41,894 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:41,909 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:41,912 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:41,913 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:41,915 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 175 treesize of output 200 [2018-01-28 22:14:41,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-01-28 22:14:41,917 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:41,945 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:41,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:41,948 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:41,950 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 106 treesize of output 119 [2018-01-28 22:14:41,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-01-28 22:14:41,953 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:41,969 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:41,971 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:41,973 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:41,975 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 147 treesize of output 177 [2018-01-28 22:14:41,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 84 [2018-01-28 22:14:41,977 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:41,994 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:42,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:42,259 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:42,261 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:42,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 151 [2018-01-28 22:14:42,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 61 [2018-01-28 22:14:42,268 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:42,286 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:42,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:42,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:42,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 143 [2018-01-28 22:14:42,534 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 129 [2018-01-28 22:14:42,536 INFO L267 ElimStorePlain]: Start of recursive call 23: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-28 22:14:42,591 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-28 22:14:42,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:42,886 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:42,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:42,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:42,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 129 [2018-01-28 22:14:42,894 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:42,905 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 98 [2018-01-28 22:14:42,906 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-28 22:14:42,936 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:43,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 17 dim-0 vars, and 11 xjuncts. [2018-01-28 22:14:43,203 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 8 variables, input treesize:453, output treesize:1305 [2018-01-28 22:14:47,786 WARN L146 SmtUtils]: Spent 4307ms on a formula simplification. DAG size of input: 316 DAG size of output 89 [2018-01-28 22:14:47,985 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 114 treesize of output 95 [2018-01-28 22:14:47,987 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 17 treesize of output 9 [2018-01-28 22:14:47,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-01-28 22:14:48,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,056 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 50 treesize of output 36 [2018-01-28 22:14:48,057 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 17 treesize of output 13 [2018-01-28 22:14:48,057 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,063 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 18 treesize of output 8 [2018-01-28 22:14:48,064 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,067 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,102 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:48,108 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 120 [2018-01-28 22:14:48,111 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 108 treesize of output 99 [2018-01-28 22:14:48,111 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:48,145 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:48,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2018-01-28 22:14:48,146 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:48,178 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 80 treesize of output 65 [2018-01-28 22:14:48,179 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 89 [2018-01-28 22:14:48,208 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:48,236 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:48,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 92 [2018-01-28 22:14:48,247 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-28 22:14:48,315 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-28 22:14:48,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 57 [2018-01-28 22:14:48,403 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-01-28 22:14:48,404 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-01-28 22:14:48,429 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,453 INFO L267 ElimStorePlain]: Start of recursive call 14: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-01-28 22:14:48,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 22:14:48,458 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,467 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 9 [2018-01-28 22:14:48,467 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,476 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-01-28 22:14:48,476 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,482 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 60 [2018-01-28 22:14:48,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:48,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-01-28 22:14:48,493 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-01-28 22:14:48,521 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,545 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 30 treesize of output 23 [2018-01-28 22:14:48,546 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,567 INFO L267 ElimStorePlain]: Start of recursive call 21: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 63 [2018-01-28 22:14:48,577 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:48,577 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 55 treesize of output 51 [2018-01-28 22:14:48,577 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,605 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-01-28 22:14:48,605 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,630 INFO L267 ElimStorePlain]: Start of recursive call 25: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:48,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-01-28 22:14:48,692 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:48,693 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 58 treesize of output 47 [2018-01-28 22:14:48,693 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2018-01-28 22:14:48,705 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,713 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,756 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 49 treesize of output 37 [2018-01-28 22:14:48,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:48,758 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 20 treesize of output 13 [2018-01-28 22:14:48,758 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,765 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-01-28 22:14:48,765 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,769 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:48,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-28 22:14:48,805 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 11 variables, input treesize:353, output treesize:35 [2018-01-28 22:14:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:49,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:14:49,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 45 [2018-01-28 22:14:49,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-28 22:14:49,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-28 22:14:49,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1910, Unknown=9, NotChecked=0, Total=2070 [2018-01-28 22:14:49,013 INFO L87 Difference]: Start difference. First operand 368 states and 440 transitions. Second operand 46 states. [2018-01-28 22:14:51,000 WARN L146 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 113 DAG size of output 93 [2018-01-28 22:14:51,168 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 92 DAG size of output 82 [2018-01-28 22:14:51,504 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 109 DAG size of output 79 [2018-01-28 22:14:52,216 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 102 DAG size of output 90 [2018-01-28 22:14:52,816 WARN L146 SmtUtils]: Spent 505ms on a formula simplification. DAG size of input: 124 DAG size of output 98 [2018-01-28 22:14:53,192 WARN L146 SmtUtils]: Spent 309ms on a formula simplification. DAG size of input: 110 DAG size of output 91 [2018-01-28 22:14:53,687 WARN L146 SmtUtils]: Spent 396ms on a formula simplification. DAG size of input: 122 DAG size of output 96 [2018-01-28 22:14:53,997 WARN L146 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 131 DAG size of output 116 [2018-01-28 22:14:54,356 WARN L146 SmtUtils]: Spent 314ms on a formula simplification. DAG size of input: 127 DAG size of output 112 [2018-01-28 22:14:54,953 WARN L146 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 132 DAG size of output 117 [2018-01-28 22:14:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:14:56,230 INFO L93 Difference]: Finished difference Result 611 states and 712 transitions. [2018-01-28 22:14:56,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-28 22:14:56,230 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 109 [2018-01-28 22:14:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:14:56,232 INFO L225 Difference]: With dead ends: 611 [2018-01-28 22:14:56,233 INFO L226 Difference]: Without dead ends: 603 [2018-01-28 22:14:56,233 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=762, Invalid=4918, Unknown=20, NotChecked=0, Total=5700 [2018-01-28 22:14:56,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-01-28 22:14:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 525. [2018-01-28 22:14:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-01-28 22:14:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 643 transitions. [2018-01-28 22:14:56,254 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 643 transitions. Word has length 109 [2018-01-28 22:14:56,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:14:56,255 INFO L432 AbstractCegarLoop]: Abstraction has 525 states and 643 transitions. [2018-01-28 22:14:56,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-28 22:14:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 643 transitions. [2018-01-28 22:14:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-28 22:14:56,255 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:14:56,256 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:14:56,256 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, 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, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:14:56,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1942514366, now seen corresponding path program 1 times [2018-01-28 22:14:56,256 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:14:56,256 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:14:56,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:56,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:56,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:14:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:56,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:14:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:56,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:14:56,645 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:14:56,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:14:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:14:56,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:14:56,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:14:56,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:56,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-01-28 22:14:56,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-28 22:14:56,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:56,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 22:14:56,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-01-28 22:14:56,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:56,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:56,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:14:56,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-01-28 22:14:56,845 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-01-28 22:14:56,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:14:56,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-28 22:14:56,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-28 22:14:56,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:56,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:14:56,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2018-01-28 22:14:56,906 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-01-28 22:14:56,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:56,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:14:56,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:56,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:56,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:22 [2018-01-28 22:14:57,050 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-01-28 22:14:57,054 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-28 22:14:57,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:57,097 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 27 treesize of output 26 [2018-01-28 22:14:57,097 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:57,118 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 28 treesize of output 36 [2018-01-28 22:14:57,119 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-28 22:14:57,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:14:57,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:14:57,158 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:69 [2018-01-28 22:14:57,209 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:57,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:57,211 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 43 treesize of output 55 [2018-01-28 22:14:57,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-01-28 22:14:57,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:57,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:57,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 51 [2018-01-28 22:14:57,259 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 44 treesize of output 36 [2018-01-28 22:14:57,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:57,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:14:57,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:14:57,306 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:61 [2018-01-28 22:14:57,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:57,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:57,356 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 46 treesize of output 55 [2018-01-28 22:14:57,367 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 62 [2018-01-28 22:14:57,368 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:14:57,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:57,417 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 65 [2018-01-28 22:14:57,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-01-28 22:14:57,422 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:57,431 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:57,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2018-01-28 22:14:57,490 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:57,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:57,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 68 [2018-01-28 22:14:57,534 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-28 22:14:57,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:14:57,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:14:57,569 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:92, output treesize:81 [2018-01-28 22:14:58,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2018-01-28 22:14:58,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-28 22:14:58,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:58,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:58,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-01-28 22:14:58,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-28 22:14:58,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:58,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:58,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2018-01-28 22:14:58,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-28 22:14:58,322 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:58,329 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:58,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-28 22:14:58,353 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:181, output treesize:156 [2018-01-28 22:14:58,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 66 [2018-01-28 22:14:58,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2018-01-28 22:14:58,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:58,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-01-28 22:14:58,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:14:58,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:14:58,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:58,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2018-01-28 22:14:58,698 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 69 [2018-01-28 22:14:58,699 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-28 22:14:58,728 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-28 22:14:58,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:58,795 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 60 treesize of output 52 [2018-01-28 22:14:58,807 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 57 [2018-01-28 22:14:58,808 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-28 22:14:58,832 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-28 22:14:58,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-01-28 22:14:58,914 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:201, output treesize:430 [2018-01-28 22:14:59,358 WARN L146 SmtUtils]: Spent 258ms on a formula simplification. DAG size of input: 149 DAG size of output 57 [2018-01-28 22:14:59,523 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 57 treesize of output 42 [2018-01-28 22:14:59,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:59,525 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:59,526 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 26 treesize of output 21 [2018-01-28 22:14:59,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:59,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-28 22:14:59,533 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:59,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:59,556 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 63 [2018-01-28 22:14:59,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:14:59,559 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:14:59,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-28 22:14:59,559 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:59,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-01-28 22:14:59,579 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:59,600 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 25 treesize of output 16 [2018-01-28 22:14:59,600 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:14:59,615 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:59,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:14:59,624 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:131, output treesize:5 [2018-01-28 22:14:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:14:59,695 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:14:59,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 41 [2018-01-28 22:14:59,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-28 22:14:59,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-28 22:14:59,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1574, Unknown=0, NotChecked=0, Total=1722 [2018-01-28 22:14:59,696 INFO L87 Difference]: Start difference. First operand 525 states and 643 transitions. Second operand 42 states. [2018-01-28 22:15:01,377 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 68 DAG size of output 64 [2018-01-28 22:15:01,648 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 65 DAG size of output 55 [2018-01-28 22:15:01,958 WARN L146 SmtUtils]: Spent 258ms on a formula simplification. DAG size of input: 71 DAG size of output 71 [2018-01-28 22:15:02,213 WARN L146 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 69 DAG size of output 69 Received shutdown request... [2018-01-28 22:15:02,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-28 22:15:02,426 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 22:15:02,432 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 22:15:02,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:15:02 BoogieIcfgContainer [2018-01-28 22:15:02,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:15:02,434 INFO L168 Benchmark]: Toolchain (without parser) took 123044.63 ms. Allocated memory was 308.8 MB in the beginning and 792.2 MB in the end (delta: 483.4 MB). Free memory was 268.8 MB in the beginning and 569.1 MB in the end (delta: -300.3 MB). Peak memory consumption was 183.1 MB. Max. memory is 5.3 GB. [2018-01-28 22:15:02,435 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:15:02,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.33 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 256.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 5.3 GB. [2018-01-28 22:15:02,435 INFO L168 Benchmark]: Boogie Preprocessor took 36.11 ms. Allocated memory is still 308.8 MB. Free memory was 256.6 MB in the beginning and 254.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:15:02,436 INFO L168 Benchmark]: RCFGBuilder took 548.03 ms. Allocated memory is still 308.8 MB. Free memory was 254.6 MB in the beginning and 210.5 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 5.3 GB. [2018-01-28 22:15:02,436 INFO L168 Benchmark]: TraceAbstraction took 122247.50 ms. Allocated memory was 308.8 MB in the beginning and 792.2 MB in the end (delta: 483.4 MB). Free memory was 210.5 MB in the beginning and 569.1 MB in the end (delta: -358.7 MB). Peak memory consumption was 124.7 MB. Max. memory is 5.3 GB. [2018-01-28 22:15:02,438 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.11 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.33 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 256.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.11 ms. Allocated memory is still 308.8 MB. Free memory was 256.6 MB in the beginning and 254.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 548.03 ms. Allocated memory is still 308.8 MB. Free memory was 254.6 MB in the beginning and 210.5 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 122247.50 ms. Allocated memory was 308.8 MB in the beginning and 792.2 MB in the end (delta: 483.4 MB). Free memory was 210.5 MB in the beginning and 569.1 MB in the end (delta: -358.7 MB). Peak memory consumption was 124.7 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 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 690). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 687). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 690). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 687). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (525states) and interpolant automaton (currently 28 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (203 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 195 locations, 67 error locations. TIMEOUT Result, 122.1s OverallTime, 40 OverallIterations, 3 TraceHistogramMax, 78.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6766 SDtfs, 21475 SDslu, 42384 SDs, 0 SdLazy, 26450 SolverSat, 1892 SolverUnsat, 59 SolverUnknown, 0 SolverNotchecked, 25.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2521 GetRequests, 1334 SyntacticMatches, 97 SemanticMatches, 1090 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16583 ImplicationChecksByTransitivity, 71.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=525occurred in iteration=39, 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.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 3301 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 40.9s InterpolantComputationTime, 4174 NumberOfCodeBlocks, 4174 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 4118 ConstructedInterpolants, 359 QuantifiedInterpolants, 6850439 SizeOfPredicates, 287 NumberOfNonLiveVariables, 4790 ConjunctsInSsa, 663 ConjunctsInUnsatCore, 56 InterpolantComputations, 25 PerfectInterpolantSequences, 831/1122 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-15-02-455.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-15-02-455.csv Completed graceful shutdown